Combinatorial benders cuts for the minimum tollbooth problem

Operations Research

Volumn 57, Issue 6, 2009, Pages 1510-1522

  Bai, Lihui ^a   Rubin, Paul A ^b  

^a VALPARAISO UNIVERSITY   (United States)

^b MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL STUDIES; MEDIUM SIZE; MIXED-INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; REAL NETWORKS; SOLUTION METHODS; TOLL PRICING; TRANSPORTATION NETWORK;

INTEGER PROGRAMMING;

EID: 73649130965     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0694     Document Type: Article

References (27)

1. Arnott, R. J., K. A. Small. 1994. The economics of traffic congestion. Amer. Scientist 82 446-455.
2. Bai, L. 2004. Computational methods for toll pricing models. Ph.D. thesis, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
3. Bai, L., D. W. Hearn, S. Lawphongpanich. 2004. Decomposition techniques for the minimum toll revenue problem. Networks 44(2) 142-150.
4. Bai, L., D. W. Hearn, S. Lawphongpanich. 2006. Toll set relaxations for large-scale transportation toll pricing problems. D. W. Hearn, S. Lawphongpanich, M. J. Smith, eds. Mathematical and Computational Models for Congestion Charging. Springer, New York, 23-44.
5. Bazaraa, M. S., J. J. Jarvis, H. D. Sherali. 1990. Linear Programming and Network Flows, 2nd ed. Wiley, New York.
6. Beckmann, M. J., C. B. McGuire, C. B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press, New Haven, CT.
7. Benders, J. F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4 238-252.
8. Bergendorff, P., D. W. Hearn, M. V. Ramana. 1997. Congestion toll pricing of traffic networks. P. M. Pardalos, D. W. Hearn, W. W. Hager, eds. Network Optimization. Lecture Notes in Economics and Mathematics. Springer, New York, 51-71.
9. Cherkassky, B. V., A. V. Goldberg. 1996. Negative-cycle detection algorithms. J. Diaz, M. Serna, eds. Algorithms-ESA '96: Fourth Annual Eur. Sympos., Barcelona, Spain. Lecture Notes in Computer Science. Springer, Berlin, 349-363.
10. Codato, G., M. Fischetti. 2006. Combinatorial Benders' cuts for mixed-integer linear programming. Oper. Res. 54(4) 756-766.
11. Dawson, J. A. L., F. N. Brown. 1985. Electronic road pricing in Hong Kong 1: A fair way to go? Traffic Engrg. Control 26(11) 522-529.
12. DeCorla-Souza, P. T. 2003. Report to the Transportation Research Board Joint Subcommittee on Pricing. 82nd Annual Transportation Research Board Meeting, Washington, DC.
13. Fischetti, M., D. Salvagnin, A. Zanette. 2008. Minimal infeasible subsystems and Benders cuts. Technical report, University of Padua, Padua, Italy.
14. Florian, M., D. W. Hearn. 1995. Network equilibrium models and algorithms. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science: Network Routing, Vol. 8. North-Holland, New York, 485-550.
15. Florian, M., J. Guélat, H. Spiess. 1987. An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem. Networks 17 319-339.
16. Gleeson, J., J. Ryan. 1990. Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1) 61-63.
17. Hearn, D. W., M. V. Ramana. 1998. Solving congestion toll pricing models. P. Marcotte, S. Nguyen, eds. Equilibrium and Advanced Transportation Modeling. Kluwer Academic Publishers, Norwell, MA, 109-124.
18. ILOG, Inc. 2007. ILOG CPLEX 10.2 Reference Manual and Software. Sunnyvale, CA.
19. Lawphongpanich, S., D. W. Hearn. 2004. An MPEC approach to second best toll pricing. Math. Programming Ser. B 101 33-55.
20. LeBlanc, L. J., E. K. Morlok, W. P. Pierskalla. 1975. An efficient approach to solving the road network equilibrium traffic assignment problem. Transportation Res. 9 309-318.
21. Menon, G. A. P. 2000. ERP in Singapore - A perspective one year on. Traffic Engrg. Control 41(2) 40-45.
22. Parker, M., J. Ryan. 1996. Finding the minimum weight IIS cover of an infeasible system of linear inequalities. Ann. Math. Artificial Intelligence 17 107-126.
23. Pigou, A. C. 1920. The Economics of Welfare. Macmillan, New York.
24. Richards, M., C. Gilliam, J. Larkinson. 1996. The London congestion charging research programme: 6. The finding. Traffic Engrg. Control 37(7/8) 436-441.
25. Tarjan, R. E. 1981. Shortest paths. Technical report, Bell Laboratories, Murray Hill, NJ.
26. Todd, J. 2005. Duke student math aims to alleviate tollbooth lines. Duke University News and Communications, Durham, NC. http://www.dukenews.duke.edu/ 2005/06/tollbooths.html.
27. Verhoef, E. T. 2002. Second-best congestion pricing in general networks: Heuristic algorithms for finding second-best optimal toll levels and toll points. Transportation Res. B 36B 707-729.