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

Computers & OR, Volume 78, Issue C, 2017, Pages 480-499.

Cited by: 47|Bibtex|Views20|Links
EI

Abstract:

This paper focuses on the development of metaheuristic algorithms for the real-time traffic management problem of scheduling and routing trains in complex and busy railway networks. This key optimization problem can be formulated as a mixed integer linear program. However, since the problem is strongly NP-hard, heuristic algorithms are ty...More

Code:

Data:

Your rating :
0

 

Tags
Comments