Distributed algorithm for traffic dissemination in manhattan networks with optimal routing-time

作者: Sayan Sen Sarma , Koushik Sinha , Goutam Chakraborty , Bhabani P. Sinha

DOI: 10.1145/3019612.3019702

关键词: Floating car dataDistributed algorithmComputer networkGridFlow networkTraffic generation modelNetwork traffic controlComputer scienceNetwork delayQueuing delay

摘要: We consider the problem of traffic routing in a road network event disaster, when there is surge vehicle movement from dense residential areas to designated safe-shelters. address with multiple sources and fixed sink k × Manhattan grid find distribution over such that average time travel minimized. queuing delay at each point points can become potential new generation, then propose an optimal algorithm minimize total all vehicles reach given destination point. extend our technique variable link (as function volume flow through link) along links network.

参考文章(13)
Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige, An O(n log2n) Algorithm for a Sink Location Problem in Dynamic Tree Networks Springer, Boston, MA. pp. 251- 264 ,(2004) , 10.1007/1-4020-8141-3_21
Daniel Delling, Thomas Pajor, Dorothea Wagner, Accelerating Multi-modal Route Planning by Access-Nodes european symposium on algorithms. pp. 587- 598 ,(2009) , 10.1007/978-3-642-04128-0_53
Chayanon Sub-r-pa, Goutam Chakraborty, Dynamic distribute route recommendation system for multiple destinations 2015 12th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON). pp. 1- 5 ,(2015) , 10.1109/ECTICON.2015.7207064
Per Brinch Hansen, None, Operating System Principles ,(1973)
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos Zaroliagis, Efficient models for timetable information in public transportation systems ACM Journal of Experimental Algorithmics. ,vol. 12, pp. 1- 39 ,(2008) , 10.1145/1227161.1227166
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa, An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity The IEICE transactions on information and systems. ,vol. 89, pp. 2372- 2379 ,(2006) , 10.1093/IETISY/E89-D.8.2372
Éva Tardos, Bruce Hoppe, Polynomial time algorithms for some evacuation problems symposium on discrete algorithms. pp. 433- 441 ,(1994) , 10.5555/314464.314583
Michael L. Fredman, Robert Endre Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms Journal of the ACM. ,vol. 34, pp. 596- 615 ,(1987) , 10.1145/28869.28874
Karl Rehrl, Stefan Bruntsch, Hans-Joachim Mentz, Assisting Multimodal Travelers: Design and Prototypical Implementation of a Personal Travel Companion IEEE Transactions on Intelligent Transportation Systems. ,vol. 8, pp. 31- 42 ,(2007) , 10.1109/TITS.2006.890077
James Orlin, Robert E. Tarjan, Kurt Mehlhorn, Ravindra K. Ahuja, Faster Algorithms for the Shortest Path Problem ,(2011)