Optimum Location of Motorway Interchanges: Users’ Perspective
Publication: Journal of Transportation Engineering
Volume 136, Issue 11
Abstract
Decisions regarding the location of motorway interchanges need to be made very carefully because of their economic and political implications. In this paper, we present three optimization models aimed at assisting road administrations when they deal with motorway interchange location problems. The decisions are assumed to be made from the perspective of road users, with the objective of minimizing travel costs. Two of the models are based on existing hub location models, whereas the third one is a new model. The usefulness of the models in real-world situations is illustrated with a case study involving A25, one of the most important Portuguese motorways. When applied to this case study, the new model performed in general clearly better than the other two.
Get full access to this article
View all available purchase options and get full access to this article.
References
AASHTO. (2004). A policy on geometric design of highways and streets, Washington, D.C.
Alumur, S., and Kara, B. Y. (2008). “Network hub location problems: The state of the art.” Eur. J. Oper. Res., 190(1), 1–21.
Antunes, A., Seco, A., and Pinto, N. (2003). “An accessibility-maximization approach to road network planning.” Comput. Aided Civ. Infrastruct. Eng., 18(3), 224–240.
Aykin, T. (1995). “Networking policies for hub-and-spoke systems with application to the air transportation system.” Transp. Sci., 29(3), 201–221.
Balinski, M. L. (1965). “Integer programming—Methods, uses, computation.” Manage. Sci., 12(3), 253–313.
Bruno, G., Ghiani, G. I., and Improta, G. (1998). “A multi-modal approach to the location of a rapid transit line.” Eur. J. Oper. Res., 104(2), 321–332.
Button, K. J., Leitham, S., McQuaid, R. W., and Nelson, J. D. (1995). “Transport and industrial and commercial location.” Ann. Reg. Sci., 29(2), 189–206.
Campbell, J. F. (1994). “Integer programming formulations of discrete hub location-problems.” Eur. J. Oper. Res., 72(2), 387–405.
Campbell, J. F., Ernst, A. T., and Krishnamoorthy, M. (2002). “Hub location problems.” Facility location. Applications and theory, Z. Drezner and H. W. Hamacher, eds., Springer, Heidelberg, Germany, 373–408.
Church, R. L. (2003). “COBRA: A new formulation of the classic p-median location problem.” Ann. Oper. Res., 122(1–4), 103–120.
Cushman & Wakefield. (2007). European cities monitor 2007, London.
Dash Optimization. (2007). Xpress-MP getting started, Blisworth, U.K.
De Bok, M., and Sanders, F. (2005). “Firm relocation and accessibility of locations: Empirical results from The Netherlands.” Transp. Res. Rec., 1902, 35–43.
Ebery, J., Krishnamoorthy, M., Ernst, A., and Boland, N. (2000). “The capacitated multiple allocation hub location problem: Formulations and algorithms.” Eur. J. Oper. Res., 120(3), 614–631.
Efroymson, M. A., and Ray, T. L. (1966). “A branch-bound algorithm for plant location.” Oper. Res., 14(3), 361–368.
Ernst, A. T., and Krishnamoorthy, M. (1998). “Exact and heuristic algorithms for the uncapacitated multiple allocation -hub median problem.” Eur. J. Oper. Res., 104(1), 100–112.
Hamacher, H. W., Labbé, M., Nickel, S., and Sonneborn, T. (2004). “Adapting polyhedral properties from facility to hub location problems.” Discrete Appl. Math., 145, 104–116.
Hamacher, H. W., Liebers, A., Schöbel, A., Wagner, D., and Wagner, F. (2001). “Locating new stops in a railway network.” Electron. Notes Theor. Comput. Sci., 50(1), 13–23.
Kawamura, K. (2001). “Empirical examination of relationship between firm location and transportation facilities.” Transp. Res. Rec., 1747, 97–103.
Laporte, G., Marín, A., Mesa, J. A., and Ortega, F. A. (2007). “An integrated methodology for the rapid transit network design problem.” Algorithmic methods for railway optimization, F. Geraets, L. Kroon, A. Schoebel, D. Wagner, and C. D. Zaroliagis, eds., Springer, Berlin, 187–199.
Laporte, G., Mesa, J. A., and Ortega, F. A. (2002). “Locating stations on rapid transit lines.” Comput. Oper. Res., 29(6), 741–759.
Leisch, P. E. (2006). The freeway and interchange geometric design handbook, Institute of Transportation Engineers, Washington, D.C.
LINDO Systems. (2003). LINGO—The modeling language and optimizer, Chicago.
Marín, A. (2007). “An extension to rapid transit network design problem.” TOP, 15(2), 231–241.
Marín, A., Cánovas, L., and Landete, M. (2006). “New formulations for the uncapacitated multiple allocation hub location problem.” Eur. J. Oper. Res., 172(1), 274–292.
Morris, J. G. (1978). “Extent to which certain fixed-charge depot location problems can be solved by LP.” J. Oper. Res. Soc., 29(1), 71–76.
Murawski, L., and Church, R. L. (2009). “Improving accessibility to rural health services: The maximal covering network improvement problem.” Socio-Econ. Plan. Sci., 43(2), 102–110.
O’Kelly, M. E., and Bryan, D. L. (1998). “Hub location with flow economies of scale.” Transp. Res., Part B: Methodol., 32(8), 605–616.
ReVelle, C. (1993). “Facility siting and integer-friendly programming.” Eur. J. Oper. Res., 65(2), 147–158.
Rietveld, P., and Bruinsma, F. (1998). Is transport infrastructure effective? Springer, Heidelberg, Germany.
Rosing, K. E., Revelle, C. S., and Rosing-Vogelaar, H. (1979). “The -median and its linear-programming relaxation: Approach to large problems.” J. Oper. Res. Soc., 30(9), 815–823.
Santos, B., Antunes, A., and Miller, E. J. (2009). “A multi-objective approach to long-term interurban multi-level road network planning.” J. Transp. Eng., 135(9), 640–649.
Scaparra, M. P., and Church, R. L. (2005). “A GRASP and path relinking heuristic for rural road network development.” J. Heuristics, 11(1), 89–108.
Skorin-Kapov, D., Skorin-Kapov, J., and O’Kelly, M. (1996). “Tight linear programming relaxations of uncapacitated -hub median problems.” Eur. J. Oper. Res., 94(3), 582–593.
Yang, H., and Bell, M. G. H. (1998). “Models and algorithms for road network design: a review and some new developments.” Transp. Rev., 18(3), 257–278.
Information & Authors
Information
Published In
Copyright
© 2010 ASCE.
History
Received: Oct 15, 2009
Accepted: Apr 5, 2010
Published online: Apr 14, 2010
Published in print: Nov 2010
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.