The GRASP Metaheuristic for the Electric Vehicle Routing Problem
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00347752" target="_blank" >RIV/68407700:21730/21:00347752 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1007/978-3-030-70740-8_12" target="_blank" >https://doi.org/10.1007/978-3-030-70740-8_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-70740-8_12" target="_blank" >10.1007/978-3-030-70740-8_12</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
The GRASP Metaheuristic for the Electric Vehicle Routing Problem
Popis výsledku v původním jazyce
The Electric Vehicle Routing Problem (EVRP) is a recently formulated combination of the Capacitated Vehicle Routing Problem (CVRP) and the Green Vehicle Routing Problem (GVRP). The goal is to satisfy all customers' demands while considering the vehicles' load capacity and limited driving range. All vehicles start from one central depot and can recharge during operation at multiple charging stations. The EVRP reflects the recent introduction of electric vehicles into fleets of delivery companies and represents a general formulation of numerous more specific VRP variants. This paper presents a newly proposed approach based on Greedy Randomized Adaptive Search Procedure (GRASP) scheme addressing the EVRP and documents its performance on a recently created dataset. GRASP is a neighbourhood-oriented metaheuristic performing repeated randomized construction of a valid solution, which is subsequently further improved in a local search phase. The implemented metaheuristic improves multiple best-known solutions and sets a benchmark on some previously unsolved instances.
Název v anglickém jazyce
The GRASP Metaheuristic for the Electric Vehicle Routing Problem
Popis výsledku anglicky
The Electric Vehicle Routing Problem (EVRP) is a recently formulated combination of the Capacitated Vehicle Routing Problem (CVRP) and the Green Vehicle Routing Problem (GVRP). The goal is to satisfy all customers' demands while considering the vehicles' load capacity and limited driving range. All vehicles start from one central depot and can recharge during operation at multiple charging stations. The EVRP reflects the recent introduction of electric vehicles into fleets of delivery companies and represents a general formulation of numerous more specific VRP variants. This paper presents a newly proposed approach based on Greedy Randomized Adaptive Search Procedure (GRASP) scheme addressing the EVRP and documents its performance on a recently created dataset. GRASP is a neighbourhood-oriented metaheuristic performing repeated randomized construction of a valid solution, which is subsequently further improved in a local search phase. The implemented metaheuristic improves multiple best-known solutions and sets a benchmark on some previously unsolved instances.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2021
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Modelling and Simulation for Autonomous Systems
ISBN
978-3-030-70739-2
ISSN
0302-9743
e-ISSN
1611-3349
Počet stran výsledku
17
Strana od-do
189-205
Název nakladatele
Springer
Místo vydání
Cham
Místo konání akce
Praha
Datum konání akce
21. 10. 2020
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
000763018100012