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

DOI10.1007/S11750-019-00537-XzbMath1442.90018OpenAlexW2999213923MaRDI QIDQ2192028

Juan A. Mesa, Federico Perea, Fernando Rubio-Del-Rey, Mozart B. C. Menezes

Publication date: 26 June 2020

Published in: Top (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/166576

zbMATH Keywords

computational complexitytransportationgenetic algorithmsnetworks/graphs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Benders decomposition for network design covering problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Line planning in public transportation: models and methods
• Location of infrastructure in urban railway networks
• A genetic algorithm for a single product network design model with lead time and safety stock considerations
• The ellipsoid method and its consequences in combinatorial optimization
• A review of extensive facility location in networks
• Geometric algorithms and combinatorial optimization.
• Discrete optimization in public rail transport
• Assessing the efficiency of rapid transit configurations
• Extensive facility location problems on networks: an updated review
• On subtrees of trees
• Location of speed-up subnetworks
• GRASP algorithms for the robust railway network design problem

This page was built for publication: Transportation infrastructure network design in the presence of modal competition: computational complexity classification and a genetic algorithm