On the use of lexicographic min cost flows in evacuation modeling

DOI10.1002/1520-6750(198708)34:4%3C487::AID-NAV3220340404%3E3.0.CO;2-9MaRDI QIDQ3798458zbMATH OpenOpenAlexFDO

Authors Horst W. Hamacher, Suleyman Tufekci

Publication date 1987

Full work available at URL https://doi.org/10.1002/1520-6750(198708)34:4%3C487::aid-nav3220340404%3E3.0.co;2-9

zbMATH Keywords

project schedulingmultiple objectiveslexicographical optimizationtime-expanded networkBuilding evacuation problemsdynamic network-flow problemslexicographical min cost flow problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Min-max-flow based algorithm for evacuation network planning in restricted spaces
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• An inexact optimization model for evacuation planning
• Model and solution for non-conservation flow evacuation planning problem
• Modeling of building evacuation problems by network flows with side constraints
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning

Cites work

• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• Minimal cost flows in regular matroids

Cited in

(16)

• Lexicographic maximum flow allowing intermediate storage
• scientific article; zbMATH DE number 3912063 (Why is no real title available?)
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• The building evacuation problem with shared information
• A network flow approach to a city emergency evacuation planning
• Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
• On performance measures for evacuation systems
• Optimal building evacuation time considering evacuation routes
• A critical survey on the network optimization algorithms for evacuation planning problems
• Decision support for hospital evacuation and emergency response
• A survey of dynamic network flows
• Updating network flows given multiple, heterogeneous arc attribute changes
• A survey on models and algorithms for discrete evacuation planning network problems
• An introduction to network flows over time
• Traffic Networks and Flows over Time
• OR/MS research in disaster operations management

This page was built for publication: On the use of lexicographic min cost flows in evacuation modeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798458)