Variable neighborhood search for integrated timetable based design of railway infrastructure

DOI10.1016/J.ENDM.2014.11.019zbMATH Open1362.90187OpenAlexW1976416742MaRDI QIDQ2631246FDOQ2631246

Igor Grujičić, Günther R. Raidl, A. Schobel

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.019

Recommendations

• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem
• Variable neighborhood search: Principles and applications
• Meta-heuristic and constraint-based approaches for single-line railway timetabling
• Variable neighborhood search

zbMATH Keywords

dynamic programmingvariable neighborhood searchintegrated timetablesrailway infrastructure design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Landscapes, operators and heuristic search
• Title not available (Why is that?)

Cited In (3)

• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• The complexity of the timetable‐based railway network design problem

This page was built for publication: Variable neighborhood search for integrated timetable based design of railway infrastructure

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