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

Wassan, N.A. and Wassan, A.H. and Nagy, G. (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization, 15 (4). pp. 368-386. ISSN 1382-6905. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/s10878-007-9090-4

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.

Item Type: Article
Uncontrolled keywords: Vehicle routing - Pickups and deliveries - Heuristic - - Reactive tabu search
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Gabor Nagy
Date Deposited: 22 Jul 2008 14:04
Last Modified: 21 May 2011 23:51
Resource URI: http://kar.kent.ac.uk/id/eprint/9983 (The current URI for this page, for reference purposes)
  • Depositors only (login required):