Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27919
Title: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Authors: Leung, TW
Chan, CK 
Troutt, MD
Keywords: Difference process strategy
Genetic algorithm
Meta-heuristics
Mixed heuristics
Simulated annealing
Two-dimensional orthogonal packing problem
Issue Date: 2003
Publisher: Elsevier
Source: European journal of operational research, 2003, v. 145, no. 3, p. 530-542 How to cite?
Journal: European journal of operational research 
Abstract: In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic (simulated annealing-genetic algorithm) were applied to two-dimensional orthogonal packing problems and the results were compared. The major motivation for applying a modified genetic algorithm is as an attempt to alleviate the problem of pre-mature convergence. We found that in the long run, the mixed heuristic produces better results; while the pure heuristic produces only "good" results, but produces them faster.
URI: http://hdl.handle.net/10397/27919
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/S0377-2217(02)00218-7
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

55
Last Week
0
Last month
1
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

41
Last Week
0
Last month
1
Citations as of Aug 21, 2017

Page view(s)

43
Last Week
4
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.