Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm.
Shunji TanakaKevin TierneyPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- finding an optimal solution
- randomly generated problems
- search tree
- lower bound
- integer variables
- iterative deepening
- weighted max sat
- branch and bound
- upper bound
- np complete
- decision problems
- search problems
- objective function
- knapsack problem
- genetic algorithm
- np hard
- neural network
- feasible solution
- monte carlo
- linear programming
- evolutionary algorithm