Abstract
In this paper an Urban Multimodal Interchange Design model is proposed, which considers simultaneously the interchange location problem in a main transit network and the design problem of a secondary transit network which feeds the interchanges, at strategical level. The problem of the design of these interchange facilities, such as the capacity and fares of parking lots is also considered at tactical level. The problem has been formulated by means of a bi-level model. At upper level the design decisions are considered and at lower level, the combined multimodal demand share. To solve this some heuristic algorithms based on the simulating annealing and greedy techniques have been proposed. Computational results in some test networks are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdulaal, M. and LeBlanc, L.J. (1979), Continuous Equilibrium Network Design Models. Transportation Research, 13B, pp. 19–32.
Anandalingam G., Mathieu P., Pittard C.L., Sinha, N. and Vernekar A. (1988), Nontraditional Search Technique for solving Bi-Level Linear Programming Problems. University of Pennsylvania., Philadelphia.
Ben-Akiva, M. and Lerman, S.R. (1985), Discrete Choice Analysis, MIT Press Serie in Transportation Study.
Boyce, D.E. and Janson, B.N. (1980), A Discrete Transportation Network Design Problem with Combined Trip Distribution and Assignment. Transportation Research, 14B, pp. 147–154.
Carrese, S., Gori, S. and Picano, T. (1996), Relationship between Parking Location and Traffic Flows in Urban Areas. Advanced Methods in Transportation Analysis Transportation Science, Lucio Bianco and Paolo Toth, Eds. Springer Verlag, pp. 183–214.
Coppola, P. (1998), A Joint Model of Mode/Parking Choice with Elastic Parking Demand. 6th EURO Working Group Meeting on Transportation, Göteborg.
Chen, M. and Alfa, A.S. (1991), A Network Design Algorithm using a Stochastic Incremental Traffic Assignment Approach. Transportation Science, 25, pp. 215–224.
Fernández E., De Cea J., Florian M. and Cabrera E. (1994), Network Equilibrium Models with Combined Modes. Transportation Science, 28, pp. 182–192.
Florian M. and Los, M. (1979), Determining Intermediate Origin-Destination Matrices for the Analysis of Composite Mode Trips. Transportation Research, 13B, pp. 91–103.
Friesz T., Cho H-J., Mehta N., Tobin R. and Anandalingam G. (1992) A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transportation Science, 26, pp. 18–26.
Friesz T., Anandalingam G., Mehta N., Nam K., Shah, S.J. and Tobin R. (1993). The Multiobjective equilibrium network design problem revisited: A Simulated Annealing Approach. European Journal of Operational Research, 65, pp. 44–57.
García, R. and A. Marin (1997a). Using RSD within Partial Linearization Methods. 16th International Symposium on Mathematical Programming, Lausanne
García, R. and A. Marin (1997b). Urban Multimodal Interchanges (Macro Vision). EURO XV-INFORMS XX XIV Joint International Meeting, Barcelona.
García, R. and Marin, A. (1998). A Bi-level Programming Approach for Estimation of Origin-Destination Matrix and Calibration of Parameters of a Network Equilibrium model with Combined Modes. 6th EURO Working Group Meeting on Transportation, Göteborg.
Han, A.F. and Wilson, H.M. (1982). The allocation of buses in heavily utilised networks with overlapping routes. Transportation Research-B, 16B, 3, pp. 221–232.
Hansen, I., Marin, A. and Rystam, A. (1996). Euritrans: “macro” methodology. Euritrans Group Meeting, Rotterdam.
Hunt, J. D. and Teply, S. (1993) A Nested Logit Model of Parking Location Choice. Transportation Research-B, 4, pp. 253–265.
Leblanc, L.J. (1975) An Algorithm for the discrete network design problem. Transportation Science, 9, pp. 183–199.
Leblanc, L.J. (1988) Transit System Network Design. Transportation Research-B, 22B, 5, pp. 383–390.
Meng, Q., Yang, H. and Bell, M.G.H. (1999) An Equivalent Continuously Differentiable Model and a Locally Convergent Algorithm for the Continuous Network Design Problem. Transportation Research-B, on Bi-level Traffic Modeling and Optimization.
Mesa, J.A. and Ortega, F.A. (1999) Park-and-Ride Station Catchment Areas in Metropolitan Transit Systems. 7th EURO-Working Group Meeting on Transportation, Helsinki.
Nickel, S., Chöbel, A. and Sonneborn, T. (1999) Hub Location Problems in Urban Traffic Network. 7th EURO-Working Group Meeting on Transportation, Helsinki.
Oppenheim, N. (1994) Urban Travel Demand Modelling, WileyInterscience, N.Y
Patriksson, M. (1994) The Traffic Assignment Problem. Models and Methods., VSP, Utrecht, The Netherlands.
Poorzahedy, P. and Turnquist, M.A. (1992), Approximate Algorithms for the Discrete Network Design Problem, Transportation Research-B, 16, pp. 45–56.
Yang, H. and Bell, M.G.H. (1998) Models and algorithms for road network design and how to avoid it. Transportation Research, 18B, pp. 257–278.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
García, R., Marín, A. (2001). Urban Multimodal Interchange Design Methodology. In: Pursula, M., Niittymäki, J. (eds) Mathematical Methods on Optimization in Transportation Systems. Applied Optimization, vol 48. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3357-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3357-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4845-8
Online ISBN: 978-1-4757-3357-0
eBook Packages: Springer Book Archive