01088417

Component

https://doi.org/10.3141/2089-02

http://scholar.google.com...hani&publication_year=2008

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.

01121598

English

pp 9-17

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (6) ; Maps (1) ; References (13)

Case studies; Departure time; Disasters and emergency operations; Dynamic traffic assignment; Evacuation; Heuristic methods; Hurricanes; Mesoscopic traffic flow; Optimization; Route choice; Shelters; Traffic simulation; Travel time

Emergency evacuations

Ocean City (Maryland)

Highways; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB

Jan 29 2008 4:42PM

• Combination of Multiple Ant Colony System and Simulated Annealing for the Multidepot Vehicle-Routing Problem with Time Windows
• Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times: Implication for Traffic Incident Management
• Efficient Implementation of Improvement Procedures for Vehicle Routing with Time-Dependent Travel Times
• Equity and Efficiency Analysis of Pricing Strategies in a Bimodal Network with Heterogeneous User Groups
• Incorporating Environmental Justice Measures into Equilibrium-Based Network Design
• Integrating Equity Objectives in a Road Network Design Model
• Location Routing Approach for the Humanitarian Prepositioning Problem
• Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
• New Methodology for Optimizing Transit Priority at the Network Level
• Optimizing Distance-Based Fares and Headway of an Intercity Transportation System with Elastic Demand and Trip Length Differentiation
• Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints
• Solution Algorithm for Long-Haul Freight Network Design Using Shipper–Carrier Freight Flow Prediction with Explicit Capacity Constraints