Developing a constructive heuristic algorithm for train scheduling problem
Publish place: 14th International Industrial Engineering Conference
Publish Year: 1396
Type: Conference paper
Language: English
View: 774
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
IIEC14_025
Index date: 17 August 2018
Developing a constructive heuristic algorithm for train scheduling problem abstract
This paper focuses on optimizing the single/double track train scheduling where overtaking in some stations/ tracks is allowed and dwell/ running times are different. Since train scheduling is proven to be strongly NP-hard, this paper proposes a constructive heuristic algorithm using branch and bound and constraint programming techniques to effectively reduce solution and search space, minimize total weighted tardiness with an acceptable gap and illustrate its computational performance. It is studied on both numerical stances of the variable sizes and also real network case study to demonstrate being time efficient for real size problems.
Developing a constructive heuristic algorithm for train scheduling problem Keywords:
Developing a constructive heuristic algorithm for train scheduling problem authors