Skip to main content
Log in

A heuristic method for the minimum toll booth problem

Journal of Global Optimization Aims and scope Submit manuscript

Cite this article


This paper addresses the toll pricing problem in which the objective is to minimize the number of required toll facilities in a traffic network. The problem is shown to be NP-hard. To obtain a solution in a reasonable time, an effective metaheuristic algorithm is developed. The algorithm uses a local search technique in which the neighborhood function employs the dynamic slope scaling procedure to deal with the fixed charge nature of the objective function. Numerical results from 50 randomly generated and three real networks are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions


  1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows, Theory, Algorithm and Applications. Prentice Hall, Upper Saddle River (1993)

    Google Scholar 

  2. Bai L., Hearn D.W., Lawphongpanich S.: Decomposition techniques for the minimum toll revenue problem. Networks 44(2), 142–150 (2004)

    Article  Google Scholar 

  3. Bai L., Rubin P.A.: Combinatorial benders cuts for the minimum tollbooth problem. Oper. Res. 57(6), 1510–1522 (2009)

    Article  Google Scholar 

  4. Bazaraa M.S., Jarvis J.J., Sherali H.D.: Linear Programming and Network Flows. Wiley, Hoboken (1990)

    Google Scholar 

  5. Beckmann M., McGuire C., Winston C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

    Google Scholar 

  6. Costa M.C., Létocart L., Roupin F.: Minimal multicut and maximal integer multiflow: a survey. Eur. J. Oper. Res. 126, 55–69 (2005)

    Article  Google Scholar 

  7. CPLEX: CPLEX Optimization Inc., Incline Village (1996)

  8. DeCorla-Souza, P.: Report to the transportation research board joint subcommittee on pricing. In: 82nd Annual Transportation Research Board Meeting, Washington (2005)

  9. Florian M., Guélat J., Spiess H.: An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem. Networks 17, 319–339 (1987)

    Article  Google Scholar 

  10. Florian M., Hearn D.W.: Network equilibrium models and algorithms. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Handbooks in Operations Research and Management Science, vol. 8: Network Routing, pp. 485–550. North-Holland, New York (1995)

    Google Scholar 

  11. GAMS: General Algebraic Modeling System. GAMS Development Corporation (1995)

  12. Garg, N., Vazirani, V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Proceedings for the 21st International Colloquium on Automata, Languages, and Programming, pp. 487–498, Jerusalem (1994)

  13. Hearn D.W., Lawphongpanich S., Ventura J.: Restricted simplicial decomposition: computation and xtensions. Math. Program. Study 31, 99–118 (1995)

    Google Scholar 

  14. Hearn D.W., Ramana M.: Solving congestion toll pricing models. In: Marcotte, P., Nguyen, S. (eds) Equilibrium and Advanced Transportation Modeling, pp. 109–124. Kluwer, Norwell (1998)

    Google Scholar 

  15. Kim D., Pardalos P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195–203 (1999)

    Article  Google Scholar 

  16. Lawphongpanich S.: Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation. J. Glob. Optim. 35, 121–130 (2006)

    Article  Google Scholar 

  17. LeBlanc L.J., Morlok E.K., Pierskalla W.P.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309–318 (1975)

    Article  Google Scholar 

  18. Mineta N.Y.: National Strategy to Reduce Congestion on America’s Transportation Network. U.S. Department of Transportation, Washington (2006)

    Google Scholar 

  19. Nahapetyan A., Pardalos P.M.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39(1), 37–50 (2008)

    Article  Google Scholar 

  20. Pigou A.C.: The Economics of Welfare. MacMillan, New York (1920)

    Google Scholar 

  21. Schrank, D., Lomax, T.: Urban Mobility Report 2007. Texas Transportation Institute, September 2007. Accessed 1 May 2008

  22. Todd, J.: Duke Student Math Aims to Alleviate Tollbooth Lines. Duke University News and Communications, June 2005. Accessed 1 May 2008

  23. Verhoef E.: Second-best congestion pricing in general networks: heuristic algorithms for finding second-best optimal toll levels and toll points. Transp. Res. B. 36, 707–729 (2002)

    Article  Google Scholar 

  24. Yang H., Zhang X.: Optimal toll design in second-best link-based congestion pricing. J. Transp. Res. Board Transp. Res. Rec. 1857, 85–92 (2003)

    Article  Google Scholar 

  25. Yildirim M.B., Hearn D.W.: A toll pricing framework for traffic assignment problems with elastic demand. In: Gendreau, M., Marcotte, P. (eds) Current Trends in Transportation and Network Analysis: Papers in honor of Michael Florian, pp. 135–145. Kluwer, Norwell (2002)

    Google Scholar 

  26. Yildirim M.B., Hearn D.W.: A first best toll pricing framework for variable demand traffic assignment problems. Transp. Res. B. 39, 659–678 (2005)

    Article  Google Scholar 

  27. Zhang X., Yang H.: The optimal cordon-based network congestion pricing problem. Transp. Res. B. 38, 517–537 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Lihui Bai.

Additional information

This research was partially supported by NSF grants DMI-9978642, DMI-0300316 and CMS grant #2008-06.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bai, L., Hearn, D.W. & Lawphongpanich, S. A heuristic method for the minimum toll booth problem. J Glob Optim 48, 533–548 (2010).

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: