A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables.
Christian LiebchenPublished in: WEA (2005)
Keyphrases
- feasible solution
- timetabling problem
- tabu search
- optimal solution
- solution quality
- objective function
- linear programming
- infeasible solutions
- heuristic solution
- hyper heuristics
- lagrangian relaxation
- optimal or near optimal
- convex hull
- dynamic programming
- search procedure
- beam search
- search algorithm
- real time
- mathematical model
- heuristic methods
- image segmentation
- genetic algorithm