Roadside Parking Space Search and Assistance System for Modern Cities

Aneesh Epari, V. Chaurasiya, Shishupal Kumar
{"title":"Roadside Parking Space Search and Assistance System for Modern Cities","authors":"Aneesh Epari, V. Chaurasiya, Shishupal Kumar","doi":"10.1109/EnT47717.2019.9030545","DOIUrl":null,"url":null,"abstract":"People waste a lot of time in searching for a roadside parking space, especially in busy areas like the marketplace. In addition to wastage of time, it causes extra congestion on the road as vehicles which were supposed to be parked are still roaming on the roads, consequently extra pollution, and most importantly stress and inconvenience to the driver. To address these issues, a framework is proposed to provide assistance to drivers in searching for a roadside parking place. Instead of providing direction to one parking area, which is not feasible as roadside parking areas do not have reservation facilities, this framework will suggest a series of options (basically routes) for the driver to follow. The approach uses ant colony optimization to tackle the computationally challenging task. The algorithm tries to suggest a route which is not only close to the drivers location but also avoids areas of congestion if possible. The proposed approach is simulated using SUMO simulator suite. The proposed routing approach has been compared with the random routing approach using different metrics and the results show that the proposed approach performs significantly better than the random approach.","PeriodicalId":288550,"journal":{"name":"2019 International Conference on Engineering and Telecommunication (EnT)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Engineering and Telecommunication (EnT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EnT47717.2019.9030545","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

People waste a lot of time in searching for a roadside parking space, especially in busy areas like the marketplace. In addition to wastage of time, it causes extra congestion on the road as vehicles which were supposed to be parked are still roaming on the roads, consequently extra pollution, and most importantly stress and inconvenience to the driver. To address these issues, a framework is proposed to provide assistance to drivers in searching for a roadside parking place. Instead of providing direction to one parking area, which is not feasible as roadside parking areas do not have reservation facilities, this framework will suggest a series of options (basically routes) for the driver to follow. The approach uses ant colony optimization to tackle the computationally challenging task. The algorithm tries to suggest a route which is not only close to the drivers location but also avoids areas of congestion if possible. The proposed approach is simulated using SUMO simulator suite. The proposed routing approach has been compared with the random routing approach using different metrics and the results show that the proposed approach performs significantly better than the random approach.
现代城市路边停车位搜索辅助系统
人们在寻找路边停车位上浪费了很多时间,尤其是在像市场这样的繁忙地区。除了浪费时间之外,它还会造成道路上额外的拥堵,因为本应该停车的车辆仍然在路上游荡,从而造成额外的污染,最重要的是给司机带来压力和不便。为了解决这些问题,我们提出了一个框架,为司机寻找路边停车位提供帮助。该框架将为驾驶员提供一系列选择(基本上是路线),而不是提供指向一个停车区域的方向,这是不可行的,因为路边停车区域没有预订设施。该方法使用蚁群优化来解决计算上具有挑战性的任务。该算法试图建议一条路线,不仅接近司机的位置,而且在可能的情况下避开拥堵区域。采用相扑仿真器对该方法进行了仿真。采用不同的度量将所提出的路由方法与随机路由方法进行了比较,结果表明所提出的路由方法的性能明显优于随机路由方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信