Initial Solution Constructors for Capacitated Green Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00347713" target="_blank" >RIV/68407700:21730/21:00347713 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-70740-8_16" target="_blank" >https://doi.org/10.1007/978-3-030-70740-8_16</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-70740-8_16" target="_blank" >10.1007/978-3-030-70740-8_16</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Initial Solution Constructors for Capacitated Green Vehicle Routing Problem

Popis výsledku v původním jazyce

This paper presents an analysis of the initial feasible solution constructions for the Capacitated Green Vehicle Routing Problem (CGVRP). CGVRP is a more challenging variant of the conventional Vehicle Routing Problem (VRP), where Alternative Fuel Vehicles (AFVs) are limited by their fuel capacity and the scarce availability of Alternative Fueling Stations (AFSs). The problem also imposes a constraint on the maximum carrying capacity of the vehicle. Presented methods can be used as a starting point for more advanced metaheuristics. Some of the methods can be seen as a generalization of the traveling salesmen problem, where one can draw on the numerous techniques described and known in this domain, other methods belong to the class of divide and conquer techniques, where the subproblems are some variants of the VRP. We use a two-phase approach with several different methods for both the initial VRP route construction and the following CGVRP tour validation and repair procedure. The methods are compared on various instances and their advantages are discussed in relation to common variants of the VRP, together with a possibility of their improvements or extensions.

Název v anglickém jazyce

Initial Solution Constructors for Capacitated Green Vehicle Routing Problem

Popis výsledku anglicky

This paper presents an analysis of the initial feasible solution constructions for the Capacitated Green Vehicle Routing Problem (CGVRP). CGVRP is a more challenging variant of the conventional Vehicle Routing Problem (VRP), where Alternative Fuel Vehicles (AFVs) are limited by their fuel capacity and the scarce availability of Alternative Fueling Stations (AFSs). The problem also imposes a constraint on the maximum carrying capacity of the vehicle. Presented methods can be used as a starting point for more advanced metaheuristics. Some of the methods can be seen as a generalization of the traveling salesmen problem, where one can draw on the numerous techniques described and known in this domain, other methods belong to the class of divide and conquer techniques, where the subproblems are some variants of the VRP. We use a two-phase approach with several different methods for both the initial VRP route construction and the following CGVRP tour validation and repair procedure. The methods are compared on various instances and their advantages are discussed in relation to common variants of the VRP, together with a possibility of their improvements or extensions.

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)

Projekt

<a href="/cs/project/GX19-26143X" target="_blank" >GX19-26143X: Neperiodické materiály vykazující strukturované deformace: Modulární návrh a výroba</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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ů

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

19

Strana od-do

250-268

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

000763018100016