Endüstri Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942
Browse
3 results
Search Results
Article Empowering Electric Vehicle Adoption: Innovative Strategies for Optimizing Charging Station Placement Based on Projected Demand(Wiley, 2025-01-01) Cekyay, Bora; Kabak, Ozgur; Ozaydin, Ozay; Isik, Mine; Toktas-Palut, Peral; Topcu, Y. Ilker; Ulengin, FusunElectric vehicles (EVs) are pivotal for reducing transportation-related emissions; however, the lack of adequate charging infrastructure remains a significant barrier to their widespread adoption. This study presents a comprehensive methodology for optimizing EV charging station placement. It combines a gravity model, scenario analysis, and mixed-integer linear programming (MILP) to ensure a thorough and robust approach. The model aims to maximize accessibility by ensuring both path-level and overall system demand coverage across diverse scenarios, providing reassurance about the validity of the findings. The methodology is tested on the Bursa-& Idot;zmir motorway in Turkey, a strategic intercity route with rapidly growing EV penetration. Results reveal that the optimal configuration involves locating charging stations in seven of the nine service areas. This allocation secures a minimum path coverage ratio of 0.903, meaning 90.3% of the route is covered by charging stations, and an overall demand coverage ratio of 0.935, indicating that 93.5% of total demand is covered across all scenarios. A sensitivity analysis further shows that increasing the network to 45 chargers elevates reachability levels to above 97%, indicating the infrastructure scale required for reliable service quality. The findings underscore the practical applicability of the proposed framework, providing policymakers and infrastructure planners with robust, data-driven guidance for charging network expansion. By integrating demand forecasting with resilient optimization, this study advances both methodological and empirical insights, empowering the audience to make informed decisions for sustainable EV adoption.Article Citation - WoS: 1Citation - Scopus: 2A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning(Informs, 2023-11-01) van den Heuvel, Wilco; Ağralı, Semra; Taşkın, Z. CanerWe study an integrated market selection and production planning problem. There is a set of markets with deterministic demand, and each market has a certain revenue that is obtained if the market's demand is satisfied throughout a planning horizon. The demand is satisfied with a production scheme that has a lot-sizing structure. The problem is to decide on which markets' demand to satisfy and plan the production simultaneously. We consider both single and multiobjective settings. The single objective problem maximizes the profit, whereas the multiobjective problem includes the maximization of the revenue and the minimization of the production cost objectives. We develop a decomposition-based exact solution algorithm for the single objective setting and show how it can be used in a proposed three-phase algorithm for the multiobjective setting. The master problem chooses a subset of markets, and the subproblem calculates an optimal production plan to satisfy the selected markets' demand. We investigate the subproblem from a cooperative game theory perspective to devise cuts and strengthen them based on lifting. We also propose a set of valid inequalities and preprocessing rules to improve the proposed algorithm. We test the efficacy of our solution method over a suite of problem instances and show that our algorithm substantially decreases solution times for all problem instances.Article A Lot-Sizing Problem in Deliberated and Controlled Co-Production Systems(Taylor and Francis, 2022-02-11) Kabakulak, Banu; Ağralı, Semra; Taşkın, Z. Caner; Pamuk, BahadırWe consider an uncapacitated lot sizing problem in co-production systems, in which it is possible to produce multiple items simultaneously in a single production run. Each product has a deterministic demand to be satisfied on time. The decision is to choose which items to co-produce and the amount of production throughout a predetermined planning horizon. We show that the lot sizing problem with co-production is strongly NP-Hard. Then, we develop various mixed-integer linear programming (MILP) formulation of the problem and show that LP relaxations of all MILPs are equal. We develop a separation algorithm based on a set of valid inequalities, lower bounds based on a dynamic lot-sizing relaxation of our problem and a constructive heuristic that is used to obtain an initial solution for the solver, which form the basis of our proposed Branch & Cut algorithm for the problem. We test our models and algorithms on different data sets and provide the results.