Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41110%2F10%3A47920" target="_blank" >RIV/60460709:41110/10:47920 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem

Popis výsledku v původním jazyce

The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city. Costs are given for the straight routes between eachpair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [7]. This problem is NP-hard. There are many various possibilities how to design heuris-tics (approximation methods) to solve it. One of the ways how to obtain heuristics for the TLVRP is to modify the famous savings method by Clark and Wright for this purpose. In this paper several different versions of thismethod are suggested, tested on some instances, and the results of single versions are evaluated and mutually compared.

Název v anglickém jazyce

Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem

Popis výsledku anglicky

The time limited vehicle routing problem (TLVRP) stems from the vehicle routing problem. The main difference is that the routes are paths (not cycles), i.e. vehicles do not return to the central city. Costs are given for the straight routes between eachpair of the cities and represent the time necessary for going through. Each path must not exceed a given time limit. The sum of time for all routes is to be minimized. For the exact definition see [7]. This problem is NP-hard. There are many various possibilities how to design heuris-tics (approximation methods) to solve it. One of the ways how to obtain heuristics for the TLVRP is to modify the famous savings method by Clark and Wright for this purpose. In this paper several different versions of thismethod are suggested, tested on some instances, and the results of single versions are evaluated and mutually compared.

Druh

D - Stať ve sborníku

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

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

MME 2010

ISBN

978-80-7394-218-2

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

381-385

Název nakladatele

University of South Bohemia České Budějovice

Místo vydání

České Budějovice

Místo konání akce

České Budějovice

Datum konání akce

8. 9. 2010

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

WRD - Celosvětová akce

Kód UT WoS článku

—