Endüstri Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942
Browse
2 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 A Comparative Study of Branch-And Algorithms for Vehicle Routing With Time Windows and Waiting Time Costs(Wiley, 2026-02-09) Michelini, Stefano; Kucukaydin, Hande; Arda, YaseminBranch-and-price is one of the most commonly used methodologies for solving routing problems. In recent years, several studies have investigated advanced labeling algorithms to solve the related pricing problem, which is usually a variant of the elementary shortest path problem with resource constraints. Such algorithms include efficient techniques such as decremental state space relaxation, ng-route relaxation, and several hybridizations of these two relaxation methods. In this study, we compare the performance of these labeling algorithms in a branch-and-price framework when applied to the vehicle routing problem with time windows and a variant of this problem in which waiting times have a linear cost. For the latter problem, we also propose an appropriate label structure with associated resource extension functions and dominance rules. We perform these comparisons by using a rigorous methodology, which consists of parameterizing several features of these algorithms, obtaining a good parameter configuration for each algorithm, and analyzing the performance of these configurations on benchmark instances. In order to obtain good configurations, we make use of irace, which is a tool for automated parameter tuning, while statistical tests are used for performance comparisons. Our results show that a class of hybrid algorithms with certain features based on ng-route relaxation outperforms all the others.