A critical survey on the network optimization algorithms for evacuation planning problems
From MaRDI portal
(Redirected from Publication:5020876)
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Management decision making, including multiple objectives (90B50)
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
Cites work
- \(M / G / c / c\) state dependent travel time models and properties
- A Class of Continuous Network Flow Problems
- A comprehensive survey on the quickest path problem
- A continuous-time network simplex algorithm
- A Fast Parametric Maximum Flow Algorithm and Applications
- A finite-time algorithm for shortest path problems with time-varying costs
- A generalization of max flow—min cut
- A generalized dynamic flows problem
- A logistics model for the transport of disaster victims with various injuries and survival probabilities
- A medical resource allocation model for serving emergency victims with deteriorating health conditions
- A new approach to the minimum cut problem
- A Polynomial Algorithm for Weighted Abstract Flow
- A robust bus evacuation model with delayed scenario information
- A strongly polynomial algorithm for generalized flow maximization
- A Study of General Dynamic Network Programs with Arc Time-Delays
- A survey of dynamic network flows
- A survey on models and algorithms for discrete evacuation planning network problems
- Abstract flows over time: a first step towards solving dynamic packing problems
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Algorithms for time-dependent bicriteria shortest path problems
- An adaptive discretization algorithm for a class of continuous network programs
- An Algorithm for a Class of Continuous Linear Programs
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- An optimization approach for real time evacuation reroute planning
- An overview of bilevel optimization
- Approximating Earliest Arrival Flows in Arbitrary Networks
- Approximating earliest arrival flows with flow-dependent transit times
- Bi‐level programming based contra flow optimization for evacuation events
- Branch and bound algorithms for the bus evacuation problem
- Cancel-and-tighten algorithm for quickest flow problems
- Combinatorial Algorithms for the Generalized Circulation Problem
- Combinatorial Optimization with Rational Objective Functions
- Complexity analysis for maximum flow problems with arc reversals
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
- Constructing maximal dynamic flows from static flows
- Continuous and discrete flows over time
- Continuous dynamic contraflow approach for evacuation planning
- Continuous time dynamic contraflow models and algorithms
- Continuous-Time Flows in Networks
- Continuous-time shortest path problems with stopping and starting costs
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Dioïds and semirings: Links to fuzzy sets and other applications
- Dynamic network contraflow evacuation planning problem with continuous time approach
- 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
- Earliest arrival flows in networks with multiple sinks
- Earliest arrival flows on series-parallel graphs
- Earliest Arrival Flows with Multiple Sources
- Efficient continuous contraflow algorithms for evacuation planning problems
- Efficient continuous-time dynamic network flow algorithms
- Efficient contraflow algorithms for quickest evacuation planning
- Evacuation network optimization model with Lane-based reversal and routing
- Evacuation planning by earliest arrival contraflow
- Evacuation planning using multiobjective evolutionary optimization approach
- Extreme Points for Continuous Network Programs with Arc Delays
- Fast and simple approximation schemes for generalized flow.
- Faster algorithms for the quickest transshipment problem
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Finding Minimum-Cost Circulations by Successive Approximation
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Flows over Time with Load-Dependent Transit Times
- Generalized max flow in series-parallel graphs
- Generalized Maximum Flows over Time
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 1003275 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 1024734 (Why is no real title available?)
- scientific article; zbMATH DE number 1947425 (Why is no real title available?)
- scientific article; zbMATH DE number 2086912 (Why is no real title available?)
- scientific article; zbMATH DE number 871948 (Why is no real title available?)
- scientific article; zbMATH DE number 934458 (Why is no real title available?)
- scientific article; zbMATH DE number 956788 (Why is no real title available?)
- Incremental network design with maximum flows
- Mathematical models for evacuation planning in urban areas.
- Max flows in O(nm) time, or better
- Maximal Flow Through a Network
- Maximal, Lexicographic, and Dynamic Network Flows
- Minimum Convex Cost Dynamic Network Flows
- Minimum cost dynamic flows: the series-parallel case
- Minimum-cost dynamic flows: The series-parallel case
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- Multicommodity flows over time: Efficient algorithms and complexity
- Multicriteria optimization in humanitarian aid
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- On solving quickest time problems in time-dependent, dynamic networks
- On the minimization of traffic congestion in road networks with tolls
- On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
- On the quickest path problem
- On the use of lexicographic min cost flows in evacuation modeling
- Optimal dynamic routing in communication networks with continuous traffic
- Optimal flows in networks with multiple sources and sinks
- Optimal Time-Varying Flows on Congested Networks
- Optimum flows in general communication networks
- OR/MS research in disaster operations management
- Planning for a bus-based evacuation
- Preface: Multiple criteria optimization and goal programming in science, engineering, and social sciences
- Quickest Flows Over Time
- Relief distribution networks: a systematic review
- Reserving relief supplies for earthquake: a multi-attribute decision making of China Red Cross
- Some Properties of a Class of Continuous Linear Programs
- The building evacuation problem with shared information
- The mixed evacuation problem
- The quickest flow problem
- The quickest path problem
- The quickest transshipment problem
- Time dependency in multiple objective dynamic programming
- Time-varying minimum cost flow problems
- Transient flows in networks
Cited in
(23)- Abstract network flow with intermediate storage for evacuation planning
- Dynamic multicommodity contraflow problem with asymmetric transit times
- Network flow with intermediate storage: models and algorithms
- Priority-oriented route network planning for evacuation in constrained space scenarios
- A survey on models and algorithms for discrete evacuation planning network problems
- Dynamic network flow location models and algorithms for quickest evacuation planning
- Mathematical models for evacuation planning in urban areas.
- Maximum FlowLoc problems with network reconfiguration
- A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
- ENERGY-AWARE NAVIGATION IN LARGE-SCALE EVACUATION USING G-NETWORKS
- FlowLoc problems with maximum excess flow
- <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
- Multi-commodity flow problem on lossy network with partial lane reversals
- Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
- Generalized maximum flow over time with intermediate storage
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- Temporally repeated maximum dynamic flow with intermediate storage
- Maximum flow in hybrid network with intermediate storage
- Network restructuring for dynamic flow improvement
- Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage
- An improved online evacuation strategy from a convex region on grid networks
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)
