A critical survey on the network optimization algorithms for evacuation planning problems
From MaRDI portal
Publication:5020876
zbMATH Open1480.90080MaRDI QIDQ5020876FDOQ5020876
Authors: Tanka Nath Dhamala, Urmila Pyakurel, Stephan Dempe 
Publication date: 7 January 2022
Full work available at URL: http://www.orstw.org.tw/ijor/vol15no3/IJOR2018_vol15_no3_p101_p133.pdf
Recommendations
- A survey on models and algorithms for discrete evacuation planning network problems
- Continuous time dynamic contraflow models and algorithms
- Efficient continuous contraflow algorithms for evacuation planning problems
- Efficient contraflow algorithms for quickest evacuation planning
- Evacuation planning by earliest arrival contraflow
Management decision making, including multiple objectives (90B50) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)
Cites Work
- Continuous time dynamic contraflow models and algorithms
- Cancel-and-tighten algorithm for quickest flow problems
- The mixed evacuation problem
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Abstract flows over time: a first step towards solving dynamic packing problems
- A Polynomial Algorithm for Weighted Abstract Flow
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Earliest arrival flows in networks with multiple sinks
- Dynamics of disasters -- key concepts, models, algorithms, and insights. Selected papers based on the presentations at the 2nd international conference, Kalamata, Greece, June 29 -- July 2015, 2015
- Generalized Maximum Flows over Time
- Dynamic network contraflow evacuation planning problem with continuous time approach
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- An overview of bilevel optimization
- Dioïds and semirings: Links to fuzzy sets and other applications
- Some Properties of a Class of Continuous Linear Programs
- Optimal Time-Varying Flows on Congested Networks
- An Algorithm for a Class of Continuous Linear Programs
- On the minimization of traffic congestion in road networks with tolls
- Max flows in \(O(nm)\) time, or better
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Evacuation network optimization model with Lane-based reversal and routing
- Relief distribution networks: a systematic review
- An optimization approach for real time evacuation reroute planning
- Finding Minimum-Cost Circulations by Successive Approximation
- A Fast Parametric Maximum Flow Algorithm and Applications
- Continuous-Time Flows in Networks
- Efficient continuous-time dynamic network flow algorithms
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Combinatorial Optimization with Rational Objective Functions
- The quickest flow problem
- Transient flows in networks
- Faster algorithms for the quickest transshipment problem
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Algorithms for the quickest path problem and the enumeration of quickest paths
- On the quickest path problem
- A comprehensive survey on the quickest path problem
- A survey on models and algorithms for discrete evacuation planning network problems
- Title not available (Why is that?)
- Earliest Arrival Flows with Multiple Sources
- Title not available (Why is that?)
- Constructing maximal dynamic flows from static flows
- The quickest path problem
- Title not available (Why is that?)
- A medical resource allocation model for serving emergency victims with deteriorating health conditions
- Planning for a bus-based evacuation
- Evacuation planning using multiobjective evolutionary optimization approach
- \(M / G / c / c\) state dependent travel time models and properties
- On solving quickest time problems in time-dependent, dynamic networks
- OR/MS research in disaster operations management
- A strongly polynomial algorithm for generalized flow maximization
- A new approach to the minimum cut problem
- Incremental network design with maximum flows
- Multicriteria optimization in humanitarian aid
- Minimum-cost dynamic flows: The series-parallel case
- A robust bus evacuation model with delayed scenario information
- Continuous and discrete flows over time
- Branch and bound algorithms for the bus evacuation problem
- A survey of dynamic network flows
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
- Title not available (Why is that?)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Earliest arrival flows on series-parallel graphs
- Optimal dynamic routing in communication networks with continuous traffic
- Mathematical models for evacuation planning in urban areas.
- Complexity analysis for maximum flow problems with arc reversals
- Title not available (Why is that?)
- Algorithms for time-dependent bicriteria shortest path problems
- A continuous-time network simplex algorithm
- Extreme Points for Continuous Network Programs with Arc Delays
- A Class of Continuous Network Flow Problems
- A Study of General Dynamic Network Programs with Arc Time-Delays
- An adaptive discretization algorithm for a class of continuous network programs
- Title not available (Why is that?)
- The building evacuation problem with shared information
- On the use of lexicographic min cost flows in evacuation modeling
- Optimal flows in networks with multiple sources and sinks
- Multicommodity flows over time: Efficient algorithms and complexity
- The quickest transshipment problem
- Maximal, Lexicographic, and Dynamic Network Flows
- Quickest Flows Over Time
- Approximating earliest arrival flows with flow-dependent transit times
- A logistics model for the transport of disaster victims with various injuries and survival probabilities
- Reserving relief supplies for earthquake: a multi-attribute decision making of China Red Cross
- A generalization of max flow—min cut
- Fast and simple approximation schemes for generalized flow.
- Combinatorial Algorithms for the Generalized Circulation Problem
- Minimum Convex Cost Dynamic Network Flows
- Evacuation planning by earliest arrival contraflow
- Flows over Time with Load-Dependent Transit Times
- Time dependency in multiple objective dynamic programming
- Time-varying minimum cost flow problems
- Efficient contraflow algorithms for quickest evacuation planning
- A finite-time algorithm for shortest path problems with time-varying costs
- Efficient continuous contraflow algorithms for evacuation planning problems
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- Optimum flows in general communication networks
- Continuous dynamic contraflow approach for evacuation planning
- Preface: Multiple criteria optimization and goal programming in science, engineering, and social sciences
- Continuous-time shortest path problems with stopping and starting costs
- Title not available (Why is that?)
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- A generalized dynamic flows problem
- Title not available (Why is that?)
- Minimum cost dynamic flows: the series-parallel case
- Generalized max flow in series-parallel graphs
- Bi‐level programming based contra flow optimization for evacuation events
Cited In (16)
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- Multi-commodity flow problem on lossy network with partial lane reversals
- Mathematical models for evacuation planning in urban areas.
- An improved online evacuation strategy from a convex region on grid networks
- Dynamic multicommodity contraflow problem with asymmetric transit times
- FlowLoc problems with maximum excess flow
- Maximum FlowLoc problems with network reconfiguration
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- ENERGY-AWARE NAVIGATION IN LARGE-SCALE EVACUATION USING G-NETWORKS
- <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
- Priority-oriented route network planning for evacuation in constrained space scenarios
- Dynamic network flow location models and algorithms for quickest evacuation planning
- A survey on models and algorithms for discrete evacuation planning network problems
- Abstract network flow with intermediate storage for evacuation planning
- Network flow with intermediate storage: models and algorithms
- Generalized maximum flow over time with intermediate storage
This page was built for publication: A critical survey on the network optimization algorithms for evacuation planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020876)
