A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations

详细信息    查看全文

• 作者：Marcella Samà ; ^a ; Andrea D׳Ariano^a ; ^{dariano@ing.uniroma3.it} ; Francesco Corman^b ; Dario Pacciarelli^a
• 关键词：Real-time railway traffic management ; Train scheduling and routing ; Alternative graph ; Disjunctive programming ; Branch-and-bound ; Variable neighbourhood search ; Tabu search
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：480-499
• 全文大小：1541 K
• 卷排序：78

文摘

Variable neighbourhood search algorithms are proposed for efficient railway traffic control. New neighbourhood search strategies for real-time train re-routing are developed. Practical railway test cases from various European countries are investigated. The new algorithms compute good quality solutions in a short computation time. The new algorithms often outperform a state-of-the-art tabu search algorithm.