Abstract
In this paper we propose a general model for solving the Transportation Network Design Problem (TNDP). Since in real-scale networks the number of feasible solutions to be examined does not allow an exhaustive search and objective functions are not convex, it is necessary to adopt metaheuristic algorithms to obtain sub-optimal solutions within suitable calculation times. Hence, we show and analyse some algorithms proposed in the literature for solving TNDPs both in urban and extra-urban contexts in order to highlight the importance of metaheuristic algorithms in large-scale transportation problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gallo, M., D’Acierno, L., Montella, B.: A meta-heuristic approach for solving the Urban Network Design Problem. Eur. J. Oper. Res. 201, 144–157 (2010)
Gallo, M., D’Acierno, L., Montella, B.: A meta-heuristic algorithm for solving the road network design problem in regional contexts. Procedia Soc. Behav. Sci. 54, 84–95 (2012)
Gallo, M., Montella, B., D’Acierno, L.: The transit network design problem with elastic demand and internalisation of external costs: an application to rail frequency optimisation. Transp. Res. C-Emer. 19, 1276–1305 (2011)
Gallo, M., D’Acierno, L., Montella, B.: A multimodal approach to bus frequency design. WIT Trans. Built Env. 116, 193–204 (2011)
Yang, H., Bell, M.G.H.: Models and algorithms for road network design: a review and some new developments. Transp. Rev. 18, 257–278 (1998)
Feremans, C., Labb, M., Laporte, G.: Generalized network design problems. Eur. J. Oper. Res. 148, 1–13 (2003)
Guihaire, V., Hao, J.K.: Transit network design and scheduling: a global review. Transp. Res. A-Pol. 42, 1251–1273 (2008)
Kepaptsoglou, K., Karlaftis, M.: Transit route network design problem: review. J. Transp. Eng. 135, 491–505 (2009)
Cantarella, G.E.: A general fixed-point approach to multimodal multi-user equilibrium assignment with elastic demand. Transp. Sci. 31, 107–128 (1997)
Cascetta, E.: Transportation Systems Analysis: Models and Applications. Springer, New York (2009)
Sheffi, Y., Powell, W.B.: A comparison of stochastic and deterministic traffic assignment over congested networks. Transp. Res. B-Meth. 15, 53–64 (1981)
D’Acierno, L., Montella, B., De Lucia, F.: A stochastic traffic assignment algorithm based on Ant Colony Optimisation. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 25–36. Springer, Heidelberg (2006)
D’Acierno, L., Gallo, M., Montella, B.: Ant Colony Optimisation approaches for the transportation assignment problem. WIT Trans. Built Env. 111, 37–48 (2010)
Montella, B., Gallo, M., D’Acierno, L.: Multimodal network design problems. Adv. Transp. 5, 405–414 (2000)
Glover, F., Laguna, M., Martì, R.: Scatter search. In: Ghosh, A., Tsutsui, S. (eds.) Advances in Evolutionary Computation: Theory and Applications, pp. 519–537. Springer, New York (2003)
Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor (1975)
Goldberg, D.E.: Genetic Algorithms in Search. Optimization and Machine Learning. Kluwer Academic Publishers, Boston (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Acierno, L., Gallo, M., Montella, B. (2014). Application of Metaheuristics to Large-Scale Transportation Problems. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2013. Lecture Notes in Computer Science(), vol 8353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43880-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-662-43880-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43879-4
Online ISBN: 978-3-662-43880-0
eBook Packages: Computer ScienceComputer Science (R0)