Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mathematical Modeling and Adaptive Large Neighborhood Search Heuristic Method

Electric vehicles (EVs) are a promising option to reduce air pollution and shipping costs, especially in urban areas. To provide scientific guidance for the growing number of logistics companies using EVs, we investigated an electric-vehicle-routing problem with simultaneous pickup and delivery that...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Energies (Basel) Ročník 15; číslo 23; s. 9222
Hlavní autoři: Xu, Wei, Zhang, Chenghao, Cheng, Ming, Huang, Yucheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.12.2022
Témata:
adaptive large neighborhood search
Air quality management
Algorithms
Approximation
Automobiles, Electric
Customers
Distribution costs
Electric vehicles
electric-vehicle-routing problem
Energy consumption
energy saving
Environmental protection
Heuristic
Linear programming
Literature reviews
load-dependent discharging
Logistics services
Mathematical programming
Methods
mixed integer linear problem
non-linear charging
Sensitivity analysis
Rhode Island
ISSN:1996-1073, 1996-1073
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Electric vehicles (EVs) are a promising option to reduce air pollution and shipping costs, especially in urban areas. To provide scientific guidance for the growing number of logistics companies using EVs, we investigated an electric-vehicle-routing problem with simultaneous pickup and delivery that also considers non-linear charging and load-dependent discharging (EVRPSPD-NL-LD). The objective was to minimize the total number of EVs and the total working time, including travel time, charging time, waiting time, and service time. We formulated the problem as a mixed integer linear program (MILP), and small-size problems could be solved to optimality in an acceptable amount of time using the commercial solver IBM ILOG CPLEX Optimization Studio (CPLEX). In view of the fact that the problem is NP-hard, an adaptive large neighborhood search (ALNS) metaheuristic method was proposed to solve large-size problems. Meanwhile, new operators and a time priority approach were developed to provide options for different scenarios. The results of our computational investigation and sensitivity analysis showed that the proposed methods are effective and efficient for modified benchmark instances.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1996-1073
1996-1073
DOI:10.3390/en15239222