Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs

作者:

Highlights:

摘要

In this paper, we present an algorithm for solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs. The path cost function considered is comprised of two attributes, travel time and toll, that are combined into a nonlinear generalized cost. Travel demand is determined endogenously according to a travel disutility function. Travelers choose routes with the minimum overall generalized costs. The algorithm involves two components: a bicriteria shortest path routine to implicitly generate the set of non-dominated paths and a projection and contraction method to solve the nonlinear complementarity problem (NCP) describing the traffic equilibrium problem. Numerical experiments are conducted to demonstrate the feasibility of the algorithm to this class of traffic equilibrium problems.

论文关键词:Traffic equilibrium,Nonlinear complementarity problem,Bicriteria shortest path

论文评审过程:Available online 18 August 2010.

论文官网地址:https://doi.org/10.1016/j.amc.2010.08.035