Robust flows with losses and improvability in evacuation planning

DOI10.1007/S13675-016-0067-XMaRDI QIDQ339930zbMATH OpenOpenAlexFDO

Authors Marc Goerigk, Ismaila Abderhamane Ndiaye

Publication date 11 November 2016

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/79193/1/paper_bw.pdf

zbMATH Keywords

network flowrobust optimizationnetwork designadjustable robustnessflow with lossesrandom recourse

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Discrete location and assignment (90B80)

Recommendations

• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• Robust optimization and evacuation planning with bridges
• A network flow approach to a city emergency evacuation planning
• Evacuation transportation planning under uncertainty: A robust optimization approach
• Sink location to find optimal shelters in evacuation planning

Cites work

• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 1163718 (Why is no real title available?)
• 2-stage robust MILP with continuous recourse variables
• A network flow approach to a city emergency evacuation planning
• A scenario-based approach for robust linear optimization
• Adjustable robust solutions of uncertain linear programs
• Best upgrade plans for large road networks
• Combinatorial approximation algorithms for generalized flow problems
• Decomposition for adjustable robust linear optimization subject to uncertainty polytope
• Faster algorithms for the generalized network flow problem
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Modeling of building evacuation problems by network flows with side constraints
• OR/MS research in disaster operations management
• On budget-constrained flow improvement.
• Optimizing cost flows by edge cost and capacity upgrade
• Recoverable robust knapsacks: \(\Gamma \)-scenarios
• Robust capacity expansion of network flows
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust location transportation problems under uncertain demands
• Robust optimization
• Rollout algorithms for combinatorial optimization
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The Price of Robustness
• The Safest Escape problem
• The concept of recoverable robustness, linear programming recovery, and railway applications
• The robust vehicle routing problem with time windows
• Upgrading Shortest Paths in Networks
• Upgrading arcs to minimize the maximum travel time in a network

Cited in

(4)

• Robust optimization and evacuation planning with bridges
• Ranking robustness and its application to evacuation planning
• The unfortunate-flow problem
• Sink Evacuation on Trees with Dynamic Confluent Flows

This page was built for publication: Robust flows with losses and improvability in evacuation planning

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