A Reactive Tabu Search for the Vehicle Routing Problem

Wassan, Niaz A. (2006) A Reactive Tabu Search for the Vehicle Routing Problem. Journal of the Operational Research Society, 57 (1). pp. 111-116. ISSN 0160-5682. (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)

The full text of this publication is not available from this repository. (Contact us about this Publication)


The classical vehicle routing problem (VRP) involves determining affect of homogeneous size vehicles and designing an associated set of routes that minimizes the total cost. Our tabu search (TS) algorithm to solve the VRP is based on reactive tabu search (RTS) with a new escape mechanism, which manipulates different neighbourhood schemes in a very sophisticated way in order to get a balanced intensification and diversification continuously during the search process. We compare our algorithm with the best methods in the literature using different data sets and report results including new best known solutions for several well-known benchmark problems.

Item Type: Article
Uncontrolled keywords: vehicle routing meta-heuristic; tabu search
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Niaz Ahmed Wassan
Date Deposited: 11 Sep 2008 10:54
Last Modified: 04 Jun 2014 13:48
Resource URI: https://kar.kent.ac.uk/id/eprint/10012 (The current URI for this page, for reference purposes)
  • Depositors only (login required):