## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 3020-3031 |

Number of pages | 12 |

Journal | Applied Mathematics and Computation |

Volume | 217 |

Issue number | 7 |

DOIs | |

State | Published - 1 Dec 2010 |

## Keywords

- Bicriteria shortest path
- Nonlinear complementarity problem
- Traffic equilibrium