Sage Journals: Discover world-class research

Abstract

Mathematical models and solution frameworks are described for the assessment of command-and-control strategies in the centralized coordination of crowd movement. The effectiveness of several strategies–-from providing only information to reconfiguring the built environment through architectural design changes and forcing pedestrians to follow system-optimal evacuation routes–-is investigated and compared with the use of proposed mathematical formulations and computational solutions. These formulations and solutions are tested on an example network as an illustration. Differences in system performance under these strategies are assessed, and performance (as total travel time) is compared. Efficiency gains obtained with command-and-control strategies in crowd movement are investigated.

Get full access to this article

View all access options for this article.

References

Sheffi

Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall, Englewood Cliffs, N.J., 1985.

Fisk

Some Developments in Equilibrium Traffic Assignment.

Transportation Research Part B: Methodological, Vol. 14, No. 3, 1980, pp. 243–255.

Chen

, and Alfa

A. S.

A Network Design Algorithm Using a Stochastic Incremental Traffic Assignment Approach.

Transportation Science, Vol. 25, No. 3, 1991, pp. 215–224.

Seneviratne

, and Morrall

Analysis of Factors Affecting the Choice of Route of Pedestrians.

Transportation Planning and Technology, Vol. 10, No. 2, 1985, pp. 147–159.

Daamen

, Bovy

P. H. L.

, and Hoogendoorn

S. P.

Influence of Changes in Level on Passenger Route Choice in Railway Stations. In Transportation Research Record: Journal of the Transportation Research Board, No. 1930, Transportation Research Board of the National Academies, Washington, D.C., 2005, pp. 12–20.

Ben-Akiva

, and Bierlaire

Discrete Choice Methods and Their Applications to Short Term Travel Decisions.

Handbook of Transportation Science, Vol. 23, 1999, pp. 5–35.

Branston

Link Capacity Functions: A Review.

Transportation Research, Vol. 10, No. 4, 1976, pp. 223–236.

Migliore

, Martorana

, and Sciortino

An Algorithm to Find All Paths Between Two Nodes in a Graph.

Journal of Computational Physics, Vol. 87, No. 1, 1990, pp. 231–236.

Ugray

, Lasdon

, Plummer

J. C.

, Glover

, Kelly

, and Martí

Scatter Search and Local Nlp Solvers: A Multistart Framework for Global Optimization.

INFORMS Journal on Computing, Vol. 19, No. 3, 2007, pp. 328–340.

10.

Coleman

, Branch

, and Grace

Optimization Toolbox User's Guide, Version 2. Mathworks, Natick, Mass., 1999.

11.

Feng

, and Miller-Hooks

A Network Optimization-Based Approach for Crowd Management in Large Public Gatherings.

Transportation Research Part C: Emerging Technologies, Vol. 42, 2014, pp. 182–199.

12.

Thalmann

, and Musse

S. R.

Crowd Simulation. Springer, New York, 2007.

13.

Proulx

Movement of People: The Evacuation Timing. In SFPE Handbook of Fire Protection Engineering, 3rd ed. National Fire Protection Association, Quincy, Mass., 2002, pp. 3-342–3-366.

14.

Feng

, and Miller-Hooks

Modeling Pedestrian Route Choice During Large Public Gatherings. In Pedestrian and Evacuation Dynamics 2012 ( Weidmann

, Kirsch

, and Schreckenberg

, eds.). Springer, New York, 2014, pp. 789–806.

Mathematical Modeling of Command-and-Control Strategies in Crowd Movement

Abstract

Get full access to this article

References