Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17348
Title: A heuristic algorithm for network equilibration
Authors: Xu, MH
Lam, WHK 
Shao, H
Luan, GF
Keywords: Equilibration algorithm
Non-linear programming
Traffic assignment
User-optimized problem
Issue Date: 2006
Publisher: Elsevier
Source: Applied mathematics and computation, 2006, v. 174, no. 1, p. 430-446 How to cite?
Journal: Applied mathematics and computation 
Abstract: 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.
URI: http://hdl.handle.net/10397/17348
ISSN: 0096-3003
EISSN: 1873-5649
DOI: 10.1016/j.amc.2005.04.094
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Feb 9, 2018

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Feb 15, 2018

Page view(s)

44
Last Week
0
Last month
Citations as of Feb 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.