End-to-end Python pipeline that screenshots Facebook-Marketplace car ads, OCRs & structures the data with GPT, filters the Pareto-optimal deals, ranks them with PROMETHEE, and spits out a clickable HTML report of the best listings—so you spend minutes, not hours, finding a car.

• You can find the codes here

Presidential elections were held in Turkey in May 2023, alongside parliamentary elections, to elect a president for a term of five years. It marks the first time a Turkish presidential election has gone to a run-off. In this analysis, some questions regarding the opposition party leader's second round strategy are presented and answered using data of two consecutive election results.

• You can find the blog and codes here

Payment Authorization is a way to ensure that the customer's account is valid. It is requested by the merchant to hold funds for the purchase. If authorization attempt is declined by the card issuing bank, and it is not possible to contact customer then the merchant may attempt another authorization. It is important for merchant to complete these recurring authorization attempts in minimum number which leads the cost and affect the customer experience. This analysis proposes a baseline model and approach to find better recycling practice.

• Three different approach is developed, Random Forest algorithm is used for generating empirical probability distributions. Blog + Codes
• Association Rule Mining, dfprophet, tsoutlier is utilized for Exploratory Data Analysis(EDA)

Location analysis is a branch of operations research. Objective is to place available facilities in a way that minimize total transportation costs while considering constraints like avoiding placing hazardous materials near housing, and competitors' facilities. The techniques also apply to cluster analysis, coverage problem.

• Developed problem specific NSGA-2 algorithm at C++ to solve the location problem in a reasonable time. Github
• Visualizations and analysis are conducted at R.
• Linear math model is developed and solved using IBM CPLEX and C++.

Coverage Location Problems are often utilized when there is not enough budget, or human resources to cover all the demands. It seeks to cover a set of demands while one or more objectives are to be optimized.

• Developed genetic algorithm to solve well known Maximal Covering Location Problem. Report
• Compared proposed algorithm with math model and other meta-heuristic methods.