Comparison of parallel versions of ALNS, ACO and Branch and cut algorithms for vehicle routing problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A10240400" target="_blank" >RIV/61989100:27240/17:10240400 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27740/17:10240400

Výsledek na webu

<a href="http://fgg-web.fgg.uni-lj.si/~/sdrobne/sor/SOR'17%20-%20Proceedings.pdf" target="_blank" >http://fgg-web.fgg.uni-lj.si/~/sdrobne/sor/SOR'17%20-%20Proceedings.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Comparison of parallel versions of ALNS, ACO and Branch and cut algorithms for vehicle routing problem

Popis výsledku v původním jazyce

Transportation companies use optimization algorithms to optimize their deliveries. Such daily planning requires large computing capacity. Fast progress of high performance computers allows to solve more complex problems and with better HPC effectivity, the cost of computations decreases. In this paper, we use our set of benchmarks for the experiments which show results of heuristic, metaheuristic and exact algorithm for solving Capacitated Vehicle Routing Problem. The experiments provide a comparison of algorithms in terms of the ratio between a cost of the computation (in sense of required time) and a quality of the reached solution. Although the exact algorithms have a limit in use in terms of size of instances, our results demonstrate that using exact method can be advantageous for solving smaller instances. The algorithms were run on the supercomputer Salomon.

Název v anglickém jazyce

Comparison of parallel versions of ALNS, ACO and Branch and cut algorithms for vehicle routing problem

Popis výsledku anglicky

Transportation companies use optimization algorithms to optimize their deliveries. Such daily planning requires large computing capacity. Fast progress of high performance computers allows to solve more complex problems and with better HPC effectivity, the cost of computations decreases. In this paper, we use our set of benchmarks for the experiments which show results of heuristic, metaheuristic and exact algorithm for solving Capacitated Vehicle Routing Problem. The experiments provide a comparison of algorithms in terms of the ratio between a cost of the computation (in sense of required time) and a quality of the reached solution. Although the exact algorithms have a limit in use in terms of size of instances, our results demonstrate that using exact method can be advantageous for solving smaller instances. The algorithms were run on the supercomputer Salomon.

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

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

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

SOR &apos;17 proceedings: the 14th International Symposium on Operational Research in Slovenia : Bled, Slovenia, September 27-29, 2017

ISBN

978-961-6165-50-1

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

6

Strana od-do

97-102

Název nakladatele

Slovensko drustvo informatika

Místo vydání

Lublaň

Místo konání akce

Bled

Datum konání akce

27. 9. 2017

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

EUR - Evropská akce

Kód UT WoS článku

—