A heuristic algorithm for network equilibration

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

doi:10.1016/j.amc.2005.04.094

A heuristic algorithm for network equilibration

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

Research output: Journal article publication › Journal article › Academic research › peer-review

4 Citations (Scopus)

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.

Original language	English
Pages (from-to)	430-446
Number of pages	17
Journal	Applied Mathematics and Computation
Volume	174
Issue number	1
DOIs	https://doi.org/10.1016/j.amc.2005.04.094
Publication status	Published - 1 Mar 2006

Keywords

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

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

More information

10.1016/j.amc.2005.04.094

Cite this

@article{e3e144816c2d4bdaadee774a7a2065e2,

title = "A heuristic algorithm for network equilibration",

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.",

keywords = "Equilibration algorithm, Non-linear programming, Traffic assignment, User-optimized problem",

author = "Xu, {M. H.} and Lam, {Hing Keung William} and H. Shao and Luan, {G. F.}",

year = "2006",

month = mar,

day = "1",

doi = "10.1016/j.amc.2005.04.094",

language = "English",

volume = "174",

pages = "430--446",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - A heuristic algorithm for network equilibration

AU - Xu, M. H.

AU - Lam, Hing Keung William

AU - Shao, H.

AU - Luan, G. F.

PY - 2006/3/1

Y1 - 2006/3/1

N2 - 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.

AB - 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.

KW - Equilibration algorithm

KW - Non-linear programming

KW - Traffic assignment

KW - User-optimized problem

UR - http://www.scopus.com/inward/record.url?scp=33644551566&partnerID=8YFLogxK

U2 - 10.1016/j.amc.2005.04.094

DO - 10.1016/j.amc.2005.04.094

M3 - Journal article

SN - 0096-3003

VL - 174

SP - 430

EP - 446

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 1

ER -

A heuristic algorithm for network equilibration

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this