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”

Application of the p-Median Approach for a Basic Decomposition of a Set of Vertices to Service Vehicles Routing

The result's identifiers

  • Result code in IS VaVaI

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

  • Alternative codes found

    RIV/61989100:27350/18:10240960 RIV/61989100:27510/18:10240960

  • Result on the web

    <a href="https://mme2018.fm.vse.cz/wp-content/uploads/2018/09/MME2018-Electronic_proceedings.pdf" target="_blank" >https://mme2018.fm.vse.cz/wp-content/uploads/2018/09/MME2018-Electronic_proceedings.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Application of the p-Median Approach for a Basic Decomposition of a Set of Vertices to Service Vehicles Routing

  • Original language description

    In order to design the service vehicle routes the main goal is to minimize the total distance travelled (in kilometers). In addition to this criterion, it is necessary to take into account a lot of other constraints, which are common in a real traffic. For example, one of the basic requirements is not to exceed the service vehicle capacity. Moreover, another requirement may be creating a defined number of subsets, in which service requirements can consequently be realized. The presented text deals with the application of the p-median approach for a basic decomposition of a set of vertices to partial subsets, where service vehicle routes are identified by using of a suitable algorithm (an exact algorithm for small tasks, a heuristic algorithm for large tasks). The computational experiments presented in this paper were implemented during the optimal route planning for service vehicles, which ensure the municipal waste collection of a particular commercial company.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    20104 - Transport engineering

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2018

  • 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 2018 : 36th international conference : September 12-14, 2018, Jindřichův Hradec

  • ISBN

    978-80-7378-371-6

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    6

  • Pages from-to

    252-257

  • Publisher name

    MATFYZPRESS

  • Place of publication

    Praha

  • Event location

    Jindřichův Hradec

  • Event date

    Sep 12, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article