Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls

Wassan, Niaz A. (2007) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. Journal of the Operational Research Society, 58 (12). pp. 1630-1641. ISSN 0160-5682. (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.1057/palgrave.jors.2602313

Abstract

A heuristic approach based on a hybrid operation of reactive tabu search (RTS) and adaptive memory programming ( AMP) is proposed to solve the vehicle routing problem with backhauls (VRPB). The RTS is used with an escape mechanism which manipulates different neighbourhood schemes in a sophisticated way in order to get a continuously balanced intensification and diversification during the search process. The adaptive memory strategy takes the search back to the unexplored regions of the search space by maintaining a set of elite solutions and using them strategically with the RTS. The AMP feature brings an extra robustness to the search process that resulted in early convergence when tested on most of the VRPB instances. We compare our algorithm against the best methods in the literature and report new best solutions for several benchmark problems.

Item Type: Article
Uncontrolled keywords: vehicle routing with backhauls; neighbourhood search; tabu search; adaptive memory programming
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Suzanne Duffy
Date Deposited: 28 Apr 2008 09:07
Last Modified: 04 Jun 2014 13:48
Resource URI: http://kar.kent.ac.uk/id/eprint/2937 (The current URI for this page, for reference purposes)
ORCiD (Wassan, Niaz A.):
  • Depositors only (login required):