Optimization of real-world supply routes by nature-inspired metaheuristics

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10250417" target="_blank" >RIV/61989100:27240/22:10250417 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9870405" target="_blank" >https://ieeexplore.ieee.org/document/9870405</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC55065.2022.9870405" target="_blank" >10.1109/CEC55065.2022.9870405</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of real-world supply routes by nature-inspired metaheuristics

Popis výsledku v původním jazyce

The traveling salesman problem (TSP) is an iconic permutation problem with a number of applications in planning, scheduling, and logistics. It has also attracted much attention as a benchmarking problem frequently used to assess the properties of a variety of nature-inspired optimization methods. However, the standard libraries of TSP instances, such as the TSPLIB, are often decades old and might not reflect the requirements of modern real-world applications very well. In this work, we introduce several novel TSP instances representing real-world locations of pharmacies in several major cities of the Czech Republic. We look for the optimum routes between the pharmacies by selected nature-inspired algorithms and compare the results obtained on the real-world instances with their results on standard TSPLIB instances. (C) 2022 IEEE.

Název v anglickém jazyce

Optimization of real-world supply routes by nature-inspired metaheuristics

Popis výsledku anglicky

The traveling salesman problem (TSP) is an iconic permutation problem with a number of applications in planning, scheduling, and logistics. It has also attracted much attention as a benchmarking problem frequently used to assess the properties of a variety of nature-inspired optimization methods. However, the standard libraries of TSP instances, such as the TSPLIB, are often decades old and might not reflect the requirements of modern real-world applications very well. In this work, we introduce several novel TSP instances representing real-world locations of pharmacies in several major cities of the Czech Republic. We look for the optimum routes between the pharmacies by selected nature-inspired algorithms and compare the results obtained on the real-world instances with their results on standard TSPLIB instances. (C) 2022 IEEE.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

<a href="/cs/project/LTAIN19176" target="_blank" >LTAIN19176: Metaheuristický rámec pro vícecílové kombinatorické optimalizační problémy (META MO-COP)</a><br>

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í

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ů

Název statě ve sborníku

2022 IEEE Congress on Evolutionary Computation, CEC 2022 - Conference Proceedings

ISBN

978-1-66546-708-7

ISSN

—

e-ISSN

—

Počet stran výsledku

10

Strana od-do

—

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Padova

Datum konání akce

18. 7. 2022

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

WRD - Celosvětová akce

Kód UT WoS článku

—