寻找k -简单最短路径的Yen算法的变种比较

P. B. Niranjane, S. Amdani
{"title":"寻找k -简单最短路径的Yen算法的变种比较","authors":"P. B. Niranjane, S. Amdani","doi":"10.1109/CONIT55038.2022.9847738","DOIUrl":null,"url":null,"abstract":"In directed and weighted graph, with n nodes and m edges, the K-shortest paths problem involve finding a set of k shortest paths between a defined source and destination pair where the first path is shortest, and the remaining k-1 paths are in increasing lengths. In K-shortest path problem there are two classes, k shortest simple path problem and k shortest non-simple path problem. The first algorithm to solve K shortest simple path problems is Yen's algorithm based on deviation path concept. Later many variants of Yen's algorithm are proposed with improved computational performance. In this paper some of the variants of Yen's algorithm for finding top k simple shortest path are studied and compared.","PeriodicalId":270445,"journal":{"name":"2022 2nd International Conference on Intelligent Technologies (CONIT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths\",\"authors\":\"P. B. Niranjane, S. Amdani\",\"doi\":\"10.1109/CONIT55038.2022.9847738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In directed and weighted graph, with n nodes and m edges, the K-shortest paths problem involve finding a set of k shortest paths between a defined source and destination pair where the first path is shortest, and the remaining k-1 paths are in increasing lengths. In K-shortest path problem there are two classes, k shortest simple path problem and k shortest non-simple path problem. The first algorithm to solve K shortest simple path problems is Yen's algorithm based on deviation path concept. Later many variants of Yen's algorithm are proposed with improved computational performance. In this paper some of the variants of Yen's algorithm for finding top k simple shortest path are studied and compared.\",\"PeriodicalId\":270445,\"journal\":{\"name\":\"2022 2nd International Conference on Intelligent Technologies (CONIT)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 2nd International Conference on Intelligent Technologies (CONIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIT55038.2022.9847738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Conference on Intelligent Technologies (CONIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIT55038.2022.9847738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在有向加权图中,有n个节点和m条边,k-最短路径问题涉及在定义的源和目标对之间寻找k条最短路径,其中第一条路径最短,其余k-1条路径长度递增。在k最短路径问题中有两类,即k个最短简单路径问题和k个最短非简单路径问题。第一个解决K个最短简单路径问题的算法是基于偏差路径概念的Yen算法。后来提出了许多Yen算法的变体,提高了计算性能。本文对Yen算法的几种变种进行了研究和比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparison of Variants of Yen's Algorithm for Finding K-Simple Shortest Paths
In directed and weighted graph, with n nodes and m edges, the K-shortest paths problem involve finding a set of k shortest paths between a defined source and destination pair where the first path is shortest, and the remaining k-1 paths are in increasing lengths. In K-shortest path problem there are two classes, k shortest simple path problem and k shortest non-simple path problem. The first algorithm to solve K shortest simple path problems is Yen's algorithm based on deviation path concept. Later many variants of Yen's algorithm are proposed with improved computational performance. In this paper some of the variants of Yen's algorithm for finding top k simple shortest path are studied and compared.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信