Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

T. W. Leung; Chi Kin Chan; Marvin D. Troutt

doi:10.1016/S0377-2217(02)00218-7

Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

T. W. Leung
, Chi Kin Chan
, Marvin D. Troutt

Research output: Journal article publication › Journal article › Academic research › peer-review

93 Citations (Scopus)

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.

Original language	English
Pages (from-to)	530-542
Number of pages	13
Journal	European Journal of Operational Research
Volume	145
Issue number	3
DOIs	https://doi.org/10.1016/S0377-2217(02)00218-7
Publication status	Published - 16 Mar 2003

Keywords

Difference process strategy
Genetic algorithm
Meta-heuristics
Mixed heuristics
Simulated annealing
Two-dimensional orthogonal packing problem

ASJC Scopus subject areas

Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

More information

10.1016/S0377-2217(02)00218-7

Cite this

@article{2aef1b6cf17546f6a0241c0501112b9a,

title = "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem",

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

keywords = "Difference process strategy, Genetic algorithm, Meta-heuristics, Mixed heuristics, Simulated annealing, Two-dimensional orthogonal packing problem",

author = "Leung, \{T. W.\} and Chan, \{Chi Kin\} and Troutt, \{Marvin D.\}",

year = "2003",

month = mar,

day = "16",

doi = "10.1016/S0377-2217(02)00218-7",

language = "English",

volume = "145",

pages = "530--542",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

AU - Leung, T. W.

AU - Chan, Chi Kin

AU - Troutt, Marvin D.

PY - 2003/3/16

Y1 - 2003/3/16

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

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

KW - Difference process strategy

KW - Genetic algorithm

KW - Meta-heuristics

KW - Mixed heuristics

KW - Simulated annealing

KW - Two-dimensional orthogonal packing problem

UR - https://www.scopus.com/pages/publications/0037448817

U2 - 10.1016/S0377-2217(02)00218-7

DO - 10.1016/S0377-2217(02)00218-7

M3 - Journal article

SN - 0377-2217

VL - 145

SP - 530

EP - 542

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this