Article ID: | iaor200973332 |
Volume: | 57 |
Issue: | 6 |
Start Page Number: | 1510 |
End Page Number: | 1522 |
Publication Date: | Nov 2009 |
Journal: | Operations Research |
Authors: | Bai Lihui, Rubin Paul A |
Keywords: | programming: integer |
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.