A heuristic algorithm for the earliest arrival flow with multiple sources

DOI10.1007/s10852-013-9226-8zbMath1292.65067OpenAlexW2026054600MaRDI QIDQ2016467

Yi-Chang Chiu, Hong Zheng, 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

numerical exampleheuristicsnetwork flowsheuristic algorithmflows over timedynamic flowsearliest arrival flows

Mathematics Subject Classification ID

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

Cites Work

• A survey of dynamic network flows
• Transient flows in networks
• Efficient continuous-time dynamic network flow algorithms
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
• An Introduction to Network Flows over Time
• Earliest Arrival Flows with Multiple Sources
• Optimal dynamic routing in communication networks with continuous traffic
• Auxiliary procedures for solving long transportation problems
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• The quickest flow problem
• Maximal, Lexicographic, and Dynamic Network Flows
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Continuous-Time Flows in Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A heuristic algorithm for the earliest arrival flow with multiple sources