A heuristic algorithm for the earliest arrival flow with multiple sources

DOI10.1007/S10852-013-9226-8MaRDI QIDQ2016467zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicsnetwork flowsnumerical exampleheuristic algorithmflows over timedynamic flowsearliest arrival flows

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

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

Cites work

• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 5772890 (Why is no real title available?)
• scientific article; zbMATH DE number 2086912 (Why is no real title available?)
• scientific article; zbMATH DE number 2119659 (Why is no real title available?)
• A bad network problem for the simplex method and other minimum cost flow algorithms
• A linear programming model for the single destination system optimum dynamic traffic assignment problem
• A survey of dynamic network flows
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• An introduction to network flows over time
• Auxiliary procedures for solving long transportation problems
• Constructing maximal dynamic flows from static flows
• Continuous-Time Flows in Networks
• Earliest Arrival Flows with Multiple Sources
• Efficient continuous-time dynamic network flow algorithms
• Faster algorithms for the quickest transshipment problem
• Maximal, Lexicographic, and Dynamic Network Flows
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• Optimal dynamic routing in communication networks with continuous traffic
• Quickest Flows Over Time
• The quickest flow problem
• The quickest transshipment problem
• Transient flows in networks

Cited in

(2)

• Earliest arrival flows on series-parallel graphs
• Earliest Arrival Flows with Multiple Sources

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)