Paper Info
Title
Tabu search variants for the mix fleet vehicle routing problem
Abstract
The Mix Fleet Vehicle Routing Problem (MFVRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of heterogeneous vehicles with various capacities, fixed costs and variable costs to service a set of customers with known demands. This paper develops new variants of a tabu search meta-heuristic for the MFVRP. These variants use a mix of different components, including reactive tabu search concepts; variable neighbourhoods, special data memory structures and hashing functions. The reactive concept is used in a new way to trigger the switch between simple moves for intensification and more complex ones for diversification of the search strategies. The special data structures are newly introduced to efficiently search the various neighbourhood spaces. The combination of data structures and strategic balance between intensification and diversification generates an efficient and robust implementation, which is very competitive with other algorithms in the literature on a set of benchmark instances for which some new best-known solutions are provided.
Year
DOI
Venue
2002
10.1057/palgrave.jors.2601344
Journal of The Operational Research Society
Keywords
DocType
Volume
reliability,communications technology,information systems,location,inventory,computer science,operational research,logistics,production,scheduling,marketing,operations research,information technology,vehicle routing problem,management science,forecasting,investment,tabu search,project management
Journal
53
Issue
ISSN
Citations 
7
0160-5682
38
PageRank 
References 
Authors
1.97
13
2
Name
Order
Citations
PageRank
N A Wassan1502.94
Ibrahim H. Osman281594.23