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...

Full description

Bibliographic Details
Main Author: Chan, Tak Ming (author)
Other Authors: Alvelos, Filipe Pereira e (author), Silva, Elsa (author), Carvalho, J. M. Valério de (author)
Format: article
Language:eng
Published: 2013
Subjects:
Two-dimensional guillotine bin packing problems
Local search heuristics
Variable neighborhood descent (VND)
Random neighbor selection (RNS)
Optimization
Science & Technology
Online Access:http://hdl.handle.net/1822/26818
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/26818

Internet

http://hdl.handle.net/1822/26818

Similar Items