有向网络中计算最短路径的扩展TANYAKUMU标记方法

IF 1.3 Q3 ENGINEERING, MULTIDISCIPLINARY

International Journal of Mathematical Engineering and Management Sciences Pub Date : 2023-10-01 DOI:10.33889/ijmems.2023.8.5.057

Trust Tawanda, E. Munapo, Santosh Kumar, Philimon Nyamugure

{"title":"有向网络中计算最短路径的扩展TANYAKUMU标记方法","authors":"Trust Tawanda, E. Munapo, Santosh Kumar, Philimon Nyamugure","doi":"10.33889/ijmems.2023.8.5.057","DOIUrl":null,"url":null,"abstract":"Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related problems. The current paper extends the TANYAKUMU labelling method for solving the Travelling salesman problem (TSP) to solve SPP in directed transportation networks. Numerical illustrations are used to prove the validity of the proposed method. The main contributions of this paper are as follows: (i) modification of TSP algorithm to solve single source SPP, (ii) the developed method numerically evaluated on four increasingly complex problems of sizes 11×11, 21×21, 23×23 and 26×26 and lastly (iii) the solutions obtained from solving these four problems are compared with those obtained by Minimum incoming weight label (MIWL) algorithm. The proposed algorithm computed the same shortest paths as the MIWL algorithm on all four problems.","PeriodicalId":44185,"journal":{"name":"International Journal of Mathematical Engineering and Management Sciences","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Extended TANYAKUMU Labelling Method to Compute Shortest Paths in Directed Networks\",\"authors\":\"Trust Tawanda, E. Munapo, Santosh Kumar, Philimon Nyamugure\",\"doi\":\"10.33889/ijmems.2023.8.5.057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related problems. The current paper extends the TANYAKUMU labelling method for solving the Travelling salesman problem (TSP) to solve SPP in directed transportation networks. Numerical illustrations are used to prove the validity of the proposed method. The main contributions of this paper are as follows: (i) modification of TSP algorithm to solve single source SPP, (ii) the developed method numerically evaluated on four increasingly complex problems of sizes 11×11, 21×21, 23×23 and 26×26 and lastly (iii) the solutions obtained from solving these four problems are compared with those obtained by Minimum incoming weight label (MIWL) algorithm. The proposed algorithm computed the same shortest paths as the MIWL algorithm on all four problems.\",\"PeriodicalId\":44185,\"journal\":{\"name\":\"International Journal of Mathematical Engineering and Management Sciences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mathematical Engineering and Management Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33889/ijmems.2023.8.5.057\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mathematical Engineering and Management Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33889/ijmems.2023.8.5.057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

最短路径问题（SPP）在电信、运输和应急服务以及邮政服务等领域有着广泛的应用。因此，已经开发了几种算法来解决SPP和相关问题。本文将求解旅行商问题的TANYAKUMU标记方法推广到有向运输网络中的旅行商问题。数值算例验证了该方法的有效性。本文的主要贡献如下：（i）对TSP算法进行了改进，以解决单源SPP，（ii）对尺寸为11×11、21×21、，23×23和26×26，最后（iii）将从解决这四个问题中获得的解与通过最小输入权重标签（MIWL）算法获得的解进行比较。所提出的算法在所有四个问题上都计算出与MIWL算法相同的最短路径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Extended TANYAKUMU Labelling Method to Compute Shortest Paths in Directed Networks

Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related problems. The current paper extends the TANYAKUMU labelling method for solving the Travelling salesman problem (TSP) to solve SPP in directed transportation networks. Numerical illustrations are used to prove the validity of the proposed method. The main contributions of this paper are as follows: (i) modification of TSP algorithm to solve single source SPP, (ii) the developed method numerically evaluated on four increasingly complex problems of sizes 11×11, 21×21, 23×23 and 26×26 and lastly (iii) the solutions obtained from solving these four problems are compared with those obtained by Minimum incoming weight label (MIWL) algorithm. The proposed algorithm computed the same shortest paths as the MIWL algorithm on all four problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Mathematical Engineering and Management Sciences Multiple-

CiteScore

3.80

自引率

6.20%

发文量

审稿时长

20 weeks

期刊介绍： IJMEMS is a peer reviewed international journal aiming on both the theoretical and practical aspects of mathematical, engineering and management sciences. The original, not-previously published, research manuscripts on topics such as the following (but not limited to) will be considered for publication: *Mathematical Sciences- applied mathematics and allied fields, operations research, mathematical statistics. *Engineering Sciences- computer science engineering, mechanical engineering, information technology engineering, civil engineering, aeronautical engineering, industrial engineering, systems engineering, reliability engineering, production engineering. *Management Sciences- engineering management, risk management, business models, supply chain management.