A heuristic method for the minimum toll booth problem

Journal of Global Optimization

Volumn 48, Issue 4, 2010, Pages 533-548

  Bai, Lihui ^b   Hearn, Donald W ^a   Lawphongpanich, Siriphong ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^b NONE

Author keywords

Congestion pricing; Dynamic slope scaling; Traffic equilibrium

Indexed keywords

CONGESTION PRICING; FIXED CHARGES; LOCAL SEARCH TECHNIQUES; META HEURISTIC ALGORITHM; NEIGHBORHOOD FUNCTION; NP-HARD; NUMERICAL RESULTS; OBJECTIVE FUNCTIONS; REAL NETWORKS; SCALING PROCEDURES; TOLL PRICING; TRAFFIC EQUILIBRIUM; TRAFFIC NETWORKS;

HEURISTIC METHODS; HIGHWAY TRAFFIC CONTROL; NETWORK ROUTING;

TRAFFIC CONGESTION;

EID: 78149279750     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9527-7     Document Type: Article

References (27)

1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows, Theory, Algorithm and Applications. Prentice Hall, Upper Saddle River (1993)
2. L. Bai D.W. Hearn S. Lawphongpanich 2004 Decomposition techniques for the minimum toll revenue problem Networks 44 2 142 150 10.1002/net.20024
3. L. Bai P.A. Rubin 2009 Combinatorial benders cuts for the minimum tollbooth problem Oper. Res. 57 6 1510 1522 10.1287/opre.1090.0694
4. Bazaraa M.S., Jarvis J.J., Sherali H.D.: Linear Programming and Network Flows. Wiley, Hoboken (1990)
5. Beckmann M., McGuire C., Winston C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
6. M.C. Costa L. Létocart F. Roupin 2005 Minimal multicut and maximal integer multiflow: a survey Eur. J. Oper. Res. 126 55 69 10.1016/j.ejor.2003. 10.037
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. M. Florian 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 10.1002/net.3230170307
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)
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. D.W. Hearn S. Lawphongpanich J. Ventura 1995 Restricted simplicial decomposition: computation and xtensions Math. Program. Study 31 99 118
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)
15. D. Kim P.M. Pardalos 1999 A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure Oper. Res. Lett. 24 4 195 203 10.1016/S0167-6377(99)00004-8
16. S. Lawphongpanich 2006 Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation J. Glob. Optim. 35 121 130 10.1007/s10898-005-1383-5
17. L.J. LeBlanc E.K. Morlok W.P. Pierskalla 1975 An efficient approach to solving the road network equilibrium traffic assignment problem Transp. Res. 9 309 318 10.1016/0041-1647(75)90030-1
18. Mineta N.Y.: National Strategy to Reduce Congestion on America's Transportation Network. U.S. Department of Transportation, Washington (2006)
19. A. Nahapetyan P.M. Pardalos 2008 Adaptive dynamic cost updating procedure for solving fixed charge network flow problems Comput. Optim. Appl. 39 1 37 50 10.1007/s10589-007-9060-x
20. Pigou A.C.: The Economics of Welfare. MacMillan, New York (1920)
21. Schrank, D., Lomax, T.: Urban Mobility Report 2007. Texas Transportation Institute, September 2007. http://mobility.tamu.edu. Accessed 1 May 2008
22. Todd, J.: Duke Student Math Aims to Alleviate Tollbooth Lines. Duke University News and Communications, June 2005. http://www.dukenews.duke.edu/ 2005/06/tollbooths.html. Accessed 1 May 2008
23. E. Verhoef 2002 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 10.1016/S0191-2615(01)00025-X
24. H. Yang X. Zhang 2003 Optimal toll design in second-best link-based congestion pricing J. Transp. Res. Board Transp. Res. Rec. 1857 85 92 10.3141/1857-10
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)
26. M.B. Yildirim D.W. Hearn 2005 A first best toll pricing framework for variable demand traffic assignment problems Transp. Res. B. 39 659 678 10.1016/j.trb.2004.08.001
27. X. Zhang H. Yang 2004 The optimal cordon-based network congestion pricing problem Transp. Res. B. 38 517 537 10.1016/j.trb.2003.08.001