By Topic

Study of the vehicle routing problem with time windows based on improved particle swarm optimization algorithm

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

1 Author(s)
Anxin Ye ; College of Information Science and Engineering; Zhejiang Normal University; Jinhua, 321004, China

To overcome that the standard particle swarm optimization algorithms can not find good solutions of solving the vehicle routing problem with tim windows, an improved particle swarm optimization algorithm for vehicle routing problem with time windows (VRPTW)was proposed. In the improved algorithm, different particles are assigned specific tasks. Better particles are given smaller inertial weights, while worse ones are given larger inertial weights. And the particle's inertial weight are adaptively adjusted according to its fitness function. These strategies improve the PSO algorithm at the aspects of diversity and the balance of exploration and exploitation. In comparison with other algorithms,the Improved Particle Swarm Optimization is proved an efficient method for VRPTW.

Published in:

Computer Science and Service System (CSSS), 2011 International Conference on

Date of Conference:

27-29 June 2011