DocumentCode
2225135
Title
Using Predicting Particle Swarm Optimization to solve the vehicle routing problem with time windows
Author
Lin, Chun-Ta
Author_Institution
Dept. of Inf. Manage., Yu-Da Coll. of Bus., Miao-Li, Taiwan
fYear
2008
fDate
8-11 Dec. 2008
Firstpage
810
Lastpage
814
Abstract
In this paper, the predicting particle swarm optimization (predicting PSO) algorithm based on original PSO which modified by three new solution strategies has been proposed to solve the well known VRPTW problems. Predicting PSO algorithm not only can modify the variance between current status and memorial best status, but also can forward predict what the best status should be at next time status based on memory. The predicting PSO algorithm has also been tested on Solomon¿s benchmark problems. The findings indicate that the proposed algorithm outperforms other heuristic algorithms.
Keywords
particle swarm optimisation; prediction theory; transportation; vehicles; Solomon¿s benchmark problems; predicting particle swarm optimization algorithm; time windows; vehicle routing problem; Benchmark testing; Costs; Educational institutions; Equations; Heuristic algorithms; Information management; Particle swarm optimization; Prediction algorithms; Routing; Vehicles; Particle Swarm Optimization (PSO); Predicting Particle Swarm Optimization; Vehicle Routing Problem with TimeWindows (VRPTW);
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Engineering and Engineering Management, 2008. IEEM 2008. IEEE International Conference on
Conference_Location
Singapore
Print_ISBN
978-1-4244-2629-4
Electronic_ISBN
978-1-4244-2630-0
Type
conf
DOI
10.1109/IEEM.2008.4737982
Filename
4737982
Link To Document