Efficient contraflow algorithms for quickest evacuation planning

DOI10.1007/s11425-017-9264-3zbMath1402.90026OpenAlexW2885594428MaRDI QIDQ1623855

Hari Nandan Nath, Tanka Nath Dhamala, Urmila Pyakurel

Publication date: 23 November 2018

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-017-9264-3

zbMATH Keywords

evacuation planningquickest flowflow over timecontra flowload dependent transit time

Mathematics Subject Classification ID

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 (9)

Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ 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 ⋮ In memoriam: Urmila Pyakurel (1980--2023) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network flow with intermediate storage: models and algorithms ⋮ Preface ⋮ Efficient algorithms for abstract flow with partial switching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• Approximating earliest arrival flows with flow-dependent transit times
• The quickest path problem
• Complexity analysis for maximum flow problems with arc reversals
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Efficient continuous-time dynamic network flow algorithms
• Continuous time dynamic contraflow models and algorithms
• Evacuation network optimization model with Lane-based reversal and routing
• On solving quickest time problems in time-dependent, dynamic networks
• Evacuation planning by earliest arrival contraflow
• Continuous dynamic contraflow approach for evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• A survey on models and algorithms for discrete evacuation planning network problems
• The Quickest Transshipment Problem
• Finding Minimum-Cost Circulations by Successive Approximation
• Minimum cost time-varying network flow problems
• Combinatorial Optimization with Rational Objective Functions
• The quickest flow problem
• Cancel-and-tighten algorithm for quickest flow problems
• A capacity scaling algorithm for the constrained maximum flow problem
• On the computation of fast data transmissions in networks with capacities and delays
• Flows over Time with Load-Dependent Transit Times
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Time-varying minimum cost flow problems

This page was built for publication: Efficient contraflow algorithms for quickest evacuation planning