Applied Research of Improved Hybrid Genetic Algorithm in Multiple Constraints Location-Routing Problem
The location routing problem (LRP),which simultaneously tackles both facility location and the vehicle routing decisions to minimize the total system cost,is of great importance in designing an integrated logistic distribution network.In this paper a simulated annealing algorithm (SA) based hybrid genetic algorithm was developed to solve the LRP with capacity constraints (CLRP) on depots and routes.The proposed hybrid genetic algorithm modified the population generation method,genetic operators and recombination strategy and realized the combination of the local searching ability of SA and global searching ability of GA.To evaluate the performance of the proposed approach,we conducted an experimental study and compared its results with other heuristics on a set of well-known Barreto Benchmark instances.The experimental results verified the feasibility and effectiveness of our approach.
Location-Routing Problem Integrated Logistic Distribution Network Genetic Algorithm Simulated Annealing Algorithm
Jiang Yan-fen Feng Chun-ling
Department of Computer technology, HeBei College of Industry and Technology,Shijiazhuang,Hebei,05009 Department of Political and public sports, HeBei College of Industry and Technology,Shijiazhuang,Heb
国际会议
三亚
英文
1534-1537
2013-06-22（万方平台首次上网日期，不代表论文的发表时间）