- -

Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm

Show full item record

Perea Rojas Marcos, F.; Menezes, MBC.; Mesa, JA.; Rubio-Del-Rey, F. (2020). Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm. Top. 28(2):442-474. https://doi.org/10.1007/s11750-019-00537-x

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/166576

Files in this item

Item Metadata

Title: Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm
Author: Perea Rojas Marcos, Federico Menezes, Mozart B. C. Mesa, Juan A. Rubio-Del-Rey, Fernando
UPV Unit: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Issued date:
Abstract:
[EN] In this paper we analyze the computational complexity of transportation infrastructure network design problems, in the presence of a competing transportation mode. Some of these problems have previously been introduced ...[+]
Subjects: Networks , Graphs , Transportation , Computational complexity , Genetic algorithms
Copyrigths: Reserva de todos los derechos
Source:
Top. (issn: 1134-5764 )
DOI: 10.1007/s11750-019-00537-x
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/s11750-019-00537-x
Project ID:
info:eu-repo/grantAgreement/MINECO//MTM2016-74983-C2-1-R/ES/Nuevos Desafíos Matemáticos en Problemas Logísticos y de Transporte Integrado sobre Redes Complejas: Diseño y Optimización/
info:eu-repo/grantAgreement/MINECO//MTM2015-67706-P/ES/ANALISIS ESTRUCTURAL DE MODELOS MATEMATICOS DE OPTIMIZACION EN LOCALIZACION Y PLANIFICACION DEL TRANSPORTE/
info:eu-repo/grantAgreement/UPV//PAID-06-18/
info:eu-repo/grantAgreement/UPV//SP20180164/
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094940-B-I00/ES/OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS/
Thanks:
Mozart Menezes and Juan A. Mesa were partially supported by project MTM2015- 67706-P (MINECO/FEDER,UE). Federico Perea was partially supported by the Spanish Ministry of Science, Innovation, and Universities, under ...[+]
Type: Artículo

References

Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Annotated bibliography in combinatorial optimization. Wiley, New York

Bussieck M, Winter T, Zimmermann U (1997) Discrete optimization in public rail transport. Math Prog 79(1–3):415–444

Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput Aided Civ Infrastruct Eng 18:184–200 [+]
Balakrishnan A, Magnanti TL, Mirchandani P (1997) Network design. Annotated bibliography in combinatorial optimization. Wiley, New York

Bussieck M, Winter T, Zimmermann U (1997) Discrete optimization in public rail transport. Math Prog 79(1–3):415–444

Chakroborty P (2003) Genetic algorithms for optimal urban transit network design. Comput Aided Civ Infrastruct Eng 18:184–200

Chakroborty P, Dwivedi T (2002) Optimal route network design for transit systems using genetic algorithms. Eng Optim 34(1):83–100

Desaulniers G, Hickman MD (2007) Public transit. Transportation Handbooks in operations research and management science, vol 14. Elsevier, Amsterdam, pp 69–127

García-Archilla B, Lozano AJ, Mesa JA, Perea F (2013) GRASP algorithms for the robust railway network design problem. J Heuristics 19(2):399–422

Garey M, Johnson DS (1979) Computers and Intractability: a guide to the theory of NP-completeness. W.H Freeman and Company, US

Goel G, Karande C, Tripathi P, Wanga L (2010) Approximability of combinatorial problems with multi-agent submodular cost functions. ACM SIGecom Exch 9(1):1–4

Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1:169–197

Grötschel M, Lovász L, Schrijver A (1993) Geometric algorithms and combinatorial optimization, 2nd edn. Springer-Verlag, New York

Guihaire V, Hao JK (2008) Transit network design and scheduling: a global review. Transp Res Part A 42:1251–1273

Jegelka SS (2012) Combinatorial problems with sub-modular coupling in machine learning and computer vision. Thesis ETH Zurich

Laporte G, Mesa JA, Ortega FA (1995) Assessing the efficiency of rapid transit configurations. Top 5:95–104

Laporte G, Mesa JA, Perea F (2010) A game theoretic framework for the robust railway transit network design problem. Transp Res Part B 44:447–459

Magnanti TL, Wong RT (1984) Network design and transportation planning: models and algorithms. Transp Sci 18:1–55

Marín A, García-Ródenas R (2009) Location of infrastructure in urban railway networks. Comput Oper Res 36(5):1461–1477

Mesa JA, Boffey BT (1996) A review of extensive facility location in networks. Eur J Oper Res 95:592–603

Nayeem MA, Rahman MK, Rahman MS (2014) Transit network design by genetic algorithm with elitism. Transp Res Part C 46:30–45

Nemhauser GL, Wolsey LA (1999) Integer and combinatorial optimization. Wiley, Amsterdam

Perea F, Mesa JA, Laporte G (2014) Adding a new station and a road link to a road-rail network in the presence of modal competition. Transp Res Part B 68:1–16

Puerto J, Ricca F, Scozzari A (2018) Extensive facility location problems on networks: an updated review. TOP 26(2):187–226

Schmidt M, Schöbel A (2014) Location of speed-up subnetworks. Ann Oper Res 223(1):379–401

Schöbel A (2012) Line planning in public transportation: models and methods. OR Spectr 34(3):491–510

Sourirajan K, Ozsen L, Uzsoy R (2009) A genetic algorithm for a single product network design model with lead time and safety stock considerations. Eur J Oper Res 197(2):599–608

Székely L, Wang H (2005) On subtrees of trees. Adv Appl Math 34:138–155

Ukkusuri SV, Mathew TV, Waller ST (2007) Robust transportation network design under demand uncertainty. Comput Aided Civ Infrast Eng 22:6–18

[-]

recommendations

 

This item appears in the following Collection(s)

Show full item record