Integrated Special Event Traffic Management Strategies in Urban Transportation Network

How to effectively optimize and control spreading traffic in urban network during the special event has emerged as one of the critical issues faced by many transportation professionals in the past several decades due to the surging demand and the often limited network capacity. The contribution of this dissertation is to develop a set of integrated mathematical programming models for unconventional traffic management of special events in urban transportation network. Traffic management strategies such as lane reorganization and reversal, turning restriction, lane-based signal timing, ramp closure, and uninterrupted flow intersection will be coordinated and concurrently optimized for best overall system performance. Considering the complexity of the proposed formulations and the concerns of computing efficiency, this study has also developed efficient solution heuristics that can yield sufficiently reliable solutions for real-world application. Case studies and extensive numerical analyses results validate the effectiveness and applicability of the proposed models

DEVELOPMENT OF A MIXED-FLOW OPTIMIZATION SYSTEM FOR EMERGENCY EVACUATION IN URBAN NETWORKS

In most metropolitan areas, an emergency evacuation may demand a potentially large number of evacuees to use transit systems or to walk over some distance to access their passenger cars. In the process of approaching designated pick-up points for evacuation, the massive number of pedestrians often incurs tremendous burden to vehicles in the roadway network. Hence, one critical issue in a multi-modal evacuation planning is the effective coordination of the vehicle and pedestrian flows by considering their complex interactions. The purpose of this research is to develop an integrated system that is capable of generating the optimal evacuation plan and reflecting the real-world network traffic conditions caused by the conflicts of these two types of flows. The first part of this research is an integer programming model designed to optimize the control plans for massive mixed pedestrian-vehicle flows within the evacuation zone. The proposed model, integrating the pedestrian and vehicle networks, can effectively account for their potential conflicts during the evacuation. The model can generate the optimal routing strategies to guide evacuees moving toward either their pick-up locations or parking areas and can also produce a responsive plan to accommodate the massive pedestrian movements. The second part of this research is a mixed-flow simulation tool that can capture the conflicts between pedestrians, between vehicles, and between pedestrians and vehicles in an evacuation network. The core logic of this simulation model is the Mixed-Cellular Automata (MCA) concept, which, with some embedded components, offers a realistic mechanism to reflect the competing and conflicting interactions between vehicle and pedestrian flows. This study is expected to yield the following contributions * Design of an effective framework for planning a multi-modal evacuation within metropolitan areas; * Development of an integrated mixed-flow optimization model that can overcome various modeling and computing difficulties in capturing the mixed-flow dynamics in urban network evacuation; * Construction and calibration of a new mixed-flow simulation model, based on the Cellular Automaton concept, to reflect various conflicting patterns between vehicle and pedestrian flows in an evacuation network

A Proposed Framework for Simultaneous Optimization of Evacuation Traffic Distribution and Assignment

In the conventional evacuation planning process, evacuees are assigned to fixed destinations based mainly on the criterion of geographical proximity. However, such pre-specified destinations (OD table) almost always lead to sub-optimal evacuation efficiencies due to uncertain road conditions such as congestion, road blockage, and other hazards associated with the emergency. By relaxing the constraint of assigning evacuees to pre-specified destinations, a one-destination evacuation (ODE) concept has the potential of greatly improving the evacuation efficiency. A framework for simultaneous optimization of evacuation traffic distribution and assignment is therefore proposed in this study. Based on the concept of ODE, the optimal destination and route assignment can be determined by solving a one-destination (1D) traffic assignment problem on a modified network representation. When tested on real-world networks for evacuation studies, the proposed 1D model presents substantial improvement over the conventional multiple-destination (nD) model. For instance, for a hypothetical county-wide evacuation, a nearly 80% reduction in the overall evacuation time can be achieved when modeling of traffic routing with en route information in the 1D framework, and the 1D optimization results can also be used to improve the planning OD tables, resulting in an up to 60% reduction in the overall evacuation time. More importantly, this framework can be actually implemented, and its efficiency enhancement can be realized simply by instructing evacuees to head for more efficient destinations determined from the 1D optimization performed beforehand

An Integrated Contraflow Strategy for Multimodal Evacuation

To improve the efficiency of multimodal evacuation, a network aggregation method and an integrated contraflow strategy are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial subnetwork and balances accuracy and efficiency by refining the local road subnetworks. The integrated contraflow strategy contains three arterial configurations: noncontraflow to shorten the strategy setup time, full-lane contraflow to maximize the evacuation network capacity, and bus contraflow to realize the transit cycle operation. The application of this strategy takes two steps to provide transit priority during evacuation: solve the transit-based evacuation problem with a minimum-cost flow model, firstly, and then address the auto-based evacuation problem with a bilevel network flow model. The numerical results from optimizing an evacuation network for a super typhoon justify the validness and usefulness of the network aggregation method and the integrated contraflow strategy

A Framework for Developing and Integrating Effective Routing Strategies Within the Emergency Management Decision-Support System, Research Report 11-12

This report describes the modeling, calibration, and validation of a VISSIM traffic-flow simulation of the San José, California, downtown network and examines various evacuation scenarios and first-responder routings to assess strategies that would be effective in the event of a no-notice disaster. The modeled network required a large amount of data on network geometry, signal timings, signal coordination schemes, and turning-movement volumes. Turning-movement counts at intersections were used to validate the network with the empirical formula-based measure known as the GEH statistic. Once the base network was tested and validated, various scenarios were modeled to estimate evacuation and emergency vehicle arrival times. Based on these scenarios, a variety of emergency plans for San José’s downtown traffic circulation were tested and validated. The model could be used to evaluate scenarios in other communities by entering their community-specific data

Pedestrian, Crowd, and Evacuation Dynamics

This contribution describes efforts to model the behavior of individual pedestrians and their interactions in crowds, which generate certain kinds of self-organized patterns of motion. Moreover, this article focusses on the dynamics of crowds in panic or evacuation situations, methods to optimize building designs for egress, and factors potentially causing the breakdown of orderly motion.Comment: This is a review paper. For related work see http://www.soms.ethz.c

A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

During real-life disasters, that is, earthquakes, floods, terrorist attacks, and other unexpected events, emergency evacuation and rescue are two primary operations that can save the lives and property of the affected population. It is unavoidable that evacuation flow and rescue flow will conflict with each other on the same spatial road network and within the same time window. Therefore, we propose a novel generalized minimum cost flow model to optimize the distribution pattern of these two types of flow on the same network by introducing the conflict cost. The travel time on each link is assumed to be subject to a bureau of public road (BPR) function rather than a fixed cost. Additionally, we integrate contraflow operations into this model to redesign the network shared by those two types of flow. A nonconvex mixed-integer nonlinear programming model with bilinear, fractional, and power components is constructed, and GAMS/BARON is used to solve this programming model. A case study is conducted in the downtown area of Harbin city in China to verify the efficiency of proposed model, and several helpful findings and managerial insights are also presented

Network Design Model with Evacuation Constraints Under Uncertainty

Abstract: Nepal earthquake, have shown the need for quick response evacuation and assistance routes. Evacuation routes are, mostly, based on the capacities of the roads network. However, in extreme cases, such as earthquakes, roads network infrastructure may adversely affected, and may not supply their required capacities. If for various situations, the potential damage for critical roads can be identify in advance, it is possible to develop an evacuation model, that can be used in various situations to plan the network structure in order to provide fast and safe evacuation. This paper focuses on the development of a model for the design of an optimal evacuation network which simultaneously minimizes construction costs and evacuation time. The model takes into consideration infrastructures vulnerability (as a stochastic function which is dependent on the event location and magnitude), road network, transportation demand and evacuation areas. The paper presents a mathematic model for the presented problem. However, since an optimal solution cannot be found within a reasonable timeframe, a heuristic model is presented as well. The heuristic model is based on evolutionary algorithms, which also provides a mechanism for solving the problem as a stochastic and multi-objective problem