Combinatorial Benders Cuts for the Minimum Tollbooth Problem

We address a toll pricing problem in which the objective is to minimize the number of required toll facilities in a transportation network while inducing drivers to make the most efficient collective use of the network. We formulate the problem as a mixed-integer programming model and propose a solution method using combinatorial Benders cuts. Computational study of real networks as well as randomly generated networks indicates that our proposed method is efficient in obtaining provably optimal solutions for networks with small to medium sizes.

[1]  Andrew V. Goldberg,et al.  Negative-Cycle Detection Algorithms , 1996, ESA.

[2]  Erik T. Verhoef,et al.  SECOND-BEST CONGESTION PRICING IN GENERAL NETWORKS. HEURISTIC ALGORITHMS FOR FINDING SECOND-BEST OPTIMAL TOLL LEVELS AND TOLL POINTS , 2002 .

[3]  T. Koopmans,et al.  Studies in the Economics of Transportation. , 1956 .

[4]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[5]  Apg Menon,et al.  ERP IN SINGAPORE - A PERSPECTIVE ONE YEAR ON , 2000 .

[6]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

[7]  Donald W. Hearn,et al.  An MPEC approach to second-best toll pricing , 2004, Math. Program..

[8]  Patrick De Corla-Souza,et al.  Mainstreaming Pricing Alternatives in the Project Development Process , 2003 .

[9]  C Gilliam,et al.  The London Congestion Charging Research Programme. 6. The findings , 1996 .

[10]  D. Hearn,et al.  Congestion Toll Pricing of Traffic Networks , 1997 .

[11]  Michael Florian,et al.  An efficient implementation of the "partan" variant of the linear approximation method for the network equilibrium problem , 1987, Networks.

[12]  J. Dawson,et al.  ELECTRONIC ROAD PRICING IN HONG KONG. 1. A FAIR WAY TO GO , 1985 .

[13]  A. C. Pigou.  Economics of welfare , 1920 .

[14]  Jennifer Ryan,et al.  Identifying Minimally Infeasible Subsystems of Inequalities , 1990, INFORMS J. Comput..

[15]  Larry J. LeBlanc,et al.  AN EFFICIENT APPROACH TO SOLVING THE ROAD NETWORK EQUILIBRIUM TRAFFIC ASSIGNMENT PROBLEM. IN: THE AUTOMOBILE , 1975 .

[16]  Donald W. Hearn,et al.  Decomposition techniques for the minimum toll revenue problem , 2004, Networks.

[17]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[18]  K. Small,et al.  The Economics Of Traffic Congestion , 1993 .

[19]  C Gilliam,et al.  THE LONDON CONGESTION CHARGING RESEARCH PROGRAMME (III). , 1996 .

[20]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

[21]  Donald W. Hearn,et al.  Relaxed Toll Sets for Congestion Pricing Problems , 2006 .

[22]  Jennifer Ryan,et al.  Finding the minimum weight IIS cover of an infeasible system of linear inequalities , 1996, Annals of Mathematics and Artificial Intelligence.