Optimizing logistics routes in the field of maintenance
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27360%2F19%3A10244524" target="_blank" >RIV/61989100:27360/19:10244524 - isvavai.cz</a>
Výsledek na webu
<a href="http://actalogistica.eu/issues/2019/III_2019_05_Frischer_Pollak_Jancikova.pdf" target="_blank" >http://actalogistica.eu/issues/2019/III_2019_05_Frischer_Pollak_Jancikova.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.22306/al.v6i3.123" target="_blank" >10.22306/al.v6i3.123</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Optimizing logistics routes in the field of maintenance
Popis výsledku v původním jazyce
In the event that there is a requirement to provide maintenance with a service intervention somewhere in the area, it is necessary to select a service team which is optimal for the given task for all the assessed aspects. In this article, tests and methods based on TSP principles have been developed that are able to optimize route selection between key points. Due to the complexity of algorithm design, two approaches have been validated. The "Brute Force" method, which can provide information on the choice of the optimal route according to the specified parameters, and the "Nearest Neighbour" method, which is able to quickly calculate a large group of intermediate points, but only provides sufficient results. The aim was to create a methodology, guidance, and direction in evaluating route selection. That is why two basically opposed methods of TSP solution have been chosen, modified by the authors into a form suitable for implementation on virtually any platform. Although the design and program implementation was based on the MATLAB platform, no proprietary functions and libraries are used and the entire software design is implemented without the need for their use.
Název v anglickém jazyce
Optimizing logistics routes in the field of maintenance
Popis výsledku anglicky
In the event that there is a requirement to provide maintenance with a service intervention somewhere in the area, it is necessary to select a service team which is optimal for the given task for all the assessed aspects. In this article, tests and methods based on TSP principles have been developed that are able to optimize route selection between key points. Due to the complexity of algorithm design, two approaches have been validated. The "Brute Force" method, which can provide information on the choice of the optimal route according to the specified parameters, and the "Nearest Neighbour" method, which is able to quickly calculate a large group of intermediate points, but only provides sufficient results. The aim was to create a methodology, guidance, and direction in evaluating route selection. That is why two basically opposed methods of TSP solution have been chosen, modified by the authors into a form suitable for implementation on virtually any platform. Although the design and program implementation was based on the MATLAB platform, no proprietary functions and libraries are used and the entire software design is implemented without the need for their use.
Klasifikace
Druh
J<sub>SC</sub> - Článek v periodiku v databázi SCOPUS
CEP obor
—
OECD FORD obor
20205 - Automation and control systems
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2019
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ů
Údaje specifické pro druh výsledku
Název periodika
Acta logistica
ISSN
1339-5629
e-ISSN
—
Svazek periodika
6
Číslo periodika v rámci svazku
3
Stát vydavatele periodika
SK - Slovenská republika
Počet stran výsledku
9
Strana od-do
93-101
Kód UT WoS článku
—
EID výsledku v databázi Scopus
2-s2.0-85073572361