Modeling the Delivery Routes Carried out by Automated Guided Vehicles when Using the Specific Mathematical Optimization Method

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

Modeling the Delivery Routes Carried out by Automated Guided Vehicles when Using the Specific Mathematical Optimization Method

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)

Project

<a href="/en/project/LTC19009" target="_blank" >LTC19009: Autonomous mobility in the context of regional development</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Open Engineering

ISSN

2391-5439

e-ISSN

—

Volume of the periodical

10

Issue of the periodical within the volume

1

Country of publishing house

PL - POLAND

Number of pages

9

Pages from-to

166-174

UT code for WoS article

000519204200001

EID of the result in the Scopus database

—