Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories.
Luiz F. O. Moura SantosHugo T. Yoshida YoshizakiClaudio Barbieri da CunhaPublished in: CoRR (2019)
Keyphrases
- variable neighborhood search
- metaheuristic
- heuristic methods
- tabu search
- traveling salesman problem
- routing problem
- hybrid method
- vehicle routing problem
- hybrid metaheuristic
- minimum spanning tree
- single machine scheduling problem
- lower bound
- search procedure
- benchmark instances
- knapsack problem
- genetic algorithm
- optimization problems
- path relinking
- optimal solution
- search algorithm
- hybrid algorithm
- neural network
- feasible solution
- ant colony optimization
- upper bound
- special case