Abstract
In this research, an optimization framework is proposed to find the system-optimal solution for the emergency evacuation planning problem. The model simultaneously solves for the choice of destination (shelter), evacuation route, and departure time for all evacuees from given origins (endangered zones). Heuristic algorithms are proposed to find the system-optimal dynamic traffic assignment during an iterative procedure. A mesoscopic traffic simulator is embedded in the optimization modules to find travel time marginals and obtain required performance measures in every iteration. Implementing the proposed algorithm brings about dramatic improvements in network performance measures such as total travel time and network clearance time in a case study of Ocean City, Maryland.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transportation Research Record: Journal of the Transportation Research Board
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
