寻找车辆最优路径的混合算法-交通运输工程学报-长安大学.PDFVIP

第5 卷　第1 期 交 通 运 输 工 程 学 报 Vol.5　No.1 2005 年3 月 Journal of T raffic and Transportation Engineering Mar. 2005 :1671-1637(2005)0-1 010-2 04 杨瑞臣,周永付,云庆夏 ( , 　710055) 　:从可见度、信息浓度更新、 数对蚁群算法加以改进,可见度计算利用节约值及距离,使用 较优的数 个解完成信息浓度的更新,根据迭代次数的改变灵活设置的影响系数,然后引入交换法完 成局部搜索,得到混合算法。用此法对物流配送车辆路径问题进行求解,寻找最优路径。该方法得 到车辆数为5 veh,配送路径总长为 55.6 km,优于遗传算法的求解结果,表明该方法可行。 :物流工程;车辆路径;蚁群算法;混合算法 :U491　　　:A Hybrid algorithm of vehicle s optimal route YANG Ru-i chen, ZHOU Yong-fu, YUN Qing-xia (School of Management, Xian University of Architecture and Technology, Xian 710055, China) Abstract:An-t colony-system w as improved in three aspects, such as visibility, trail update and parameters calculation. Its visibility w as calculated according to the saving value and distance, its trail update w as connected w ith several best solutions, its parameters w as determined according to the generation. Hybrid algorithm w as founded after adding 2-option(2-opt)to finish local search. The algorithm w as applied to solve vehicle routing problem, so as to find the best path. Taking 5 vehicles model as an example, its total route is 55.6 km after calculation w ith the algorithm, its accuracy is better than one of genetic algorithm . 2 tabs, 3 figs, refs. Key words:logistics engineering ;vehicle routing;an-t colony-algorithm;hybrid algorithm Author resume:YANG Ru-i chen (197-), male, graduate student, 6-25-2203 69, yangru- ichen @tom. com . 、、 0　　 [2 ～4] , 。 , , , “ ,2-opt , ”。, 50%, 。 [1] ,, 1　VRP 。, , V RP 。NP-HARD