{"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}
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.