[1]王树梅,黄 石,臧禹顺.基于 Dijkstra 算法的城市物流公交系统优化[J].计算机技术与发展,2021,31(10):179-183.[doi:10. 3969 / j. issn. 1673-629X. 2021. 10. 030]
 WANG Shu-mei,HUANG Shi,ZANG Yu-shun.Public Transportation System Optimization of Urban Logistics Based on Dijkstra Algorithm[J].,2021,31(10):179-183.[doi:10. 3969 / j. issn. 1673-629X. 2021. 10. 030]
点击复制

基于 Dijkstra 算法的城市物流公交系统优化()
分享到:

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
31
期数:
2021年10期
页码:
179-183
栏目:
应用前沿与综合
出版日期:
2021-10-10

文章信息/Info

Title:
Public Transportation System Optimization of Urban Logistics Based on Dijkstra Algorithm
文章编号:
1673-629X(2021)10-0179-05
作者:
王树梅1 黄 石2 臧禹顺1
1. 江苏师范大学 计算机科学与技术学院,江苏 徐州 221116;
2. 山东三四物流服务有限公司,山东 单县 274300
Author(s):
WANG Shu-mei1 HUANG Shi2 ZANG Yu-shun1
1. School of Computer Science and Technology,Jiangsu Normal University,Xuzhou 221116,China;
2. Shandong Sansi Logistics Service Co. ,Ltd. ,Shanxian 274300,China
关键词:
Dijkstra 算法城市物流公交模块最短路径物流公交
Keywords:
Dijkstra algorithmurban logisticspublic transport moduleshortest pathlogistics public transport
分类号:
TP391
DOI:
10. 3969 / j. issn. 1673-629X. 2021. 10. 030
摘要:
为了解决物流系统中的货车分配和货车收回问题,对整个社会物流信息进行快速收集及整合,能高效地处理这些数据,提高物流公交效率节约成本支出,文中提出了基于 Dijkstra 算法的物流优化系统。 本系统分为两个阶段,一是货车分配问题,二是货车回收问题。 货车分配问题分为多车一货同地点分配、多车一货异地分配和多车多货异地分配。 利用单源最短路径算法思想,根据货车和货物的所在位置、货车至货物的距离以及货车承载量和体积、货物的重量和体积来确定分配的货车。 第二阶段是货车回收问题,通过判断货车的状态来确定是否对货车进行回收,送货物到达目的地的货车所有参数都会进行初始化,把目的地改为出发地,重新加入分配货车信息系统。 通过实验数据证明,本算法对物流公交具有较高的使用价值。
Abstract:
In order to solve the problem of truck distribution and truck recovery in the logistics system,collect and integrate the logistics information of the whole society quickly,process these data effectively,and improve the efficiency of logistics public transportation,we propose a logistics optimization system based on Dijkstra algorithm. The system is divided into two stages,one is the truck distribution,the other is the truck recovery. The truck distribution can be divided into multi vehicle and one goods distribution in the same place,multi vehicle and one goods distribution in different places,and multi vehicle and multi goods distribution in different places. The Dijkstra algorithm is used to determine the distribution of trucks according to the location of trucks and goods,the distance between trucks and goods,the carrying capacity and volume of freight cars trucks,and the weight and volume of goods. The second stage is the recovery of trucks. By judging the status of trucks,we can determine whether to recycle the trucks. All parameters of the trucks delivered to the destination will be initialized,and the destination will be changed to the departure place,and the distribution of trucks information system will be rejoined. The experimental data show that the proposed algorithm has a high use value for logistics public transportation.

相似文献/References:

[1]纪亚劲,刘艳清,赵礼峰.求解最小费用流的一种新算法[J].计算机技术与发展,2018,28(01):108.[doi:10. 3969/ j. issn. 1673-629X.2018.01.023]
 JI Ya-jin,LIU Yan-qing,ZHAO Li-feng.A New Algorithm for Solving Minimum Cost Flow[J].,2018,28(10):108.[doi:10. 3969/ j. issn. 1673-629X.2018.01.023]
[2]卫泓宇,刘冠灵,谢爱倍,等.基于单目视觉的智能物料分拣机器人的设计[J].计算机技术与发展,2020,30(02):98.[doi:10. 3969 / j. issn. 1673-629X. 2020. 02. 020]
 WEI Hong-yu,LIU Guan-ling,XIE Ai-bei,et al.Design of Intelligent Material Sorting Robot Based on Monocular Vision[J].,2020,30(10):98.[doi:10. 3969 / j. issn. 1673-629X. 2020. 02. 020]
[3]袁玉莹,付 雄.基于扩展 Dijkstra 的多约束 QoS 路由研究[J].计算机技术与发展,2021,31(11):122.[doi:10. 3969 / j. issn. 1673-629X. 2021. 11. 020]
 YUAN Yu-ying,FU Xiong.Research on Multi-constrained QoS Routing Based on Extended Dijkstra[J].,2021,31(10):122.[doi:10. 3969 / j. issn. 1673-629X. 2021. 11. 020]

更新日期/Last Update: 2021-10-10