All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

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

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20104 - Transport engineering

Result continuities

  • Project

    <a href="/en/project/TH02010930" target="_blank" >TH02010930: Effective approaches to economical and adaptable systems of maintenance and operation of transport networks</a><br>

  • Continuities

    V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    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

  • Number of pages

    6

  • Pages from-to

    360-365

  • Publisher name

    Gaudeamus

  • Place of publication

    Hradec Králové

  • Event location

    Hradec Králové

  • Event date

    Sep 13, 2017

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000427151400062