路线推荐系统,支持多个目的地和多条路线,以减少道路挤塞

Chayanon Sub-r-pa, G. Chakraborty, B. Sinha
{"title":"路线推荐系统,支持多个目的地和多条路线,以减少道路挤塞","authors":"Chayanon Sub-r-pa, G. Chakraborty, B. Sinha","doi":"10.1504/IJCNDS.2017.10007998","DOIUrl":null,"url":null,"abstract":"Multiple destinations routing is important for car navigation when a user requests for a service instead of a specific destination. Existing navigation systems can suggest k shortest routes to a destination, where the cost is defined in terms of distance, travel time, or other parameter. In case of a special event like a festival or an unforeseen situation such as tsunami, a large number of users would require the same service, e.g., a parking lot or a safe shelter, not a specific destination. When service points are known, the proposed algorithm first computes multiple near-optimal routes to those destinations, and then optimally distributes the traffic along those routes based on respective costs. This reduces congestion both on road network as well as at service points. Our proposed algorithm has been simulated with real-life traffic data on real city road network, showing encouraging results compared to conventional routing.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Route recommendation system to support multiple destinations and multiple routes to minimise road congestion\",\"authors\":\"Chayanon Sub-r-pa, G. Chakraborty, B. Sinha\",\"doi\":\"10.1504/IJCNDS.2017.10007998\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple destinations routing is important for car navigation when a user requests for a service instead of a specific destination. Existing navigation systems can suggest k shortest routes to a destination, where the cost is defined in terms of distance, travel time, or other parameter. In case of a special event like a festival or an unforeseen situation such as tsunami, a large number of users would require the same service, e.g., a parking lot or a safe shelter, not a specific destination. When service points are known, the proposed algorithm first computes multiple near-optimal routes to those destinations, and then optimally distributes the traffic along those routes based on respective costs. This reduces congestion both on road network as well as at service points. Our proposed algorithm has been simulated with real-life traffic data on real city road network, showing encouraging results compared to conventional routing.\",\"PeriodicalId\":209177,\"journal\":{\"name\":\"Int. J. Commun. Networks Distributed Syst.\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Commun. Networks Distributed Syst.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJCNDS.2017.10007998\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Commun. Networks Distributed Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJCNDS.2017.10007998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

当用户请求服务而不是特定目的地时,多目的地路由对于汽车导航非常重要。现有的导航系统可以建议k条到达目的地的最短路线,其中成本是根据距离、旅行时间或其他参数来定义的。在节日等特殊事件或海啸等不可预见的情况下,大量用户将需要相同的服务,例如停车场或安全避难所,而不是特定的目的地。当服务点已知时,该算法首先计算到这些目的地的多条近似最优路线,然后根据各自的成本对这些路线上的流量进行最优分配。这减少了道路网络和服务点的拥塞。我们提出的算法已经在真实城市路网的真实交通数据中进行了模拟,与传统路由相比,显示出令人鼓舞的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Route recommendation system to support multiple destinations and multiple routes to minimise road congestion
Multiple destinations routing is important for car navigation when a user requests for a service instead of a specific destination. Existing navigation systems can suggest k shortest routes to a destination, where the cost is defined in terms of distance, travel time, or other parameter. In case of a special event like a festival or an unforeseen situation such as tsunami, a large number of users would require the same service, e.g., a parking lot or a safe shelter, not a specific destination. When service points are known, the proposed algorithm first computes multiple near-optimal routes to those destinations, and then optimally distributes the traffic along those routes based on respective costs. This reduces congestion both on road network as well as at service points. Our proposed algorithm has been simulated with real-life traffic data on real city road network, showing encouraging results compared to conventional routing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信