卡拉奇市NADRA移动登记车(MRV)路线优化

{"title":"卡拉奇市NADRA移动登记车(MRV)路线优化","authors":"","doi":"10.26692/surj-ss.v54i3.4169","DOIUrl":null,"url":null,"abstract":"Optimization is the ability of the computers when multiple destinations are available and one of the easiest and shortest paths has to be obtained where the human being are failed to solve the problem. Many people find a challenging task to find out NADRA registration center and, in this case, NADRA has started mobile registration van in which a vehicle has to visit various routes for the registration of CNIC. Various teams are asked to visit sites and provide services to common people. During this journey the teams has to go multiple locations, and, in this case, the repetition may occur, more fuel has to be consumed so the time is consumed more. In this paper a GUI based integrated application has been created in which Genetic Algorithm (GA) has been used to find out the optimal path for the NADRA mobile registration van. The registration teams were given the optimal path or the shortest path so that they can visit the shortest route and save fuel and time. The study can be extended to compare other optimization algorithms and the scheme can be extended to further districts or provinces of Pakistan.","PeriodicalId":21635,"journal":{"name":"SINDH UNIVERSITY RESEARCH JOURNAL -SCIENCE SERIES","volume":"21 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Route optimization for NADRA Mobile Registration Van (MRV) for Karachi\",\"authors\":\"\",\"doi\":\"10.26692/surj-ss.v54i3.4169\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimization is the ability of the computers when multiple destinations are available and one of the easiest and shortest paths has to be obtained where the human being are failed to solve the problem. Many people find a challenging task to find out NADRA registration center and, in this case, NADRA has started mobile registration van in which a vehicle has to visit various routes for the registration of CNIC. Various teams are asked to visit sites and provide services to common people. During this journey the teams has to go multiple locations, and, in this case, the repetition may occur, more fuel has to be consumed so the time is consumed more. In this paper a GUI based integrated application has been created in which Genetic Algorithm (GA) has been used to find out the optimal path for the NADRA mobile registration van. The registration teams were given the optimal path or the shortest path so that they can visit the shortest route and save fuel and time. The study can be extended to compare other optimization algorithms and the scheme can be extended to further districts or provinces of Pakistan.\",\"PeriodicalId\":21635,\"journal\":{\"name\":\"SINDH UNIVERSITY RESEARCH JOURNAL -SCIENCE SERIES\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SINDH UNIVERSITY RESEARCH JOURNAL -SCIENCE SERIES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26692/surj-ss.v54i3.4169\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SINDH UNIVERSITY RESEARCH JOURNAL -SCIENCE SERIES","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26692/surj-ss.v54i3.4169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

优化是指当有多个目的地可供选择时,在人类无法解决的情况下,计算机必须找到最简单和最短的路径之一的能力。许多人发现找到NADRA注册中心是一项具有挑战性的任务,在这种情况下,NADRA已经启动了移动注册车,车辆必须访问各种路线进行CNIC注册。不同的团队被要求访问站点并为普通人提供服务。在这个旅程中,团队必须去多个地方,在这种情况下,重复可能会发生,必须消耗更多的燃料,因此消耗更多的时间。本文开发了一个基于GUI的集成应用程序,在该应用程序中使用遗传算法(GA)来寻找NADRA移动注册车的最优路径。注册团队被分配到最优路径或最短路径,以便他们可以访问最短的路线,节省燃料和时间。该研究可扩展到比较其他优化算法,并可推广到巴基斯坦的其他地区或省。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Route optimization for NADRA Mobile Registration Van (MRV) for Karachi
Optimization is the ability of the computers when multiple destinations are available and one of the easiest and shortest paths has to be obtained where the human being are failed to solve the problem. Many people find a challenging task to find out NADRA registration center and, in this case, NADRA has started mobile registration van in which a vehicle has to visit various routes for the registration of CNIC. Various teams are asked to visit sites and provide services to common people. During this journey the teams has to go multiple locations, and, in this case, the repetition may occur, more fuel has to be consumed so the time is consumed more. In this paper a GUI based integrated application has been created in which Genetic Algorithm (GA) has been used to find out the optimal path for the NADRA mobile registration van. The registration teams were given the optimal path or the shortest path so that they can visit the shortest route and save fuel and time. The study can be extended to compare other optimization algorithms and the scheme can be extended to further districts or provinces of Pakistan.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信