By Topic

Application of the improved particle swarm optimizer to vehicle routing and scheduling problems

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

2 Author(s)
Zhang Zhixia ; Univ. of Archit. & Technol., Xi''an ; Lu Caiwu

Particle Swarm Optimizer (PSO) has several shortages when it is used for searching the best route of combinatorial optimization problems including vehicle routing and scheduling problems (VRSP), such as the premature convergence and easily limited to local optimal solution. The article proposed an improved PSO to overcome these shortcomings and improve its performance. The proposed algorithm integrates niche technology with the algorithm of PSO, and uses dynamic inertia weight to enhance its searching ability. In each iteration of the PSO, inertia weight is calculated to improve the searching ability at first, and then the local best positions are determined by niche technology, at last by demonstrating the power of this approach on a test case, the results derived from GA, ACO, PSO and the improved PSO are compared and analyzed in the experiment. It proved that the improved PSO is effective. The improved PSO has its significance to the general resource scheduling and can play a role in practice.

Published in:

Grey Systems and Intelligent Services, 2007. GSIS 2007. IEEE International Conference on

Date of Conference:

18-20 Nov. 2007