An incremental tabu search heuristic for the generalized vehicle routing problem with time windows
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.
Year of publication: |
2012
|
---|---|
Authors: | Moccia, L ; Cordeau, J-F ; Laporte, G |
Published in: |
Journal of the Operational Research Society. - Palgrave Macmillan, ISSN 0160-5682. - Vol. 63.2012, 2, p. 232-244
|
Publisher: |
Palgrave Macmillan |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows
Moccia, L, (2012)
-
Automatic aircraft cargo load planning
Limbourg, S, (2012)
-
Data envelopment analysis, operational research and uncertainty
Laporte, G, (2010)
- More ...