The electric location-routing problem with heterogeneous fleet: Formulation and Benders decomposition approach

Abstract

The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: The case study of COVID-19

“…From then until now, it has been gaining prestige as one of the most powerful exact algorithms to solve a broad range of NP-hard problems, such as vehicle routing ( Corréa, Langevin, & Rousseau, 2007 ), facility location ( Boland, Fischetti, Monaci, & Savelsbergh, 2016 ), logistics network design ( Cordeau, Pasin, & Solomon, 2006 ), transportation ( Coelho & Laporte, 2014 ), and inventory vehicle routing ( Alkaabneh, Diabat, & Gao, 2020 ). What is more, many studies in the literature have used the BD algorithm to solve the vehicle routing problem and its derivatives, such as location-routing ( Çalık, Oulamara, Prodhon, & Salhi, 2021 ), location-inventory-routing ( Zheng, Yin, & Zhang, 2019 ), and production-inventory-routing ( Cordeau, Laganà, Musmanno, & Vocaturo, 2015 ) problems. As a result, several efficient valid inequalities have been presented for these problems that could limit the solution space and improve the convergence speed of the BD.…”

Joint Routing and Charging Problem of Electric Vehicles With Incentive-Aware Customers Considering Spatio-Temporal Charging Prices

“…In this paper, we roughly classify the solution methodologies of solving EVRP as two categories, (a) heuristic optimization methods [2], [6], [22], and (b) exact optimization methods [3], [4], [5], [7], [15]. To solve EVRP at a reasonable computational cost, Schneider et al [6] leverage a hybrid heuristics algorithm which consists of variable neighborhood search and Tabu search method.…”

“…To solve EVRP at a reasonable computational cost, Schneider et al [6] leverage a hybrid heuristics algorithm which consists of variable neighborhood search and Tabu search method. Since there is no guarantee either on the feasibility of solutions or on the optimality of solutions, Desaulniers [4] propose exact branch-price-and-cut algorithms to solve EVRP with time windows, and Calik et al [3] present an efficient Benders decomposition method to solve the electric vehicle locationrouting problem. According to the review paper [23], the heuristic optimization method can be used to solve the EVRP.…”