Login / Signup
Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem.
Erfan Hassannayebi
Seyed Hessameddin Zegordi
Published in:
Comput. Oper. Res. (2017)
Keyphrases
</>
timetabling problem
search algorithm
rapid transit
memetic algorithm
hyper heuristics
examination timetabling
tabu search
high speed
search methods
lower bound
special case
artificial neural networks
test collection
heuristic search
branch and bound
path finding