Proceedings ArticleDOI
Reduction of congestion in a Manhattan grid road network by detouring of vehicles
Sayan Sen Sarma,Koushik Sinha,Goutam Chakraborty,Bhabani P. Sinha +3 more
- pp 1-6
Reads0
Chats0
TLDR
The aim of this paper is to detour a fraction of traffic to reduce the traffic load from the congested nodes to improve the system performance in case of natural disaster.Abstract:
In this paper, we consider the traffic management in case of natural disaster when lot of vehicles from dense residential areas start to move simultaneously to the nearest safe-shelter. The problem is addressed with a Manhattan k × k grid road network with multiple source points and a single sink. In such scenario, the total average delay of the system gets considerably large due to heavy traffic load at nodes nearer to the sink. Our aim is to detour a fraction of traffic to reduce the traffic load from the congested nodes to improve the system performance.read more
References
More filters
Mathematical Modelling of Evacuation Problems: A State of Art
Horst W. Hamacher,S.A. Tjandra +1 more
TL;DR: This paper details models and algorithms which can be applied to evacuation problems and focuses on macroscopic and microscopic evacuation models both of which are able to capture the evacuees' movement over time.
Journal ArticleDOI
The Quickest Transshipment Problem
Bruce Hoppe,Òva Tardos +1 more
TL;DR: The first polynomial-time algorithm for the quickest transshipment problem, which provides an integral optimum flow and is commonly used to model building evacuation.
Journal Article
Dynamic Traffic Assignment: A Primer
Yi-Chang Chiu,Jon Bottom,Michael Mahut,Alexander Paz,Ramachandran Balakrishna,Travis Waller,Jim Hicks +6 more
TL;DR: This circular is designed to help explain the basic concepts and definitions of dynamic traffic assignment (DTA) models and addresses the application, selection, planning, and execution of a DTA model.
Proceedings ArticleDOI
Polynomial time algorithms for some evacuation problems
Bruce Hoppe,Éva Tardos +1 more
TL;DR: A polynomial time algorithm is given for the evacuation problem with a fixed number of sources and sinks, and a dynamic flow is sought that lexicographically maximizes the amounts-of flow between sources in a soecified order.