尼日利亚多源多目的地道路网络模型的数学公式

Abraham Jighjigh Tamber, Festus O Ikpotokin, Ode Ojowu
{"title":"尼日利亚多源多目的地道路网络模型的数学公式","authors":"Abraham Jighjigh Tamber, Festus O Ikpotokin, Ode Ojowu","doi":"10.33545/26633582.2021.v3.i1a.46","DOIUrl":null,"url":null,"abstract":"In this research work, we examine Nigeria road network of multiple sources-to-multiple destinations from the coastal towns of Lagos, Warri/Asaba, Port Harcourt and Calabar through the intermediary routes to multiple destinations of the border town of Sokoto, Katsina and Maiduguri. The mathematical model was developed using positive edge weights based on the current road distances between state capitals obtained from Nigeria kilometer chart of state capitals. Lingo computer application package was used to solve the formulated problem consisting of 1 objective function, 75 constraints and 441 variables to identify the shortest routes from given multiple sources-to-multiple destinations. The shortest routes obtained compared favorably with the actual ones and were found to be the best","PeriodicalId":147954,"journal":{"name":"International Journal of Engineering in Computer Science","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mathematical formulation of the Nigeria road network model of multiple sources to multiple destinations\",\"authors\":\"Abraham Jighjigh Tamber, Festus O Ikpotokin, Ode Ojowu\",\"doi\":\"10.33545/26633582.2021.v3.i1a.46\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this research work, we examine Nigeria road network of multiple sources-to-multiple destinations from the coastal towns of Lagos, Warri/Asaba, Port Harcourt and Calabar through the intermediary routes to multiple destinations of the border town of Sokoto, Katsina and Maiduguri. The mathematical model was developed using positive edge weights based on the current road distances between state capitals obtained from Nigeria kilometer chart of state capitals. Lingo computer application package was used to solve the formulated problem consisting of 1 objective function, 75 constraints and 441 variables to identify the shortest routes from given multiple sources-to-multiple destinations. The shortest routes obtained compared favorably with the actual ones and were found to be the best\",\"PeriodicalId\":147954,\"journal\":{\"name\":\"International Journal of Engineering in Computer Science\",\"volume\":\"101 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 Engineering in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33545/26633582.2021.v3.i1a.46\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Engineering in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33545/26633582.2021.v3.i1a.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在这项研究工作中,我们研究了尼日利亚从沿海城镇拉各斯、瓦里/阿萨巴、哈科特港和卡拉巴尔到边境城镇索科托、卡齐纳和迈杜古里等多个目的地的多源多目的地道路网络。该数学模型基于尼日利亚各州首府公里图中各州首府之间的当前道路距离,使用正边权建立。利用Lingo计算机应用程序包求解由1个目标函数、75个约束条件和441个变量组成的公式化问题,以确定给定多个来源到多个目的地的最短路线。将最短路线与实际路线进行了比较,发现最短路线是最好的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mathematical formulation of the Nigeria road network model of multiple sources to multiple destinations
In this research work, we examine Nigeria road network of multiple sources-to-multiple destinations from the coastal towns of Lagos, Warri/Asaba, Port Harcourt and Calabar through the intermediary routes to multiple destinations of the border town of Sokoto, Katsina and Maiduguri. The mathematical model was developed using positive edge weights based on the current road distances between state capitals obtained from Nigeria kilometer chart of state capitals. Lingo computer application package was used to solve the formulated problem consisting of 1 objective function, 75 constraints and 441 variables to identify the shortest routes from given multiple sources-to-multiple destinations. The shortest routes obtained compared favorably with the actual ones and were found to be the best
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信