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

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

50902 - Social sciences, interdisciplinary

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Algorithms

ISSN

1999-4893

e-ISSN

—

Volume of the periodical

11

Issue of the periodical within the volume

5

Country of publishing house

CH - SWITZERLAND

Number of pages

14

Pages from-to

1-14

UT code for WoS article

000435189200019

EID of the result in the Scopus database

—