A heuristic algorithm for network equilibration

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. (c) 2005 Elsevier Inc. All rights reserved.