An automatic method for generating multiple alignment alternatives for a railway bypass

DOI10.1016/J.COR.2023.106217MaRDI QIDQ6164594zbMATH OpenOpenAlexFDO

Authors Miguel Ernesto Vázquez-Méndez, Gerardo Casal, Alberte Castro, D. Santamarina

Publication date 4 July 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

mixed integer non linear programmingobtaining local minimarailway alignment optimizationrailway bypass

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Path based algorithms for metro network design
• Variable neighborhood search for integrated timetable based design of railway infrastructure
• Railway track allocation by rapid branching
• Solving railway track allocation problems
• A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design

Cites work

• Bi-objective optimization for road vertical alignment design
• Fast feasibility check of the multi-material vertical alignment problem in road design
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Models and strategies for efficiently determining an optimal vertical alignment of roads
• Multiple-path selection for new highway alignments using discrete algorithms
• Optimizing horizontal alignment of roads in a specified corridor

Cited in

(1)

• Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map

This page was built for publication: An automatic method for generating multiple alignment alternatives for a railway bypass

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164594)