Paper Info
Title
An incremental tabu search heuristic for the generalized vehicle routing problem with time windows.
Abstract
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
Year
DOI
Venue
2012
10.1057/jors.2011.25
JORS
Keywords
Field
DocType
management science,information systems,tabu search,forecasting,operations research,production,operational research,logistics,location,project management,inventory,computer science,scheduling,reliability,information technology,communications technology,marketing,investment
Information system,Incremental heuristic search,Vehicle routing problem,Exponential function,Computer science,Scheduling (computing),Neighbourhood (mathematics),Tabu search,Operations management,Project management
Journal
Volume
Issue
ISSN
63
2
0160-5682
Citations 
PageRank 
References 
18
0.81
14
Authors
3
Name
Order
Citations
PageRank
Luigi Moccia119211.25
Jean-François Cordeau22604127.77
Gilbert Laporte38666612.13