DocumentCode :
3299926
Title :
Research on Particle Swarm Optimization for Grain Logistics Vehicle Routing Problem
Author :
Zhen, Tong ; Ge, Hongyi ; Che, Yi ; Jiang, Yuying
Author_Institution :
Coll. of Inf., Henan Univ. of Technol., Zhengzhou, China
fYear :
2009
fDate :
11-12 July 2009
Firstpage :
274
Lastpage :
277
Abstract :
Grain logistics vehicle routing problem is a kind of combination NP-hard problem. According to the large batch and multi-point to multi-point transportation of grain logistics, this paper considers vehicle routing problem with time windows and its intelligent algorithm. An algorithm of PSO for VRPTW is proposed in this work, experiments are made to compare the algorithm with GA on solving this problem. The experimental results indicate that algorithm of PSO will be an effective and feasible approach for grain logistics VRPTM, and reduce distribution cost.
Keywords :
computational complexity; genetic algorithms; logistics; particle swarm optimisation; vehicles; GA; combination NP-hard problem; grain logistics vehicle routing problem; particle swarm optimization; Agriculture; Costs; Domestic safety; Educational institutions; Logistics; Mathematical model; Particle swarm optimization; Routing; Transportation; Vehicles; Grain Logistics; Optmation; Particle Swarm Optimation; time windows; vehicle routing problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Services Science, Management and Engineering, 2009. SSME '09. IITA International Conference on
Conference_Location :
Zhangjiajie
Print_ISBN :
978-0-7695-3729-0
Type :
conf
DOI :
10.1109/SSME.2009.46
Filename :
5233296
Link To Document :
بازگشت