Branch-and-bound-based local search heuristics for train timetabling on single-track railway network
Year of publication: |
March 2017
|
---|---|
Authors: | Ampol Karoonsoontawong ; Taptana, Apisak |
Published in: |
Networks and spatial economics : a journal of infrastructure modeling and computation. - Norwell, Mass. : Kluwer Academic Publ., ISSN 1566-113X, ZDB-ID 2079789-8. - Vol. 17.2017, 1, p. 1-39
|
Subject: | Train timetabling | Local search heuristic | Branch and bound algorithm | Heuristik | Heuristics | Theorie | Theory | Schienenverkehr | Railway transport | Scheduling-Verfahren | Scheduling problem | Linienverkehr | Scheduled transport | Tourenplanung | Vehicle routing problem |
-
Emergency train scheduling on Chinese high-speed railways
Zheng, Yu-Jun, (2018)
-
Set covering heuristics in a Benders decomposition for railway timetabling
Leutwiler, Florin, (2023)
-
Approaches to a real-world train timetabling problem in a railway node
Cacchiani, Valentina, (2016)
- More ...
-
Ampol Karoonsoontawong, (2010)
-
A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
Lin, Dung-ying, (2011)
-
Ampol Karoonsoontawong, (2015)
- More ...