Modeling of building evacuation problems by network flows with side constraints

DOI10.1016/0377-2217(88)90382-7zbMath0636.90029OpenAlexW2048943078MaRDI QIDQ1098760

Wonjoon Choi, Suleyman Tufekci, Horst W. Hamacher

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90382-7

zbMATH Keywords

maximum flowminimum cost`greedy' algorithmsbuilding evacuationsminimax objectivesnetwork flows with side constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)

Related Items (16)

Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm ⋮ Evacuation planning with endogenous transportation network degradations: a stochastic cell-based model and solution procedure ⋮ Evacuation modeling: a case study on linear and nonlinear network flow models ⋮ Robust flows with losses and improvability in evacuation planning ⋮ On performance measures for evacuation systems ⋮ Priority-oriented route network planning for evacuation in constrained space scenarios ⋮ A Pilgrim Scheduling Approach to Increase Safety During the Hajj ⋮ A survey of dynamic network flows ⋮ Decision support for hospital evacuation and emergency response ⋮ Simultaneous evacuation and entrance planning in complex building based on dynamic network flows ⋮ Balanced-flow algorithm for path network planning in hierarchical spaces ⋮ Dynamic evacuation routes for personnel on a naval ship ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Optimal building evacuation time considering evacuation routes ⋮ Abstract network flow with intermediate storage for evacuation planning ⋮ A tool for network modeling

Cites Work

• Unnamed Item
• Unnamed Item
• Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
• The simplex SON algorithm for LP/embedded network problems
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Maximal, Lexicographic, and Dynamic Network Flows
• The factorization approach to large-scale linear programming
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Unimodular matrices of flow problems with additional constraints
• An Approach to Some Structured Linear Programming Problems
• Optimality Criteria in Nonlinear Programming Without Differentiability
• A generalized upper bounding method for doubly coupled linear programs

This page was built for publication: Modeling of building evacuation problems by network flows with side constraints