Improved VRP Based on Particle Swarm Optimization Algorithm
The Improved Vehicle Routing Problem (IVRP) and Location Allocation Problems (LAP) were considered synthetically.And a mathematic model about IVRP has been built up. The purpose of this model was to minimize the total cost by determining the location of the warehouse, allocating appropriate number of vehicles for the selected warehouse and finding the optimal routing for each vehicle. At the same time, Improved Particle Swarm Optimization Algorithm with Genetic Algorithm and Simulated Annealing were applied to solve an example of the model. The good convergence state of the global best solution has proved the IVRP model was correct and the algorithm applied to solve IVRP was effective.
IVRP Logistics model Particle Swarm Optimization Algorithm Genetic Algorithm Simulated Annealing
Zixia Chen Youshi Xuan
Center for Research in Modern Business Zhejiang Gongshang University Hangzhou, Zhejiang,310035, Chin College of Computer and Information Engineering, Zhejiang Gongshang University Hangzhou, Zhejiang,31
国际会议
杭州
英文
436-439
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）