A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs

Anthony Chen, Hong K. Lo, Hai Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

55 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)27-41
Number of pages15
JournalEuropean Journal of Operational Research
Issue number1
Publication statusPublished - 16 Nov 2001
Externally publishedYes


  • Mathematical programming
  • Traffic equilibrium
  • Transportation

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this