An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem

DOI10.1016/j.cor.2016.08.008zbMath1391.90049OpenAlexW2518443661MaRDI QIDQ1652047

David Canca, Gilbert Laporte, Juan A. Mesa, Alicia De-Los-Santos

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.08.008

zbMATH Keywords

network designadaptive large neighborhood searchline planningrailway rapid transit

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (9)

The line planning routing game ⋮ An adaptive large neighbourhood search for asset protection during escaped wildfires ⋮ Benders decomposition for network design covering problems ⋮ Solving real-size stochastic railway rapid transit network construction scheduling problems ⋮ Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ Integrating train service route design with passenger flow allocation for an urban rail transit line ⋮ Designing metro network expansion: deterministic and robust optimization models ⋮ A quantitative approach for the long-term assessment of railway rapid transit network construction or expansion projects ⋮ Optimising the travel time of a line plan

Uses Software

• Bonmin
• AlphaECP

Cites Work

• Unnamed Item
• Path based algorithms for metro network design
• A survey of very large-scale neighborhood search techniques
• Maximizing trip coverage in the location of a single rapid transit alignment
• Strategic route extension in transit networks
• An algorithmic framework for convex mixed integer nonlinear programs
• Location of infrastructure in urban railway networks
• Optimal lines for railway systems
• A multi-modal approach to the location of a rapid transit line
• Cost optimal allocation of rail passenger lines
• The inventory-routing problem with transshipment
• A fast algorithm for near cost optimal line plans
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• A branch-and-reduce approach to global optimization
• GRASP algorithms for the robust railway network design problem
• Locally ideal formulations for piecewise linear functions with indicator variables
• On solving multi-type railway line planning problems
• A Survey of Optimization Models for Train Routing and Scheduling
• Analysis of the Parameters of Transfers in Rapid Transit Network Design
• Modelling with integer variables
• Integrating Robust Railway Network Design and Line Planning under Failures
• GAMS: a framework for the management of scientific software
• Locating a transit line using tabu search
• A heuristic for the location of a rapid transit line

This page was built for publication: An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem