Utilization of the Capacitated Vehicle Routing Problem with the Capacity Limitation of Nodes in Water Transportation
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F22%3A39921140" target="_blank" >RIV/00216275:25510/22:39921140 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.nasemore.com/utilization-of-the-capacitated-vehicle-routing-problem-with-the-capacity-limitation-of-nodes-in-water-transportation/" target="_blank" >https://www.nasemore.com/utilization-of-the-capacitated-vehicle-routing-problem-with-the-capacity-limitation-of-nodes-in-water-transportation/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.17818/NM/2022/3.5" target="_blank" >10.17818/NM/2022/3.5</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Utilization of the Capacitated Vehicle Routing Problem with the Capacity Limitation of Nodes in Water Transportation
Popis výsledku v původním jazyce
The paper discusses the option of using the capacitated vehicle routing problem with the capacity limitation of nodes in water transportation. The problem is used to design circular routes for vehicles of different carriers, each of which services the selected nodes of the transportation network. The goal is to design circular routes where the capacity of vehicles is not exceeded and the value of the objective function is minimal. The limited capacity of nodes is given by the limited number of vehicles that can be operated at a particular node at any given time. The problem allows to design circulation so that the waiting time of vehicles to release the capacity of the node is minimized. This makes it possible to achieve an additional reduction in the total traffic time. The possibility of using the role of the CVRPCLN in water transportation is demonstrated in a case study for the design of circular routes for vessels serving ports. The design of routes is performed using the described problem and using the capacitated vehicle routing problem, which does not take into account the limited capacity of the nodes. To solve both problems, the author uses an evolutionary algorithm, which is part of the optimization module Solver. A comparison of the results indicates that the use of the investigated task can lead to a significant reduction in waiting times in ports for selected tasks in the field of water transportation. This also leads to a significant reduction in the total traffic time.
Název v anglickém jazyce
Utilization of the Capacitated Vehicle Routing Problem with the Capacity Limitation of Nodes in Water Transportation
Popis výsledku anglicky
The paper discusses the option of using the capacitated vehicle routing problem with the capacity limitation of nodes in water transportation. The problem is used to design circular routes for vehicles of different carriers, each of which services the selected nodes of the transportation network. The goal is to design circular routes where the capacity of vehicles is not exceeded and the value of the objective function is minimal. The limited capacity of nodes is given by the limited number of vehicles that can be operated at a particular node at any given time. The problem allows to design circulation so that the waiting time of vehicles to release the capacity of the node is minimized. This makes it possible to achieve an additional reduction in the total traffic time. The possibility of using the role of the CVRPCLN in water transportation is demonstrated in a case study for the design of circular routes for vessels serving ports. The design of routes is performed using the described problem and using the capacitated vehicle routing problem, which does not take into account the limited capacity of the nodes. To solve both problems, the author uses an evolutionary algorithm, which is part of the optimization module Solver. A comparison of the results indicates that the use of the investigated task can lead to a significant reduction in waiting times in ports for selected tasks in the field of water transportation. This also leads to a significant reduction in the total traffic time.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
50204 - Business and management
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2022
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 periodika
Naše more: Journal of Marine Science
ISSN
0469-6255
e-ISSN
1848-6320
Svazek periodika
69
Číslo periodika v rámci svazku
3
Stát vydavatele periodika
HR - Chorvatská republika
Počet stran výsledku
10
Strana od-do
149-158
Kód UT WoS článku
000891939700004
EID výsledku v databázi Scopus
2-s2.0-85142068004