OVRP-ICA: An imperialist-based optimization algorithm for the open vehicle routing problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F15%3A86097030" target="_blank" >RIV/61989100:27240/15:86097030 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-19644-2_19" target="_blank" >http://dx.doi.org/10.1007/978-3-319-19644-2_19</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-19644-2_19" target="_blank" >10.1007/978-3-319-19644-2_19</a>

Jazyk výsledku

angličtina

Název v původním jazyce

OVRP-ICA: An imperialist-based optimization algorithm for the open vehicle routing problem

Popis výsledku v původním jazyce

Open vehicle routing problem (OVRP) is one of the most important problems in vehicle routing, which has attracted great interest in several recent applications in industries. The purpose in solving the OVRP is to decrease the number of vehicles and to reduce travel distance and time of the vehicles. In this article, a new meta-heuristic algorithm called OVRP-ICA is presented for the above-mentioned problem. This is a kind of combinatorial optimization problem that can use a homogeneous fleet of vehiclesthat do not necessarily return to the initial depot to solve the problem of offering services to a set of customers exploiting the imperialist competitive algorithm. OVRP-ICA is compared with some well-known state-of-the-art algorithms and the results confirmed that it has high efficiency in solving the above-mentioned problem. (C) Springer International Publishing Switzerland 2015.

Název v anglickém jazyce

OVRP-ICA: An imperialist-based optimization algorithm for the open vehicle routing problem

Popis výsledku anglicky

Open vehicle routing problem (OVRP) is one of the most important problems in vehicle routing, which has attracted great interest in several recent applications in industries. The purpose in solving the OVRP is to decrease the number of vehicles and to reduce travel distance and time of the vehicles. In this article, a new meta-heuristic algorithm called OVRP-ICA is presented for the above-mentioned problem. This is a kind of combinatorial optimization problem that can use a homogeneous fleet of vehiclesthat do not necessarily return to the initial depot to solve the problem of offering services to a set of customers exploiting the imperialist competitive algorithm. OVRP-ICA is compared with some well-known state-of-the-art algorithms and the results confirmed that it has high efficiency in solving the above-mentioned problem. (C) Springer International Publishing Switzerland 2015.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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

Lecture Notes in Computer Science. Volume 9121

ISBN

978-3-319-19643-5

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

13

Strana od-do

221-233

Název nakladatele

Springer Verlag

Místo vydání

London

Místo konání akce

Bilbao

Datum konání akce

22. 6. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—