Modeling the Delivery Routes Carried out by Automated Guided Vehicles when Using the Specific Mathematical Optimization Method
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F20%3A00002039" target="_blank" >RIV/75081431:_____/20:00002039 - isvavai.cz</a>
Výsledek na webu
<a href="https://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=7&SID=C4v3XlBvvWscUjdefgp&page=1&doc=1" target="_blank" >https://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=7&SID=C4v3XlBvvWscUjdefgp&page=1&doc=1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1515/eng-2020-0027" target="_blank" >10.1515/eng-2020-0027</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Modeling the Delivery Routes Carried out by Automated Guided Vehicles when Using the Specific Mathematical Optimization Method
Popis výsledku v původním jazyce
Distribution tasks or transportation problems when using Operations Research methods are mostly addressed by vehicle routing problem methods dealing with an issue of supplying to several nodes, wherein the route begins in a point of origin and, after accomplishing deliveries to individual nodes, vehicle returns to an initial point. Each node can be operated only once, the order of nodes is not determined; however, the major objective is to find the shortest route possible. The aim of this research study is to formulate options to model delivery routes executed by automated guided vehicles in an extensive logistics areal by applying the specific mathematical optimization method. After description of several fundamental aspects and attributes related to automated guided vehicles, distribution tasks and vehicle routing problems which are discussed in introductory chapters, the most important parts containing the specification of Greedy algorithm, as a very useful optimization method for the given purpose, as well as the very models of cargo delivery by automated guided vehicles without / with initial distance optimization are presented.
Název v anglickém jazyce
Modeling the Delivery Routes Carried out by Automated Guided Vehicles when Using the Specific Mathematical Optimization Method
Popis výsledku anglicky
Distribution tasks or transportation problems when using Operations Research methods are mostly addressed by vehicle routing problem methods dealing with an issue of supplying to several nodes, wherein the route begins in a point of origin and, after accomplishing deliveries to individual nodes, vehicle returns to an initial point. Each node can be operated only once, the order of nodes is not determined; however, the major objective is to find the shortest route possible. The aim of this research study is to formulate options to model delivery routes executed by automated guided vehicles in an extensive logistics areal by applying the specific mathematical optimization method. After description of several fundamental aspects and attributes related to automated guided vehicles, distribution tasks and vehicle routing problems which are discussed in introductory chapters, the most important parts containing the specification of Greedy algorithm, as a very useful optimization method for the given purpose, as well as the very models of cargo delivery by automated guided vehicles without / with initial distance optimization are presented.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)
Návaznosti výsledku
Projekt
<a href="/cs/project/LTC19009" target="_blank" >LTC19009: Autonomní mobilita v kontextu rozvoje regionu</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Ostatní
Rok uplatnění
2020
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
Open Engineering
ISSN
2391-5439
e-ISSN
—
Svazek periodika
10
Číslo periodika v rámci svazku
1
Stát vydavatele periodika
PL - Polská republika
Počet stran výsledku
9
Strana od-do
166-174
Kód UT WoS článku
000519204200001
EID výsledku v databázi Scopus
—