A heuristic algorithm for network equilibration

M. H. Xu, Hing Keung William Lam, H. Shao, G. F. Luan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


In this paper, a heuristic algorithm, different from the Frank-Wolfe and its modified methods, is introduced for network equilibration. By using the column generation technique and the network equilibrium conditions, the new method need not enumerate initially all feasible paths for all origin/destination (O/D) pairs, but can give all paths used between each O/D pair and the path flows accordingly while the new algorithm obtains an optimal traffic assignment. Some convergence issues of the new method is discussed in this paper. Numerical experiments show that the new method is efficient and robust.
Original languageEnglish
Pages (from-to)430-446
Number of pages17
JournalApplied Mathematics and Computation
Issue number1
Publication statusPublished - 1 Mar 2006


  • Equilibration algorithm
  • Non-linear programming
  • Traffic assignment
  • User-optimized problem

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'A heuristic algorithm for network equilibration'. Together they form a unique fingerprint.

Cite this