By Topic

A new Tabu Search heuristic algorithm for the Vehicle Routing Problem with Time Windows

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ming-yao Qi ; Graduate School at Shenzhen, Tsinghua University, China, 518055 ; Li-xin Miao ; Le Zhang ; Hua-yu Xu

This paper describes a new design of Tabu search (ts) algorithm for solving the vehicle routing problem with time windows (VRPTW). Since VRPTW is a well known NP-hard problem, heuristic algorithms such as Tabu search are always used to get a good approach. The former published designs of TS usually focus on the neighbor structure, the relaxation to the objective function or the multi-period algorithms. This paper has two contributions. First, it designs an objective value-based Tabu List structure to help decreasing the Tabu list size and escape from local optima. it still adopts some tactics like adaptive Tabu size, randomly selected neighbor structure and so on. Second, from a problem oriented point of view, it shows that, with this self-adaptive Tabu list, even five kinds of simple neighbor structures and a single period algorithm with original objective function can get very good solutions. We tested this algorithm with Solomonpsilas VRPTW benchmark problems, and 7 of the best known solutions are updated. Another advantage of this algorithm is its efficiency. It runs on an average of 80 seconds on a normal personal computer for a solution of a problem with 100 customers.

Published in:

2008 International Conference on Management Science and Engineering 15th Annual Conference Proceedings

Date of Conference:

10-12 Sept. 2008