01088346

Component

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

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

In this paper, the maximal dynamic expected flows (MDEF) problem, which seeks the paths and associated flows that maximize the expected number of evacuees who successfully egress within a given time bound T, is defined. The MDEF problem is considered in a network, where arc traversal times and capacities are discrete random variables with time-varying distribution functions and capacities are assumed to be recaptured over time (i.e., the network is dynamic). A metaheuristic based on the principles of noisy genetic algorithms is proposed for its solution. Details of a novel approach (using an approximate likelihood measure) for overcoming the difficulties associated with computing state probabilities that require extremely small floating-point arithmetic are provided. Results from numerical experiments run on randomly generated networks with as many as 500 nodes are given. The results indicate that the proposed solution technique and approximate likelihood measure perform well. Solution of the proposed problem formulation results in robust evacuation paths that are likely to save the largest number of people before conditions become untenable.

01121598

English

pp 26-34

2008

Transportation Research Record: Journal of the Transportation Research Board

9780309126014

Print

Figures (1) ; References (20) ; Tables (1)

Disasters and emergency operations; Emergency management; Evacuation; Genetic algorithms; Strategic planning

Maximal dynamic expected flows; Metaheuristics

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

TRIS, TRB, ATRI

Jan 29 2008 5:24PM

• 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
• Heuristic Framework for Optimizing Hurricane Evacuation Operations
• 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
• 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