Transformation of task to locate a minimal Hamiltonian circuit into the problem of finding the Eulerian path in vehicle routing application

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27510%2F17%3A10237928" target="_blank" >RIV/61989100:27510/17:10237928 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Transformation of task to locate a minimal Hamiltonian circuit into the problem of finding the Eulerian path in vehicle routing application

Popis výsledku v původním jazyce

If we want to solve tasks aimed at designing optimal route of utility vehicle, the attention can be divided into two sets of tasks. First, it is a task aimed at vertex service of transport network, when primary problem is to locate a minimum of Hamiltonian circuit. Secondly, it is a task that is oriented on service of edges in a transport network, when default problem is to find the Eulerian tour. In this paper, we shall present a possibility of transformation of the task to find a minimal Hamiltonian circuit into the task to locate the Eulerian tour, which is modified for a wider transport network. Some complementary network for an edge service can be used in this case. This network allows an effective crossing of service vehicle to reduce unproductive distance travelled. A mathematical programming approach will be used for the problem mentioned above and experiments with real data will be presented in the following too.

Název v anglickém jazyce

Transformation of task to locate a minimal Hamiltonian circuit into the problem of finding the Eulerian path in vehicle routing application

Popis výsledku anglicky

If we want to solve tasks aimed at designing optimal route of utility vehicle, the attention can be divided into two sets of tasks. First, it is a task aimed at vertex service of transport network, when primary problem is to locate a minimum of Hamiltonian circuit. Secondly, it is a task that is oriented on service of edges in a transport network, when default problem is to find the Eulerian tour. In this paper, we shall present a possibility of transformation of the task to find a minimal Hamiltonian circuit into the task to locate the Eulerian tour, which is modified for a wider transport network. Some complementary network for an edge service can be used in this case. This network allows an effective crossing of service vehicle to reduce unproductive distance travelled. A mathematical programming approach will be used for the problem mentioned above and experiments with real data will be presented in the following too.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20104 - Transport engineering

Projekt

<a href="/cs/project/TH02010930" target="_blank" >TH02010930: Efektivní přístupy k úsporným a adaptabilním systémům údržby a obsluhy dopravních sítí</a><br>

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2017

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

Mathematical Methods in Economics: MME 2017 : 35th international conference : conference proceedings : Hradec Králové, Czech Republic, September 13th-15th, 2017, University of Hradec Králové

ISBN

978-80-7435-678-0

ISSN

—

e-ISSN

neuvedeno

Počet stran výsledku

6

Strana od-do

360-365

Název nakladatele

Gaudeamus

Místo vydání

Hradec Králové

Místo konání akce

Hradec Králové

Datum konání akce

13. 9. 2017

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

EUR - Evropská akce

Kód UT WoS článku

000427151400062