Mathematical Models for Evacuation Planning in Urban Areas

Online-Ressource (XVI, 193 p. 79 illus, digital)

Lecture Notes in Economics and Mathematical Systems ; 659

Description based upon print version of record

Mathematical Models for Evacuation Planning in Urban Areas; Preface; Contents; List of Figures; List of Tables; Chapter1 Introduction; 1.1 Evacuation Planning; 1.2 Basic Network Flow Problems; 1.2.1 A Generic Network Flow Model; 1.2.2 A Generic Network Flow Model with Waiting on Arcs; 1.2.3 Objectives; 1.3 Crossing and Merging Conflicts; 1.4 Chapter Synopsis; References; Chapter2 Literature Review; 2.1 Flow-Based Optimization Models; 2.2 Evacuation Models with Traffic Management Strategies; 2.3 Further Problems in Evacuation Planning; 2.4 Simulation Approaches; 2.5 Summary; References

Chapter3 An Urban Evacuation Problem3.1 A Network Representation; 3.2 A Mixed-Integer Urban Evacuation Model; 3.2.1 Decision Variables and Additional Parameters; 3.2.2 Model Formulation; 3.3 An Extension of the Urban Evacuation Model: Waiting on Arcs; 3.4 An Extension of the Urban Evacuation Model: A One-Way Evacuation Model; 3.5 Examples of the Variations of the Urban Evacuation Model; 3.5.1 An Example Considering Different Objective Functions; 3.5.2 An Example Considering Evacuation Models with and without Waiting; 3.5.3 An Example Considering the Two-Way and One-Way Model; References

Chapter4 A Relaxation-Based Heuristic Approach for the Mixed-Integer Evacuation Model4.1 A Relaxation-Based Heuristic Solution Approach; 4.1.1 Preliminary Considerations; 4.1.2 Adjustment Algorithm; 4.2 Adjustments for the Evacuation Model with Waiting and the One-Way Urban Evacuation Model; 4.3 Computational Study; 4.3.1 Computational Study: Two-Way Heuristic Approach; 4.3.2 Computational Study: One-Way Heuristic Approach; References; Chapter5 A Pattern-Based Evacuation Planning Model for Urban Areas; 5.1 A One-Stage Pattern-Based Urban Evacuation Model

5.2 Patterns of Street Sections Between Intersections5.3 Patterns of Intersections; 5.3.1 Graphs and Patterns of Intersections; 5.3.2 Number of Crossing Conflicts; 5.3.3 Planar Graphs and Patterns; References; Chapter6 A Two-Staged Heuristic Approach; 6.1 First Stage of the Heuristic; 6.2 Second Stage of the Heuristic; 6.3 Computational Study; 6.3.1 Sets of Instances; 6.3.2 Models for Comparison; 6.3.3 Computational Results; Reference; Chapter7 A Multicommodity Urban Evacuation Problem; 7.1 Introduction and Assumptions; 7.2 A Multicommodity Evacuation Model; 7.2.1 A Network Representation

7.2.2 Parameters and Variables7.2.3 Objective and Constraints; 7.3 An Illustration of Solutions of the Multicommodity Urban Evacuation Model; Chapter8 A Four-Staged Heuristic Approach to Solve the Urban Multicommodity Model; 8.1 First Stage of the Multicommodity Heuristic; 8.2 Second Stage of the Multicommodity Heuristic; 8.3 Third Stage of the Multicommodity Heuristic; 8.4 Fourth Stage of the Multicommodity Heuristic; 8.5 Computational Study; Chapter 9 Conclusions and Future Research; References; Appendix A Information About the Computational Study of the Relaxation-Based Approach

A.1 Reference Values Used to Compare the Results of the Relaxation-Based Approach

10.1007/978-3-642-28759-6 [DOI]

ECONIS - Online Catalogue of the ZBW