BENEFIT DISTRIBUTION AND EQUITY IN ROAD NETWORK DESIGN PROBLEMS.

Abstract In the classical continuous network design problem, the optimal capacity enhancements are determined by minimizing the total system cost under a budget constraint, while taking into account the route choice behavior of network users. Generally the equilibrium origin–destination travel costs for some origin–destination (O–D) pairs may be increased after implementing these optimal capacity enhancements, leading to positive or negative results for network users. Therefore, the equity issue about the benefit gained from the network design problem is raised. In this paper, we examine the benefit distribution among the network users and the resulting equity associated with the continuous network design problem in terms of the change of equilibrium O–D travel costs. Bilevel programming models that incorporate the equity constraint are proposed for the continuous network design problem. A penalty function approach by embodying a simulated annealing method is used to test the models for a network example.

[1]  Michael Athans,et al.  Perturbation strategies for optimal traffic reassignment , 1979 .

[2]  Yosef Sheffi,et al.  Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods , 1985 .

[3]  T. Friesz,et al.  The multiobjective equilibrium network design problem revisited: A simulated annealing approach , 1993 .

[4]  Thomas L. Magnanti,et al.  Sensitivity Analysis for Variational Inequalities Defined on Polyhedral Sets , 1989, Math. Oper. Res..

[5]  Alexander H. G. Rinnooy Kan,et al.  Stochastic methods for global optimization , 1984 .

[6]  Hai Yang,et al.  An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem , 2001 .

[7]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[8]  Stella Dafermos,et al.  Traffic Equilibrium and Variational Inequalities , 1980 .

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Subhash Narula,et al.  The Current State of Nonlinear Multiple Criteria Decision Making , 1991 .

[11]  Larry J. LeBlanc,et al.  CONTINUOUS EQUILIBRIUM NETWORK DESIGN MODELS , 1979 .

[12]  Terry L. Friesz,et al.  Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints , 1990, Math. Program..

[13]  P. Marcotte.  Network Optimization with Continuous Control Parameters , 1983 .

[14]  Andrew E. W. Jones,et al.  An adaptive simulated annealing algorithm for global optimization over continuous variables , 1995, J. Glob. Optim..

[15]  Reuven Y. Rubinstein,et al.  Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.

[16]  Larry J. LeBlanc,et al.  An Algorithm for the Discrete Network Design Problem , 1975 .

[17]  Robert L. Smith,et al.  Simulated annealing for constrained global optimization , 1994, J. Glob. Optim..

[18]  Michael Athans,et al.  HYBRID OPTIMIZATION IN URBAN TRAFFIC NETWORKS , 1979 .

[19]  Gary A. Davis,et al.  Exact local solution of the continuous network design problem via stochastic user equilibrium assignment , 1994 .

[20]  Terry L. Friesz,et al.  Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem , 1987, Transp. Sci..

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  Hai Yang,et al.  Models and algorithms for road network design: a review and some new developments , 1998 .

[23]  Steven G. Louie,et al.  A Monte carlo simulated annealing approach to optimization over continuous variables , 1984 .

[24]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[25]  Terry L. Friesz,et al.  A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..

[26]  Patrice Marcotte,et al.  Efficient implementation of heuristics for the continuous network design problem , 1992, Ann. Oper. Res..

[27]  M. Turnquist,et al.  Approximate algorithms for the discrete network design problem , 1982 .

[28]  C S Fisk.  OPTIMAL SIGNAL CONTROLS ON CONGESTED NETWORKS , 1984 .

[29]  David E. Boyce,et al.  A discrete transportation network design problem with combined trip distribution and assignment , 1980 .

[30]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[31]  Th. G. Scholte.  On the Reaction Field of Polar Liquids , 1953 .