4.5 Article

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
Volume 63, Issue 2, Pages 232-244

Publisher

PALGRAVE MACMILLAN LTD
DOI: 10.1057/jors.2011.25

Keywords

generalized vehicle routing problem; time windows; tabu search; large neighbourhood search

Funding

  1. MSE (Italy)
  2. Natural Sciences and Engineering Council of Canada [227837-09, 39682-10]

Ask authors/readers for more resources

This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can be successfully applied to a wide variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood is exponential in size, but the proposed evaluation procedure has polynomial complexity. Computational results are presented and demonstrate the effectiveness of the approach. Journal of the Operational Research Society (2012) 63, 232-244. doi: 10.1057/jors.2011.25 Published online 4 May 2011

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available