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

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Different Versions of the Savings Method for the Time Limited Vehicle Routing Problem
Original language description
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.
Czech name
—
Czech description
—

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

Similar results(10)