基于中国邮递员问题的城区烟草配送线路优化模型与算法
详细信息 查看官网全文
- 英文论文题名：The optimization model and algorithm of tobacco distribution routing in urban area based on the Chinese postman problem
- 论文作者：胡安源 ; 张新
- 英文论文作者：HU Anyuan ; ZHANG Xin ; Shandong University ; Tobacco Society of Shandong Province ; Shandong University of Finance and Economics
- 年：2016
- 作者机构：山东省烟草专卖局;
- 论文关键词：烟草配送 ; 中国邮递员问题 ; 欧拉环游
- 英文论文关键词：tobacco distribution ; Chinese postman problem ; Euler tour
- 会议召开时间：2016-12-01
- 会议录名称：中国烟草学会2016年度优秀论文汇编——电子商务与物流主题
- 语种：中文
- 分类号：F426.8;F252.1
- 学会代码：ZGYG
- 学会名称：中国烟草学会
- 页数：10
- 文件大小：720k
- 原文格式：D
摘要
本文利用中国邮递员问题研究城区烟草配送问题,首先分析城区烟草配送的特点,提出多人中国邮递员问题。然后给出最优匹配模型和生成城区烟草配送的欧拉图的方法,设计欧拉环游的有向回路分割算法。最后给出算例,通过计算说明算法的可行性。
The tobacco distribution routing problem in urban area is studied based on the Chinese postman problem in this paper. Firstly the characteristic of tobacco distribution in urban area is analyzed, and China postman problem with more than one people is put forward. Then the optimal matching model and generation method of the Euler graph of tobacco distribution in urban area are given. And the directed circuits partitioning algorithm of Euler tour is given. At last, an example is given, and the feasibility of the algorithm is proved through the example.
The tobacco distribution routing problem in urban area is studied based on the Chinese postman problem in this paper. Firstly the characteristic of tobacco distribution in urban area is analyzed, and China postman problem with more than one people is put forward. Then the optimal matching model and generation method of the Euler graph of tobacco distribution in urban area are given. And the directed circuits partitioning algorithm of Euler tour is given. At last, an example is given, and the feasibility of the algorithm is proved through the example.
引文
[1]Dantzig G&Ramser J.The trunk dispatching problem[J].Management,1959,6(6):80-91.
[2]刘云忠,宣惠玉.车辆路径问题的模型及算法研究综述[J],管理工程学报,2005,19(1):124-130。
[3]赵燕伟,彭典军,张景玲,吴斌.有能力约束车辆路径问题的量子进化算法[J],系统工程理论与实践,2009,29(2):159-166。
[3]丁秋雷,胡祥培,李永先.求解有时间窗的车辆路径问题的混合蚁群算法[J],系统工程理论与实践,2007,10:98-104。
[5]ZHANG Xin,Ma Jianhua,Liu Weilong,Jin Fang,Ant colony algorithm for vehicle routing problem with shortest completion time[J],The proceedings of the 13th international conference on industrial engineering and engineering management,1-5:2928-2933,2006.8。
[6]马建华,房勇,袁杰.多车场多车型最快完成车辆路径问题的变异蚁群算法,系统工程理论与实践,2011.31(8):1508-1516.
[7]莫韦嶙,谭勇,张宝华.烟草配送系统中路径优化问题,物流工程与管理,2009,31(6):86-87.
[8]王芳.烟草配送线路优化问题的探讨,中国烟草学会2009年年会论文集,2009:305-219.
[2]刘云忠,宣惠玉.车辆路径问题的模型及算法研究综述[J],管理工程学报,2005,19(1):124-130。
[3]赵燕伟,彭典军,张景玲,吴斌.有能力约束车辆路径问题的量子进化算法[J],系统工程理论与实践,2009,29(2):159-166。
[3]丁秋雷,胡祥培,李永先.求解有时间窗的车辆路径问题的混合蚁群算法[J],系统工程理论与实践,2007,10:98-104。
[5]ZHANG Xin,Ma Jianhua,Liu Weilong,Jin Fang,Ant colony algorithm for vehicle routing problem with shortest completion time[J],The proceedings of the 13th international conference on industrial engineering and engineering management,1-5:2928-2933,2006.8。
[6]马建华,房勇,袁杰.多车场多车型最快完成车辆路径问题的变异蚁群算法,系统工程理论与实践,2011.31(8):1508-1516.
[7]莫韦嶙,谭勇,张宝华.烟草配送系统中路径优化问题,物流工程与管理,2009,31(6):86-87.
[8]王芳.烟草配送线路优化问题的探讨,中国烟草学会2009年年会论文集,2009:305-219.