Abstract
This paper looks at the first and second best jointly optimal toll and road capacity investment problems from both policy and technical oriented perspectives. On the technical side, the paper investigates the applicability of the constraint cutting algorithm for solving the second best problem under elastic demand which is formulated as a bilevel programming problem. The approach is shown to perform well despite several problems encountered by our previous work in Shepherd and Sumalee (Netw. Spat. Econ., 4(2): 161–179, 2004). The paper then applies the algorithm to a small sized network to investigate the policy implications of the first and second best cases. This policy analysis demonstrates that the joint first best structure is to invest in the most direct routes while reducing capacities elsewhere. Whilst unrealistic this acts as a useful benchmark. The results also show that certain second best policies can achieve a high proportion of the first best benefits while in general generating a revenue surplus. We also show that unless costs of capacity are known to be low then second best tolls will be affected and so should be analysed in conjunction with investments in the network.
Similar content being viewed by others
Notes
Whilst Verhoef and Rowendal (2004) have successfully employed the same approach for a simple 3 link network they also encountered problems with the stability of this algorithm. In particular they stated that “a pragmatic trial-and-error approach was employed, where the trade-off concerned speed of convergence on the one hand and instability of the convergence process on the other…. Instability was particularly relevant for sets of policy instruments including both taxes and capacities” (Verhoef and Rowendal 2004, p. 421).
The attractiveness of capacity investment depends on, among other things, the elasticity of demand (d’Ouville and MacDonald 1990). If demand is very elastic (elasticity > 1), then induced traffic undermines the potential benefits from capacity investment if tolls are not present and optimal capacity could then be higher with tolls than without.
While the network we have used comprises only 18 links and 3 OD pairs, the CCA solving the second best toll only pricing problem has already been tested on a much larger network of Hull, Canada with 798 links and 158 OD pairs. For details see Lawphongpanich and Hearn (2004).
We emphasize that the costs of capacity provision in Eq. 1 includes the cost of maintenance discounted over its useful life. It is this cost saving that translates into actual savings.
References
Allsop, R.E.: Some possibilities for using traffic control to influence trip distribution and route choice. In: Buckley, D.J. (eds.) Proceeding of the 6th International Symposium on Transportation and Traffic Theory, pp. 345–374. Elsevier, New York (1974)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, Hoboken, New Jersey (2006)
Ben-Ayed, O., Boyce, D.E., Blair III, C.E.: A general bilevel linear programming formulation of the network design problem. Transp. Res. 22B(4), 311–318 (1988)
Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transp. Sci. 39(4), 446–450 (2005)
d’Ouville, E.L., McDonald, J.F.: Optimal road capacity with a suboptimal congestion toll. J. Urban Econ. 28(1), 24–49 (1990)
De Borger, B., Proost, S.: Reforming transport pricing in the European Union. Edward Elgar, Cheltenham, UK (2001)
Friesz, T.L., Tobin, R.L., Cho, H.J., Mehta, N.J.: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints. Math. Program. 48(2), 265–284 (1990)
Hau, T.D.: Economic Fundamentals of Road Pricing: A Diagrammatic Analysis. World Bank Policy Research Working Paper Series, 1070 (1992)
Hearn, D.W., Lawphongpanich, S., Ventura, J.A.: Restricted simplicial decomposition: computation and extensions. Math. Program. Study 31, 99–118 (1987)
Lawphongpanich, S., Hearn, D.W.: An MPEC approach to second best toll pricing. Math. Program. 101B(1), 33–55 (2004)
Marcotte, P.: Network design problem with congestion effects: a case of bilevel programming. Math. Program. 34(2), 142–162 (1986)
Marcotte, P.: Network optimization with continuous control parameters. Transp. Sci. 17(2), 181–197 (1983)
Meng, Q., Yang, H., Bell, M.G.H.: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp. Res. 35B(1), 83–105 (2001)
Mohring, H., Harwitz, M.: Highway Benefits. Northwestern University Press, Evanston, Illinois (1962)
Sheffi, Y.: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Models. Prentice Hall, Englewood Cliffs, New Jersey (1985)
Shepherd, S.P., Sumalee, A.: A genetic based algorithm based approach to optimal toll level and location problems. Netw. Spat. Econ. 4(2), 161–179 (2004)
Smith, M.J.: The existence, uniqueness and stability of traffic equilibria. Transp. Res. 13B(4), 295–304 (1979)
Suwansirikul, C., Friesz, T.L., Tobin, R.L.: Equilibrium decomposed optimisation: a heuristic for the continuous network equilibrium design problem. Transp. Sci. 21(4), 254–263 (1987)
Verhoef, E.T., Rowendal, J.: Pricing, capacity choice and financing in transportation networks. J. Reg. Sci. 44(3), 405–435 (2004)
Verhoef, E.T.: Second best congestion pricing in general networks: Heuristic algorithms for finding second best optimal toll levels and toll points. Transp. Res. 36B(8), 707–729 (2002)
Verhoef, E.T., Koh, A., Shepherd, S.P.: Pricing, capacity and long-run cost functions for first-best and second best network problems. TI 2008-056/3. Tinbergen Institute Discussion Paper (2008)
Walters, A.A.: The theory and measurement of private and social cost of highway congestion. Econometrica 29(4), 676–699 (1961)
Wheaton, W.C.: Price-induced distortions in urban highway investment. Bell J. Econ. 9(2), 622–632 (1978)
Wilson, J.D.: Optimal road capacity in the presence of unpriced congestion. J. Urban Econ. 13(3), 337–357 (1983)
Yang, H.: Sensitivity analysis for the elastic-demand network equilibrium problem with applications. Transp. Res. 31B(1), 55–70 (1997)
Yang, H., Meng, Q.: A note on “highway pricing and capacity choice in a road network under a build-operate-transfer scheme”. Transp. Res. 36A(7), 659–663 (2002)
Youn, H., Gastner, M.T., Jeong, H.: Price of anarchy in transportation networks: efficiency and optimality control. Phys. Rev. Lett. 101(128701) (2008)
Acknowledgements
The research reported here was funded by the UK Engineering and Physical Science Research Council and the Hong Kong Research Grant Council (PolyU 5261/07E). The authors would also like to thank colleagues Tony May, David Watling and Richard Connors for their support during the course of this research. Also, the third author would like to specially thank Prof. Siriphong Lawphongpanich for his support and suggestion on the application of the CCA. We also sincerely thank the constructive comments from the anonymous three referees which helped improving the paper significantly.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Koh, A., Shepherd, S. & Sumalee, A. Second best toll and capacity optimisation in networks: solution algorithm and policy implications. Transportation 36, 147–165 (2009). https://doi.org/10.1007/s11116-009-9187-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11116-009-9187-y