Name
Title | ||
|---|---|---|
A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs |
Abstract | ||
|---|---|---|
This paper considers solving a special case of the nonadditive traffic equilibrium problem presented by Gabriel and Bernstein [Transportation Science 31 (4) (1997) 337–348] in which the cost incurred on each path is made up of the sum of the arc travel times plus a path-specific cost for traveling on that path. A self-adaptive projection and contraction method is suggested to solve the path-specific cost traffic equilibrium problem, which is formulated as a nonlinear complementarity problem (NCP). The computational effort required per iteration is very modest. It consists of only two function evaluations and a simple projection on the nonnegative orthant. A self-adaptive technique is embedded in the projection and contraction method to find suitable scaling factor without the need to do a line search. The method is simple and has the ability to handle a general monotone mapping F. Numerical results are provided to demonstrate the features of the projection and contraction method. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0377-2217(00)00287-3 | European Journal of Operational Research |
Keywords | Field | DocType |
Transportation,Traffic equilibrium,Mathematical programming | Scale factor,Mathematical optimization,Orthant,Assignment problem,Line search,Mixed complementarity problem,Monotone polygon,Mathematics,Special case,Nonlinear complementarity problem | Journal |
Volume | Issue | ISSN |
135 | 1 | 0377-2217 |
Citations | PageRank | References |
12 | 1.00 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony Chen | 1 | 209 | 18.25 |
| Hong K. Lo | 2 | 147 | 21.45 |
| Hai Yang | 3 | 721 | 48.63 |