Solving the Large-Scale Vehicle Routing Problem by Location Based Heuristic & Genetic Algorithm
The paper considers more than 10440 cigarettes shopkeepers of some logistics enterprise,and minimizes the total transit expenses.The large-scale vehicle routing problem(VRP)partitions to two sub-problems,one is generalized assignment problem and the other is vehicle routing problem intra-region after partitioning.The first problem is solved by the improved location-based heuristics (ILBH),and the hybrid genetic algorithm is presented for solving the second problem.The presented improved two-phase algorithm can obtain a good result effectively for solving the large-scale distribution transition problem in allowable time.The simulation results show that the algorithm is both effective and applicable,and it may extend to other cases.
heuristics the large scale vehicle routing problem the logistics distribution hybrid genetic algorithm
Cao Er-bao Lai Ming-yong
School of Management,Hunan University,P.R.China,410082;Hunan Provincial Laboratory of logistics Information and Simulation Technology,P.R.China,410079
国际会议
2006 Interntional Conferecne on Management of Logistics and Supply Chain(2006物流与供应链管理国际研讨会)
长沙
英文
406-410
2006-09-20（万方平台首次上网日期，不代表论文的发表时间）