Combinatorial Benders Cuts for the Minimum Tollbooth Problem
Operations Research · 2009 · Volume 57 · Issue 6
Abstract
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.
Keywords
congestion pricing, traffic equilibrium, Benders decomposition, branch and cut, mixed-integer program
Enable JavaScript for citation tools and additional paper interactions.