-
摘要: 从可见度、信息浓度更新、参数对蚁群算法加以改进, 可见度计算利用节约值及距离, 使用较优的数个解完成信息浓度的更新, 根据迭代次数的改变灵活设置的影响系数, 然后引入交换法完成局部搜索, 得到混合算法。用此法对物流配送车辆路径问题进行求解, 寻找最优路径。该方法得到车辆数为5 veh, 配送路径总长为855.68 km, 优于遗传算法的求解结果, 表明该方法可行。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.
-
Key words:
- logistics engineering /
- vehicle routing /
- ant-colony-algorithm /
- hybrid algorithm
-
表 1 已知数据
Table 1. Given data
仓库编号 总仓库 1 2 3 4 5 6 坐标值 (52, 4) (15, 49) (0, 61) (51, 15) (25, 71) (38, 62) (35, 45) 需求量 0 1.64 1.31 0.43 3.38 1.13 3.77 仓库编号 7 8 9 10 11 12 13 坐标值 (100, 41) (10, 52) (26, 79) (87, 7) (24, 89) (19, 25) (20, 99) 需求量 3.48 0.39 0.24 1.03 2.35 2.60 1.00 仓库编号 14 15 16 17 18 19 20 坐标值 (73, 91) (100, 95) (7, 73) (69, 86) (24, 3) (66, 14) (9, 30) 需求量 0.65 0.58 2.56 1.27 2.69 3.26 2.97 
下载: 导出CSV
表 2 混合算法计算结果
Table 2. Computation results of hybrid algorithm
计算次序 1 2 3 4 5 6 使用车辆数/veh 5 6 5 5 5 5 配送路径总长/km 856.07 879.84 865.45 863.92 856.20 864.43 计算次序 7 8 9 10 平均值 使用车辆数/veh 5 5 5 6 5.2 配送路径总长/km 863.92 858.10 855.68 870.83 863.44
下载: 导出CSV
-
[1] 黄中鼎. 现代物流管理学[M]. 上海: 上海财经大学出版社, 2004. [2] 常云涛, 彭国雄. 基于遗传算法的城市干道协调控制[J]. 交通运输工程学报, 2003, 3(2): 106-112. http://transport.chd.edu.cn/article/id/200302018CHANG Yun-tao, PENG Guo-xiong. Urban arterial road coordinate control based on genetic algorithm[J]. Journal of Traffic and Transportation Engineering, 2003, 3(2): 106-112. (in Chinese) http://transport.chd.edu.cn/article/id/200302018 [3] 郎茂祥. 基于遗传算法的物流配送路径优化问题研究[J]. 中国公路学报, 2002, 15(3): 76-79. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200203017.htmLANG Mao-xiang. Study of the optimizing of physical distribution routing problem based on genetic algorithm[J]. China Journal of Highway and Transport, 2002, 15(3): 76-79. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGL200203017.htm [4] 林勇, 蔡远利, 黄永宣. 高速公路动态OD矩阵估计[J]. 长安大学学报(自然科学版), 2003, 23(6): 83-86. https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200306021.htmLIN Yong, CAI Yuan-li, HUANG Yong-xuan. Dynamic origindestination matrix estimation for freeways[J]. Journal of Chang'an University(Natural Science Edition), 2003, 23(6): 83-86. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-XAGL200306021.htm [5] 伍文城, 肖建. 基于蚁群算法的中国旅行商问题满意解[J]. 计算机与现代化, 2002, 8(8): 6-11. https://www.cnki.com.cn/Article/CJFDTOTAL-JYXH200208001.htmWU Wen-cheng, XIAO Jian. Satisfactory solution of Chinese traveling salesman problem based on ant colony algorithm[J]. Computer and Modernization, 2002, 8(8): 6-11. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-JYXH200208001.htm [6] 郎茂祥, 胡思继. 用混合遗传算法求解物流配送路径优化问题的研究[J]. 中国管理科学, 2002, 10(10): 51-56. https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGK200205010.htmLANG Mao-xiang, HU Si-ji. Study on the optimization of physical distribution routing problem by using hybrid genetic algorithm[J]. Chinese Journal of Management Science, 2002, 10(10): 51-56. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-ZGGK200205010.htm [7] 唐坤. 车辆路径问题中的遗传算法设计[J]. 东华大学学报(自然科学版), 2002, 28(2): 66-70. https://www.cnki.com.cn/Article/CJFDTOTAL-DHDZ200201014.htmTANG Kun. Genetic algorithm design and application on vehicle routing problem[J]. Journal of Donghua University(Natural Science Edition), 2002, 28(2): 66-70. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DHDZ200201014.htm [8] 云庆夏, 黄光球, 王战权. 遗传算法和遗传规划[M]. 北京: 冶金工业出版社, 1997. -
点击查看大图
图(3) / 表(2)
计量
- 文章访问数: 390
- HTML全文浏览量: 138
- PDF下载量: 542
- 被引次数: 0
