A Hybrid Ant Colony Algorithm for the Capacitated Location-Routing Problem
The capacitated location-routing problem(CLRP)belongs to the field of logistics of transportation.TheCLRP appears as a combination of two difficultproblems: the facility location problem(FLP)and thevehicle routing problem(VRP).lt is an NP-hardproblem.In order to solve practical large scalecapacitated LRP,We propose a hybrid ant colonyalgorithm to solve the CLRP.To compare theproposed algorithm with other heuristic algorithms,aseries of computational experiments are done onrandomly generated test problems.The simulationresults demonstrate that the hybrid ant colonyalgorithm is feasible and efficient.
Jitao Yan Qiuwen Zhang Wenshuai Zhang Tong Zhen
Pingdingshan Institute of Technology,Pingdingshan 467001,China College of Information Science and Engineering,Henan University of Technology,Zhengzhou 450001,China Henan Vocational College of Agriculture,Zhongmu 451450,China
国际会议
厦门
英文
38-43
2008-11-17(万方平台首次上网日期,不代表论文的发表时间)