A heuristic algorithm for the earliest arrival flow with multiple sources

Hong Zheng, Yi Chang Chiu, Pitu B. Mirchandani

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


This paper presents a heuristic algorithm for the earliest arrival flow problem. Existing exact algorithms, even polynomial in the output size, contain submodular function optimization as a frequently called subroutine, and thus are not practical in real-life applications. In this paper we propose an algorithm that does not involve the submodular function optimization. Although solving an EAF nearoptimal, the algorithm is remarkably simple and efficient as it only involves shortest path computations on a static network. A numerical example illustrates how the algorithm works. As an application, we demonstrate the algorithm’s solution quality and computational performance by solving a real-size network.

Original languageEnglish (US)
Article numberA004
Pages (from-to)169-189
Number of pages21
JournalJournal of Mathematical Modelling and Algorithms
Issue number2
StatePublished - Jun 2014


  • Dynamic flows
  • Earliest arrival flows
  • Flows over time
  • Heuristics
  • Network flows

ASJC Scopus subject areas

  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'A heuristic algorithm for the earliest arrival flow with multiple sources'. Together they form a unique fingerprint.

Cite this