Combinatorial Benders Cuts for the Minimum Tollbooth Problem
成果类型：
Article
署名作者：
Bai, Lihui; Rubin, Paul A.
署名单位：
Valparaiso University; Michigan State University; Michigan State University's Broad College of Business
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1090.0694
发表日期：
2009
页码：
1510-1522
关键词：
摘要：
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.