Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/51546
Title: Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging
Authors: Akbay, M.A.
Kalaycı, Can Berk
Blum, C.
Keywords: Construct
Electric vehicle routing
Merge
Partial recharging
Simultaneous pickup and delivery
Solve & adapt
Time windows
Charging (batteries)
Electric lines
Electric vehicles
Heuristic algorithms
Iterative methods
Mergers and acquisitions
Pickups
Construct
Electric vehicle routing
Merge
Partial recharging
Problem instances
Simultaneous pickup and deliveries
Solve & adapt
Time windows
Vehicle charging
Vehicle routing problem with time windows
Vehicle routing
Publisher: Springer Science and Business Media Deutschland GmbH
Abstract: As a consequence of the growing importance of environmental issues, partially due to a negative impact of transportation activities, the use of environmentally-friendly vehicles in logistics has become one of the prominent concepts in recent years. In this line, this paper addresses a variant of the vehicle routing problem, the electric vehicle routing problem with time windows and simultaneous pickup and deliveries, which are two essential real-life constraints. Moreover, we consider partial recharging of electric vehicles at charging stations. A recent self-adaptive variant of the matheuristic “Construct, Merge, Solve & Adapt” (CMSA) is applied to solve the tackled problem. CMSA combines heuristic elements, such as the probabilistic generation of solutions, with an exact solver that is iteratively applied to sub-instances of the original problem instances. Two constructive heuristics, a Clark & Wright Savings algorithm and a sequential insertion heuristic, are probabilistically applied to generate solutions which are then subsequently merged to form a sub-instance. The numerical results show that CMSA outperforms CPLEX in the context of small problem instances. Moreover, it is shown that CMSA outperforms the heuristic algorithms when large problem instances are concerned. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Description: 14th Metaheuristics International Conference, MIC 2022 -- 11 July 2022 through 14 July 2022 -- 291239
URI: https://doi.org/10.1007/978-3-031-26504-4_1
https://hdl.handle.net/11499/51546
ISBN: 9783031265037
ISSN: 0302-9743
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

SCOPUSTM   
Citations

1
checked on Dec 14, 2024

WEB OF SCIENCETM
Citations

1
checked on Dec 19, 2024

Page view(s)

54
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.