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

Kód výsledku v 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>

Nalezeny alternativní kódy

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

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

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 statě ve sborníku

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

Počet stran výsledku

6

Strana od-do

252-257

Název nakladatele

MATFYZPRESS

Místo vydání

Praha

Místo konání akce

Jindřichův Hradec

Datum konání akce

12. 9. 2018

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

WRD - Celosvětová akce

Kód UT WoS článku

—