A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow

DOI10.1142/S0217595921500275MaRDI QIDQ5092549zbMATH OpenOpenAlexFDO

Authors Hari Nandan Nath, Stephan Dempe, Tanka Nath Dhamala

Publication date 22 July 2022

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595921500275

zbMATH Keywords

bicriteria optimizationcontraflowdynamic flowmulticriteria optimizationnetwork flow

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 4179156
• A parametric approach to the Bi-Criteria minimum cost dynamic flow problem
• A parametric approach to solving bicriterion shortest path problems
• Efficient solutions for the bicriteria network flow problem
• scientific article; zbMATH DE number 1057915
• A multicriteria Pareto-optimal path algorithm
• A path-based solution algorithm for dynamic traffic assignment
• scientific article; zbMATH DE number 3858801
• An iterative solution approach for a bi-level optimization problem for congestion avoidance on road networks
• Efficient solution generation for the bicriterion shortest path problems

Cites work

• A critical survey on the network optimization algorithms for evacuation planning problems
• An introduction to network flows over time
• Complexity analysis for maximum flow problems with arc reversals
• Constructing maximal dynamic flows from static flows
• Continuous time dynamic contraflow models and algorithms
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient continuous-time dynamic network flow algorithms
• Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
• Multicriteria Optimization
• Network flows. Theory, algorithms, and applications.
• Partial contraflow with path reversals for evacuation planning
• Scheduling arc maintenance jobs in a network to maximize total flow over time

Cited in

(3)

• Optimizing Contraflow Scheduling Problem: Model and Algorithm
• Lexicographic maximum flow allowing intermediate storage
• Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach

This page was built for publication: A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092549)