A survey on models and algorithms for discrete evacuation planning network problems
From MaRDI portal
Publication:2514655
DOI10.3934/jimo.2015.11.265zbMath1304.90052OpenAlexW2334327473MaRDI QIDQ2514655
Publication date: 3 February 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2015.11.265
Analysis of algorithms and problem complexity (68Q25) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (15)
Evacuation planning by earliest arrival contraflow ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Efficient continuous contraflow algorithms for evacuation planning problems ⋮ FlowLoc problems with maximum excess flow ⋮ Priority-oriented route network planning for evacuation in constrained space scenarios ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Design of a single window system for e-government services: the Chilean case ⋮ Bi-objective safe and resilient urban evacuation planning ⋮ A balanced evacuation algorithm for facilities with multiple exits ⋮ Balanced-flow algorithm for path network planning in hierarchical spaces ⋮ Partial contraflow with path reversals for evacuation planning ⋮ Heterogeneous multi-commodity network flows over time ⋮ Abstract network flow with intermediate storage for evacuation planning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Pattern-based evacuation planning for urban areas
- Continuous and discrete flows over time
- Planning for a bus-based evacuation
- The quickest path problem
- A survey of dynamic network flows
- Complexity analysis for maximum flow problems with arc reversals
- Multi-objective evacuation routing in transportation networks
- Modeling of building evacuation problems by network flows with side constraints
- Transient flows in networks
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Geometric algorithms and combinatorial optimization
- On the quickest path problem
- Efficient continuous-time dynamic network flow algorithms
- On solving quickest time problems in time-dependent, dynamic networks
- A new algorithm for minimizing convex functions over convex sets
- A capacitated network flow optimization approach for short notice evacuation planning
- OR/MS research in disaster operations management
- Faster Algorithms for the Quickest Transshipment Problem
- The Quickest Transshipment Problem
- Universally maximum flow with piecewise-constant capacities
- Earliest arrival flows on series-parallel graphs
- Earliest Arrival Flows with Multiple Sources
- Optimal dynamic routing in communication networks with continuous traffic
- The building evacuation problem with shared information
- Traffic Networks and Flows over Time
- On the use of lexicographic min cost flows in evacuation modeling
- Combinatorial Optimization with Rational Objective Functions
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- A Class of Continuous Network Flow Problems
- The quickest flow problem
- Optimal flows in networks with multiple sources and sinks
- Maximal, Lexicographic, and Dynamic Network Flows
- A generalized dynamic flows problem
- Continuous-Time Shortest Path Problems and Linear Programming
- A network flow approach to a city emergency evacuation planning
- A Fast Parametric Maximum Flow Algorithm and Applications
- On the computation of fast data transmissions in networks with capacities and delays
- Constructing Maximal Dynamic Flows from Static Flows
- Quickest Flows Over Time
- An Algorithm for Universal Maximal Dynamic Flows in a Network
This page was built for publication: A survey on models and algorithms for discrete evacuation planning network problems
