Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG42__%2F18%3A00535317" target="_blank" >RIV/60162694:G42__/18:00535317 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.mdpi.com/1999-4893/11/5/74" target="_blank" >http://www.mdpi.com/1999-4893/11/5/74</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/a11050074" target="_blank" >10.3390/a11050074</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion

Popis výsledku v původním jazyce

This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists in altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicles whereas the criterion of modified MDVRP (M MDVRP) is to minimize the longest route of all vehicles; thus the time to conduct the routing operation eis as short as possible. For this problem, a metaheuristic algorithm - based on the Ant Colony Optimization (ACO) theory and developed by the author for solving the classic MDVRP instances - has been modified and adapted for M-MDVRP. In this article, an additional deterministic optimization process which further enhances the original ACO algorithm has been proposed. For evaluation of results, Cordeau's benchmark instances are used.

Název v anglickém jazyce

Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion

Popis výsledku anglicky

This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists in altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicles whereas the criterion of modified MDVRP (M MDVRP) is to minimize the longest route of all vehicles; thus the time to conduct the routing operation eis as short as possible. For this problem, a metaheuristic algorithm - based on the Ant Colony Optimization (ACO) theory and developed by the author for solving the classic MDVRP instances - has been modified and adapted for M-MDVRP. In this article, an additional deterministic optimization process which further enhances the original ACO algorithm has been proposed. For evaluation of results, Cordeau's benchmark instances are used.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

50902 - Social sciences, interdisciplinary

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

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 periodika

Algorithms

ISSN

1999-4893

e-ISSN

—

Svazek periodika

11

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

14

Strana od-do

1-14

Kód UT WoS článku

000435189200019

EID výsledku v databázi Scopus

—