A savings based method for real-life vehicle routing problems
1999-10-13
Research Paper
This publication is part of collection
| Related Files |
|---|
|
Download File
(feweco19991013123552.ps, 0.7MB) |
View PDF Version
(feweco19991013123552.pdf, 0.2MB) |
|
View PDF Version
(1_feweco19991013123552.pdf, 0.2MB) |
This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the "visual attractiveness" of the plan. Computational results show that, in general, the Savings Based algorithm not only performs better with respect to these non-standard quality measures, but also with respect to the traditional measures.
Keywords
Automatically Extracted Terms
- vehicle
- customer
- algorithm
- number
- saving
- measure
- region
- constraint
- imp sb
- region number
- imp data
- company
- sequential insertion algorithm
- result
- quality
- quality measures
- insertion
- distance
- problem
- non-standard quality measures
