Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach

DOI10.1007/s12597-023-00690-9OpenAlexW4386392753MaRDI QIDQ6191698

Hari Nandan Nath, Stephan Dempe, Tanka Nath Dhamala

Publication date: 11 March 2024

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-023-00690-9

zbMATH Keywords

network flowquickest flowdynamic flowBicriteria optimizationcontraflow

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) Operations research and management science (90Bxx)

Cites Work

• 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
• Complexity analysis for maximum flow problems with arc reversals
• Efficient continuous-time dynamic network flow algorithms
• Efficient contraflow algorithms for quickest evacuation planning
• Linearization of mixed-integer products
• Partial contraflow with path reversals for evacuation planning
• Dynamic network flow location models and algorithms for quickest evacuation planning
• An Introduction to Network Flows over Time
• The Multi Terminal q-FlowLoc Problem: A Heuristic
• Earliest Arrival Flows with Multiple Sources
• The quickest flow problem
• Cancel-and-tighten algorithm for quickest flow problems
• A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
• Multicriteria Optimization
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach