A multi-heuristic approach for solving the pre-marshalling problem.
Raka JovanovicMilan TubaStefan VoßPublished in: Central Eur. J. Oper. Res. (2017)
Keyphrases
- combinatorial optimization
- timetabling problem
- finding an optimal solution
- search algorithm
- simulated annealing
- dynamic programming
- obtain the optimal solution
- bidirectional search
- solving problems
- branch and bound search
- dynamic programming algorithms
- variable ordering
- heuristic solution
- data sets
- search procedure
- tabu search
- objective function