On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks

  title={On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks},
  author={Elise Miller-Hooks and Sarah Stock Patterson},
  journal={Journal of Mathematical Modelling and Algorithms},
In this paper, a pseudopolynomial time algorithm is presented for solving the integral time-dependent quickest flow problem (TDQFP) and its multiple source and sink counterparts: the time-dependent evacuation and quickest transshipment problems. A more widely known, though less general version, is the quickest flow problem (QFP). The QFP has historically been defined on a dynamic network, where time is divided into discrete units, flow moves through the network over time, travel times determine… 
Quickest Flow Algorithms with Time-Varying Attributes
This paper considers single-source single-sink discrete-time dynamic network flow problems, where quickest flow models allow the estimation of the minimum time required to bring a given number of evacuees to safety.
Updating Paths in Time-Varying Networks Given Arc Weight Changes
The proposed reoptimization techniques can provide updated solutions given simultaneous and arbitrary changes (increasing and decreasing in value) in any number of network arcs and can be extended for use in stochastic networks.
The Quick Time Dependent Quickest Flow Problem: A Lesson in Zero-Sum Cycles
A heuristic that can be embedded in the reoptimization algorithm to provide path solutions in the presence of zero-sum cycles has been proposed and provided an optimal solution nearly 100% of the times.
Minimum Flows in Parametric Dynamic Networks. The Static Approach
This article presents and solves the problem of the minimum flows in a parametric dynamic network in the reduced expended network which is obtained by expanding the original dynamic network.
Maximal Dynamic Expected Flows Problem for Emergency Evacuation Planning
A metaheuristic based on the principles of noisy genetic algorithms is proposed for its solution, which results in robust evacuation paths that are likely to save the largest number of people before conditions become untenable.
Efficient contraflow algorithms for quickest evacuation planning
This paper sketches the state of quickest flow solutions and solves the quickest contraflow problem with constant transit times on arcs proving that the problem can be solved in strongly polynomial time O(nm2(log n)2), where n and m are number of nodes and number of arcs, respectively in the network.
Minimum parametric flow in time-dependent dynamic networks
This approach solves the problem for a special parametric dynamic network with linear lower bound functions of a single parameter by implementing a labelling algorithm which works in the parametricynamic residual network where repeatedly decreases the flow along quickest dynamic source-sink paths for different subintervals of parameter values, in their increasing order.
Minimum cost time-varying network flow problems
An algorithm of time complexity O(V nT(n+T)) is presented, where V is an upper bound on the total supply, n is the number of nodes, and T denotes the given time horizon of the dynamic flow problem.
The article presents the maximum parametric flow problem in discrete dynamic networks with linear capacities and zero lower bounds. Based on an approach of partitioning the values range of the
Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes
This work was motivated by the need for the real-time provision of evacuation instructions to people seeking quick egress from a large sensor-equipped building that has come under attack by natural or terrorist forces, but has broad applicability.


“The quickest transshipment problem”
The first polynomial-time algorithm for the quickest transshipment problem, which provides an integral optimum flow and is commonly used to model building evacuation.
Efficient dynamic network flow algorithms
This thesis introduces the first polynomial algorithms to solve several important dynamic network flow problems by computing chain-decomposable flows, a new class of structured dynamic flows and describes the firstPolynomial algorithm to approximate a universally maximum dynamic flow within a factor of (1 + $\epsilon$), for any $\epSilon>0$.
A Study of General Dynamic Network Programs with Arc Time-Delays
  • M. Pullan
  • Mathematics, Computer Science
    SIAM J. Optim.
  • 1997
A continuous-time model for a very broad class of dynamic network problems with arc time-delays and is called SCLPTD, which includes a characterization of the extreme-point solutions, an existence theorem for piecewise analytic optimal extreme- point solutions, and a strong duality theorem.
Minimum Cost Dynamic Flows: The Series-Parallel Case
A greedy algorithm is formulated for MCDFP and a full characterization via forbidden subgraphs of the class G of graphs is provided, for which this greedy algorithm always yields an optimum solution (for arbitrary choices of problem parameters).
The quickest flow problem
It is shown that the quickest flow problem is closely related to the maximum dynamic flow problem and to linear fractional programming problems, and several polynomial algorithms and a stronglyPolynomial algorithm are developed.
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
A single-source single-sink dynamic network is considered where the link flows are real-valued measurable functions defined on a time interval and where storage is allowed at the nodes and an algorithm is presented which computes an optimal flow in O( | N | 4T4) time.
Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time
A new and simple solution algorithm is proposed for all-to-one, all departure time intervals, shortest paths problems and it is proved, theoretically, that the new solution algorithm has an optimal run time complexity that equals the complexity of the problem.
Time-varying minimum cost flow problems
Note—Some Equivalent Objectives for Dynamic Network Flow Problems
The purpose of this note is to demonstrate that it is possible to satisfy at least three important objectives simultaneously in a maximal dynamic network flow problem.
A continuous-time network simplex algorithm
This work describes an algorithm, which is a continuuous-time version of the network simplex algorithm, that solves the minimum-cost network flow problem of finding flows which satisfy a flow-conservation constraint at each node and minimize the total cost of the flow.