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

Wassan, Niaz A., Wassan, A. Hameed, Nagy, Gábor (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. (doi:10.1007/s10878-007-9090-4) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:9983)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (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
DOI/Identification number:	10.1007/s10878-007-9090-4
Uncontrolled keywords:	Vehicle routing - Pickups and deliveries - Heuristic - - Reactive tabu search
Subjects:	Q Science > Operations Research - Theory
Divisions:	Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User:	Gabor Nagy
Date Deposited:	22 Jul 2008 14:04 UTC
Last Modified:	06 Oct 2021 14:17 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/9983 (The current URI for this page, for reference purposes)
Wassan, Niaz A.:	https://orcid.org/0000-0003-0153-7646
Nagy, Gábor:	https://orcid.org/0000-0002-7609-5718

Depositors only (login required):

Altmetric