A Hybrid Intelligent Algorithm for Grain Logistics Vehicle Routing Problem
Grain logistics vehicle routing problem is derived from vehicle routing problem, they have been a focus of research in the grain logistics managements recently, which the aim is to use the limited vehicles to a large number of jobs so that the maximum number of jobs can be completed with minimum cost. Aiming at the characteristics of the large batch and multi-point to multipoint transportation of grain logistics, a hybrid particle swarm optimization (PSO) with simulated annealing (SA) algorithm is proposed to solve grain logistics vehicle routing problem (VRP) in this paper. The experimental results manifest that the hybrid algorithm of PSO can solve grain logistics VRPTM quickly, the proposed algorithm is effective, and can reduce the cost of distribution.
grain Logistics simulating annealing hybrid particle swarm optimization Vehicle Routing Problem
Jian jun wu Tong Zhen Hongyi Ge
College of Information Science and Engineering Henan University of Technology Zhengzhou,China
国际会议
上海
英文
1587-1590
2009-11-20（万方平台首次上网日期，不代表论文的发表时间）