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

Niaz A. Wassan, A. Hameed Wassan and Gábor Nagy ()
Additional contact information
Niaz A. Wassan: The University of Kent
A. Hameed Wassan: The University of Kent
Gábor Nagy: The University of Kent

Journal of Combinatorial Optimization, 2008, vol. 15, issue 4, No 5, 368-386

Abstract: Abstract 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.

Keywords: Vehicle routing; Pickups and deliveries; Heuristic; Reactive tabu search (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9090-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:15:y:2008:i:4:d:10.1007_s10878-007-9090-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9090-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().