基于Dijkstra算法的校园外卖配送方案
Campus Delivery Scheme Based on Dijkstra Algorithm
DOI: 10.12677/ECL.2018.73006, PDF,  被引量   
作者: 杜家康*, 陈昊东, 任庆军, 孙洪春:临沂大学数学与统计学院,山东 临沂;张博瀚:济南大学信息科学与工程学院,山东 济南
关键词: 校园外卖最短路问题Dijkstra算法Campus Takeout The Shortest Circuit Problem Dijkstra Algorithm
摘要: 近几年,随着科技的发展以及人们的生活水平提高,外卖这个新兴行业正在蓬勃发展,其中发展最快的莫过于是校园外卖。本文通过对校园外卖最短路线问题的优化求解,将校园内的外卖配送问题等效转化为最短路线问题,并运用Dijkstra算法求得校园外卖的最佳配送方案,编制了MATLAB程序,确定了校园外卖派送的最短路线。最后,通过实验算例验证了本文算法的有效性和可行性。
Abstract: In recent years, with the development of science and technology and the improvement of people’s living standards, the emerging industry of take-out is developing rapidly, among which the fastest development is campus take-out. In this paper, by solving the problem of the shortest route of campus take-out, the problem of the delivery of campus take-out is equivalent to the shortest route problem. Dijkstra algorithm was used to obtain the best delivery scheme of campus take-out, and MATLAB program was compiled to determine the shortest route of campus take-out delivery. Finally, the validity and feasibility of the proposed algorithm are verified by an experimental example.
文章引用:杜家康, 张博瀚, 陈昊东, 任庆军, 孙洪春. 基于Dijkstra算法的校园外卖配送方案[J]. 电子商务评论, 2018, 7(3): 38-46. https://doi.org/10.12677/ECL.2018.73006

参考文献

[1] 邓佩, 苏翔. 时间约束下的运输网络最短路径研究[J]. 机电产品开发与创新, 2006, 19(1): 18-20.
[2] 王树西, 李安渝. Dijkstra算法中的多邻接点与多条最短路径问题[J]. 计算机科学, 2014, 41(6): 217-224.
[3] 周康, 同小军, 刘文斌, 等. 最短路问题的闭环DNA算法[J]. 系统工程与电子技术, 2008, 30(3): 556-560.
[4] 赵礼峰, 梁娟. 最短路问题的Floyd改进算法[J]. 计算机技术与发展, 2014(8): 31-34.
[5] 冯树民, 吴海月, 王弟鑫. 基于理想点法的多目标最短路求解算法研究[J]. 公路交通科技, 2016, 33(3): 97-101.
[6] 丁秋雷, 胡祥培, 姜洋. 基于前景理论的物流配送干扰管理模型研究[J]. 管理科学学报, 2014, 17(11): 1-9.