作者: Sayan Sen Sarma , Koushik Sinha , Goutam Chakraborty , Bhabani P. Sinha
关键词: Floating car data 、 Distributed algorithm 、 Computer network 、 Grid 、 Flow network 、 Traffic generation model 、 Network traffic control 、 Computer science 、 Network delay 、 Queuing 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.