The modified rural postman problem in vehicle route optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27200%2F18%3A10240477" target="_blank" >RIV/61989100:27200/18:10240477 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989100:27350/18:10240477 RIV/61989100:27510/18:10240477

Výsledek na webu

<a href="http://communications.uniza.sk/index.php/communications/article/view/259/231" target="_blank" >http://communications.uniza.sk/index.php/communications/article/view/259/231</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

The modified rural postman problem in vehicle route optimization

Popis výsledku v původním jazyce

The submitted paper deals with designing routes of the vehicles, which provide the transport network services. We limit our focus to such tasks, where the priority is the edge service in the transport network and the initial problem is finding an Eulerian path. Regarding to real-life problems, this contribution presents such procedure of solving, which takes into account both the existence of a mixed transport network containing one-way roads and the existence of a wider transport network. In this network, there are only selected edges with possibility of the effective passages. This problem can be solved by the modified Rural Postman Problem assuming the strongly connected network. Linear programming is a suitable tool for designing optimal routes of service vehicles. (C) 2018 Sochi State University for Tourism and Recreation. All rights reserved.

Název v anglickém jazyce

The modified rural postman problem in vehicle route optimization

Popis výsledku anglicky

The submitted paper deals with designing routes of the vehicles, which provide the transport network services. We limit our focus to such tasks, where the priority is the edge service in the transport network and the initial problem is finding an Eulerian path. Regarding to real-life problems, this contribution presents such procedure of solving, which takes into account both the existence of a mixed transport network containing one-way roads and the existence of a wider transport network. In this network, there are only selected edges with possibility of the effective passages. This problem can be solved by the modified Rural Postman Problem assuming the strongly connected network. Linear programming is a suitable tool for designing optimal routes of service vehicles. (C) 2018 Sochi State University for Tourism and Recreation. All rights reserved.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

20104 - Transport engineering

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)

Rok uplatnění

2018

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 periodika

Communications

ISSN

1335-4205

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

SK - Slovenská republika

Počet stran výsledku

5

Strana od-do

88-92

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85054343062