By Topic

ACO-VRPTWRV: A New Algorithm for the Vehicle Routing Problems with Time Windows and Re-used Vehicles based on Ant Colony Optimization

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)
Tao Zhang ; Sch. of Inf. Manage. & Eng., Shanghai Univ. of Finance & Econ. ; Shanshan Wang ; Wenxin Tian ; Yuejie Zhang

A model with multiple objectives to minimize the number and the total delivery time of vehicles for vehicle routing problems with time windows and reused vehicles is proposed. ACO-VRPTWRV algorithm based on ant colony optimization is presented. Heuristic function and state transition rule of ants are designed according to the rule to serve customers with earlier service beginning time, shorter service time and earlier ending time of time windows firstly based on ant colony system. Pheromone trail updating strategy is designed through the combination of max-min and rank-based ant system, making better use of the best solutions while avoiding stagnating in local optimization. A good initial solution is generated in the light of giving customers with earlier service ending time priority. Numerical results show ACO-VRPTWRV is able to produce good solutions quickly, decreasing the number and total delivery time of vehicles. So the model and algorithm is efficient

Published in:

Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on  (Volume:1 )

Date of Conference:

16-18 Oct. 2006