Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A unified tabu search heuristic for vehicle routing problems with time windows

A unified tabu search heuristic for vehicle routing problems with time windows AbstractThis paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the Operational Research Society Taylor & Francis

A unified tabu search heuristic for vehicle routing problems with time windows

A unified tabu search heuristic for vehicle routing problems with time windows

Journal of the Operational Research Society , Volume 52 (8): 9 – Aug 1, 2001

Abstract

AbstractThis paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.

Loading next page...
 
/lp/taylor-francis/a-unified-tabu-search-heuristic-for-vehicle-routing-problems-with-time-n0OStRpCT1

References (31)

Publisher
Taylor & Francis
Copyright
Copyright © 2001, Palgrave Publishers Ltd
ISSN
1476-9360
eISSN
0160-5682
DOI
10.1057/palgrave.jors.2601163
Publisher site
See Article on Publisher Site

Abstract

AbstractThis paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.

Journal

Journal of the Operational Research SocietyTaylor & Francis

Published: Aug 1, 2001

Keywords: vehicle routing problem; periodic vehicle routing problem; multi-depot vehicle routing problem; time windows; tabu search

There are no references for this article.