|
Title
|
|
|
|
Comparing descent heuristics and metaheuristics for the vehicle routing problem
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Three improvement heuristics for the vehicle routing problem are considered: a descent heuristic and two metaheuristics Simulated Annealing and Tabu Search. In order to make an in-depth comparison of the performance of these improvement heuristics, their behavior is analysed on a heuristic, time-sensitive level as well as on a parametric level. The design and the results of the experiments are outlined. The external validity of the conclusions is discussed. |
| |
|
Language
|
|
|
|
English
| |
|
Source (series)
|
|
|
|
Research paper / UFSIA, Faculty of Applied Economics ; 2000:002
| |
|
Publication
|
|
|
|
Antwerpen
:
2000
| |
|
Volume/pages
|
|
|
|
28 p.
| |
|
Full text (open access)
|
|
|
|
| |
|