A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

The vehicle routing problem with pickups and deliveries (VRPPD) extends the vehicle routing problem (VRP) by allowing customers to both send and receive goods. The main difficulty of the problem is that the load of vehicles is fluctuating rather than decreasing as in the VRP. We design a reactive ta...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial optimization Vol. 15; no. 4; pp. 368 - 386
Main Authors Wassan, Niaz A., Wassan, A. Hameed, Nagy, Gábor
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.05.2008
Springer
Subjects
Applied sciences
Combinatorics
Convex and Discrete Geometry
Exact sciences and technology
Flows in networks. Combinatorial problems
Logistics
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Theory of Computation
Pickups and deliveries
Reactive tabu search
Vehicle routing
Heuristic
Fleet
Vehicle routing problem
Routing
Combinatorial optimization
Search algorithm
Tabu search
Heuristic method
Reverse logistics
Feasibility
Metamodel
Repetition
Online AccessGet full text

Cover

More Information
Summary:The vehicle routing problem with pickups and deliveries (VRPPD) extends the vehicle routing problem (VRP) by allowing customers to both send and receive goods. The main difficulty of the problem is that the load of vehicles is fluctuating rather than decreasing as in the VRP. We design a reactive tabu search metaheuristic that can check feasibility of proposed moves quickly and reacts to repetitions to guide the search. Several new best solutions are found for benchmark problems.
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-007-9090-4