By Topic

Application in Vehicle Routing Problem of hybrid discrete particle swarm 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
$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)
Huali Wu ; Dept. of Control Eng., Naval Aeronaut. & Astronaut. Univ., Yantai, China ; Jinhua Wu ; Jianhong Shi

Vehicle Routing Problem is the NP problem, and only can it get precise optimum when the problem is simple,so the intelligent elicitation algorithm becomes an important studied fleld.This paper adopts PSO to optimize VRP.The local search capacity of PSO is relatively weak,so this paper combines PSO with simulated annealing and designs the PSO based on SA using the characteristics that SA can accept some ungraded solution under the control of certain probability.Finally the algorithm is applied to the VRP,and the simulation results show that the PSO based on SA can get better optimization effect than SA or PSO single used,which validates the effectiveness of the method.

Published in:

Mechanic Automation and Control Engineering (MACE), 2011 Second International Conference on

Date of Conference:

15-17 July 2011