| 寻找车辆最优路径的混合算法 |
| |
| 引用本文： | 杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法[J].交通运输工程学报,2005,5(1):102-105. |
| |
| 作者姓名： | 杨瑞臣 周永付 云庆夏 |
| |
| 作者单位： | 西安建筑科技大学,管理学院,陕西,西安,710055;西安建筑科技大学,管理学院,陕西,西安,710055;西安建筑科技大学,管理学院,陕西,西安,710055 |
| |
| 基金项目： | 陕西省自然科学基金项目(2001J06) |
| |
| 摘 要： | 从可见度、信息浓度更新、参数对蚁群算法加以改进，可见度计算利用节约值及距离，使用较优的数个解完成信息浓度的更新，根据迭代次数的改变灵活设置的影响系数，然后引入交换法完成局部搜索，得到混合算法。用此法对物流配送车辆路径问题进行求解，寻找最优路径。该方法得到车辆数为5veh，配送路径总长为855．68km，优于遗传算法的求解结果，表明该方法可行。
|
| 关 键 词： | 物流工程 车辆路径 蚁群算法 混合算法 |
| 文章编号： | 1671-1637(2005)01-0102-04 |
| 修稿时间： | 2004年4月12日 |
Hybrid algorithm of vehicle's optimal route |
| |
| YANG Rui-chen,ZHOU Yong-fu,YUN Qing-xia.Hybrid algorithm of vehicle's optimal route[J].Journal of Traffic and Transportation Engineering,2005,5(1):102-105. |
| |
| Authors: | YANG Rui-chen ZHOU Yong-fu YUN Qing-xia |
| |
| Abstract: | Ant-colony-system was improved in three aspects, such as visibility, trail update and parameters calculation. Its visibility was calculated according to the saving value and distance, its trail update was connected with several best solutions, its parameters was determined according to the generation. Hybrid algorithm was founded after adding 2-option(2-opt) to finish local search. The algorithm was applied to solve vehicle routing problem, so as to find the best path. Taking 5 vehicles model as an example, its total route is 855.68 km after calculation with the algorithm, its accuracy is better than one of genetic algorithm. 2 tabs, 3 figs, 8 refs. |
| |
| Keywords: | logistics engineering vehicle routing ant-colony-algorithm hybrid algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
