A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems.
Ramón Alvarez-ValdésFrancisco ParreñoJosé Manuel TamaritPublished in: Comput. Oper. Res. (2013)
Keyphrases
- packing problem
- three dimensional
- variable sized
- cost function
- computationally efficient
- dynamic programming
- path relinking
- optimization algorithm
- dc programming
- scatter search
- tabu search
- computational complexity
- computational efficiency
- higher dimensional
- particle swarm optimization
- simulated annealing
- search procedure
- optimal solution
- objective function