A beam search approach to solve the convex irregular bin packing problem with guillotine guts.
Julia A. BennellMarta CaboAntonio Martinez-SykoraPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- beam search
- assembly line balancing
- branch and bound
- heuristic search
- search algorithm
- knapsack problem
- larger problems
- bin packing
- lower bound
- production planning and scheduling
- search methods
- search problems
- assembly line
- hill climbing
- search strategy
- complex real world problems
- neural network
- ranking functions
- cost function
- multi objective
- web pages
- search engine