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

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

0.00 Avg rating0 Votes
Article ID: iaor20083826
Country: United Kingdom
Volume: 58
Issue: 12
Start Page Number: 1630
End Page Number: 1641
Publication Date: Dec 2007
Journal: Journal of the Operational Research Society
Authors:
Keywords: heuristics: tabu search
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.

Reviews

Required fields are marked *. Your email address will not be published.