Combinatorial Benders Cuts for the Minimum Tollbooth Problem

Lihui Bai () and Paul A. Rubin ()
Additional contact information
Lihui Bai: College of Business Administration, Valparaiso University, Valparaiso, Indiana 46383
Paul A. Rubin: The Eli Broad Graduate School of Management, Michigan State University, East Lansing, Michigan 48824

Operations Research, 2009, vol. 57, issue 6, 1510-1522

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 (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1090.0694 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:57:y:2009:i:6:p:1510-1522

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().