A heuristic algorithm for the earliest arrival flow with multiple sources
DOI10.1007/S10852-013-9226-8zbMATH Open1292.65067OpenAlexW2026054600MaRDI QIDQ2016467FDOQ2016467
Authors: Hong Zheng, Yi-Chang Chiu, Pitu B. Mirchandani 
Publication date: 20 June 2014
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-013-9226-8
Recommendations
- Earliest arrival flows in networks with multiple sinks
- Earliest arrival flows in networks with multiple sinks
- Earliest Arrival Flows with Multiple Sources
- A heuristic solution procedure for multicommodity integer flows
- Approximating Earliest Arrival Flows in Arbitrary Networks
- A Heuristic Procedure For Path Location With Multisource Demand
- The multi terminal \(q\)-FlowLoc problem: a heuristic
- An Heuristic Method for Solving Time-Sensitive Routeing Problems
- A heuristic algorithm for minimizing mean flow time with unit setups
- Approximating earliest arrival flows with flow-dependent transit times
heuristicsnetwork flowsnumerical exampleheuristic algorithmflows over timedynamic flowsearliest arrival flows
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- A linear programming model for the single destination system optimum dynamic traffic assignment problem
- Continuous-Time Flows in Networks
- Efficient continuous-time dynamic network flow algorithms
- The quickest flow problem
- Transient flows in networks
- Faster algorithms for the quickest transshipment problem
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Title not available (Why is that?)
- Earliest Arrival Flows with Multiple Sources
- Constructing maximal dynamic flows from static flows
- Title not available (Why is that?)
- An introduction to network flows over time
- A survey of dynamic network flows
- Title not available (Why is that?)
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Optimal dynamic routing in communication networks with continuous traffic
- Title not available (Why is that?)
- The quickest transshipment problem
- Maximal, Lexicographic, and Dynamic Network Flows
- Quickest Flows Over Time
- A bad network problem for the simplex method and other minimum cost flow algorithms
- Title not available (Why is that?)
- Auxiliary procedures for solving long transportation problems
Cited In (2)
This page was built for publication: A heuristic algorithm for the earliest arrival flow with multiple sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016467)
