MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models

Abraham Jighjigh Tamber, Festus O Ikpotokin, Linus U. Okafor, Gabriel Apine Ateata, Ode Ojowu, Paul Amon
{"title":"MS-MD-Shortest route pathfinder for multiple sources to multiple destinations of directed graph models","authors":"Abraham Jighjigh Tamber, Festus O Ikpotokin, Linus U. Okafor, Gabriel Apine Ateata, Ode Ojowu, Paul Amon","doi":"10.33545/27076636.2021.v2.i1a.19","DOIUrl":null,"url":null,"abstract":"This paper presents a computer package that was developed to obtain the shortest route from the Multiple Sources to Multiple Destinations of Directed Graph Models of the Nigeria refineries to their deports located outside the refineries towns and the Nigeria roads network of motorable road b from multiple sources to multiple destinations directly without decomposing like in the case of the existing computer packages. The existing ones cannot solve the network problem of multiple sources to multiple destination (MSMD) directly but by first splitting the network into single sources to single destination networks and these networks are solved individually before superimposing into a single network manually. Also in the existing computer packages, Network data are not inputted directly before solving the problem, rather only the numerical part of the data is extracted from the network and inputted for solving the network problem and also the solution of the network is not presented in the network-like form rather, they are presented in tables which destroys the beauty of the network. Secondly, some of these computer packages, like Microsoft Excel, need to be reprogrammed before performing these tasks; these make solving such problems very hectic. Hence the need for simpler Graphic User Interface (MSMD-Shortest Route finder) that network models are inputted directly without tempering with the network, splitting the network nor reprogramming and also the solution are presented in a network tree with the summary, which is the objective of this research. The distances of the various roads in the Nigeria roads network were obtained using google map from google GPS and Nigeria Atlas map. The Optimal routes of the Nigeria refineries to their deports by road and Nigeria roads network of motorable road from multiple sources (coastal towns: Lagos, Port-Harcourt, Asaba/warri and Calabar) to multiple destinations (border towns: Katsina, Sokoto and Maiduguri) were obtained using MSMD-Shortest Route finder. The shortest routes obtained by using the MSMD-Shortest Route finder compares favorably with the existing ones and was found to be the best.","PeriodicalId":127185,"journal":{"name":"International Journal of Computing, Programming and Database Management","volume":"204 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing, Programming and Database Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33545/27076636.2021.v2.i1a.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a computer package that was developed to obtain the shortest route from the Multiple Sources to Multiple Destinations of Directed Graph Models of the Nigeria refineries to their deports located outside the refineries towns and the Nigeria roads network of motorable road b from multiple sources to multiple destinations directly without decomposing like in the case of the existing computer packages. The existing ones cannot solve the network problem of multiple sources to multiple destination (MSMD) directly but by first splitting the network into single sources to single destination networks and these networks are solved individually before superimposing into a single network manually. Also in the existing computer packages, Network data are not inputted directly before solving the problem, rather only the numerical part of the data is extracted from the network and inputted for solving the network problem and also the solution of the network is not presented in the network-like form rather, they are presented in tables which destroys the beauty of the network. Secondly, some of these computer packages, like Microsoft Excel, need to be reprogrammed before performing these tasks; these make solving such problems very hectic. Hence the need for simpler Graphic User Interface (MSMD-Shortest Route finder) that network models are inputted directly without tempering with the network, splitting the network nor reprogramming and also the solution are presented in a network tree with the summary, which is the objective of this research. The distances of the various roads in the Nigeria roads network were obtained using google map from google GPS and Nigeria Atlas map. The Optimal routes of the Nigeria refineries to their deports by road and Nigeria roads network of motorable road from multiple sources (coastal towns: Lagos, Port-Harcourt, Asaba/warri and Calabar) to multiple destinations (border towns: Katsina, Sokoto and Maiduguri) were obtained using MSMD-Shortest Route finder. The shortest routes obtained by using the MSMD-Shortest Route finder compares favorably with the existing ones and was found to be the best.
ms - md -有向图模型中多个源到多个目的地的最短路径寻路器
本文提出了一个计算机包,该计算机包是为了获得尼日利亚炼油厂的多源到多目的地的有向图模型到位于炼油厂城镇外的出口处和尼日利亚公路b的多源到多个目的地的最短路线而开发的,而不像现有的计算机包那样分解。现有的方案不能直接解决多源到多目的(MSMD)的网络问题,而是先将网络分割成单源到单目的网络,然后逐个解决,再人工叠加成一个网络。同样,在现有的计算机软件包中,网络数据在解决问题之前不是直接输入的,而是从网络中提取数据的数字部分并输入解决网络问题,而且网络的解也不是以类似网络的形式呈现,而是以表格的形式呈现,这破坏了网络的美感。其次,其中一些计算机软件包,如微软Excel,在执行这些任务之前需要重新编程;这使得解决这类问题变得非常忙乱。因此,需要更简单的图形用户界面(msmd -最短寻路器),即直接输入网络模型,不需要对网络进行调整,不需要对网络进行分割,也不需要重新编程,并以带有摘要的网络树形式给出解决方案,这是本研究的目标。尼日利亚道路网络中各条道路的距离使用谷歌地图从谷歌GPS和尼日利亚地图集地图中获得。利用msmd最短寻路器获得了尼日利亚炼油厂通过公路和尼日利亚公路网络从多个来源(沿海城镇:拉各斯、哈科特港、阿萨巴/瓦里和卡拉巴尔)到多个目的地(边境城镇:卡齐纳、索科托和迈杜古里)的最佳路线。使用msmd -最短寻路器得到的最短路由与已有的路由进行了比较,是最好的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信