By Topic

An effective parallel improving tabu search algorithm for Heterogeneous Fixed Fleet Vehicle Routing Problem

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
$31 $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

3 Author(s)
Kewei Zheng ; Dept. of Ind. Eng., Shanghai Jiaotong Univ., Shanghai, China ; Zhiqiang Lu ; Xiaoming Sun

One of the special variants of VRP model, the Heterogeneous Fixed Fleet Vehicle Routing Problem (HFFVRP) is discussed in this paper. The objective is to minimize the total delivery cost, including vehicle fixed cost and traveling variable cost. An effective parallel improving tabu search algorithm is developed to solve the model. Multiple neighborhood searching strategy and parallel improving technique are used to efficiently take advantage of the searching iterations. A waste function is introduced to evaluate the solution instead of directly calculating the total cost function. This change helps improve the convergent speed of the random searching process. Numerical experiments based on the typical CVRP and VFM instances are discussed, and the results show a satisfied performance in term of both quality and computational time.

Published in:

Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on  (Volume:1 )

Date of Conference:

26-28 Feb. 2010