使用Dijkstra算法实现动态权值最短路径

ComTech Pub Date : 2016-09-30 DOI:10.21512/comtech.v7i3.2534
Elizabeth Nurmiyati Tamatjita, Aditya W. Mahastama
{"title":"使用Dijkstra算法实现动态权值最短路径","authors":"Elizabeth Nurmiyati Tamatjita, Aditya W. Mahastama","doi":"10.21512/comtech.v7i3.2534","DOIUrl":null,"url":null,"abstract":"Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.","PeriodicalId":31095,"journal":{"name":"ComTech","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm\",\"authors\":\"Elizabeth Nurmiyati Tamatjita, Aditya W. Mahastama\",\"doi\":\"10.21512/comtech.v7i3.2534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.\",\"PeriodicalId\":31095,\"journal\":{\"name\":\"ComTech\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ComTech\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21512/comtech.v7i3.2534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ComTech","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21512/comtech.v7i3.2534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

长期以来,最短路径算法一直被应用于以最小的成本或时间选择最可行的路径来解决日常问题。然而,有些问题并不简单。本研究使用Dijkstra算法对具有两种可能的有向图(单向和双向)的街道路线图进行了应用。每个费用可以随时改变,代表交通状况的变化。结果表明,在路径映射中使用单向有向图确实可以使目标达到,而使用双向有向图可能会引起混淆,尽管这可能是现实世界中可能的选择。两个实验都表明,在到达目标的中途重新计算最短路径没有额外的计算压力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Shortest Path with Dynamic Weight Implementation using Dijkstra’s Algorithm
Shortest path algorithms have been long applied to solve daily problems by selecting the most feasible route with minimum cost or time. However, some of the problems are not simple. This study applied the case using Dijkstra's algorithm on a graph representing street routes with two possible digraphs: one-way and twoway. Each cost was able to be changed anytime, representing the change in traffic condition. Results show that the usage of one way digraph in mapping the route does make the goal possible to reach, while the usage of twoway digraph may cause confusion although it is probably the possible choice in the real world. Both experiments showed that there are no additional computation stresses in re-calculating the shortest path while going halfway to reach the goal.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
6
审稿时长
16 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信