Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
In this paper, a new efficient algorithm named combined local search heuristics which comprise two local search heuristics, Variable Neighborhood Descent (VND) and Random Neighbor Selection (RNS), is designed and proposed to solve two-dimensional guillotine bin packing problems. The objective of the...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/26818 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/26818 |