| Article ID: | iaor20091075 |
| Country: | Netherlands |
| Volume: | 15 |
| Issue: | 4 |
| Start Page Number: | 368 |
| End Page Number: | 386 |
| Publication Date: | May 2008 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Wassan Niaz A., Nagyand Gbor, Wassan A. Hameed |
| Keywords: | heuristics: tabu search |
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.