Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic

Kevin J. Binkley, Masafumi Hagiwara

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This paper proposes a four corners' heuristic for application in evolutionary algorithms (EAs) applied to two-dimensional packing problems. The four corners' (FC) heuristic is specifically designed to increase the search efficiency of EAs. Experiments with the FC heuristic are conducted on 31 problems from the literature both with rotations permitted and without rotations permitted, using two different EA algorithms: a self-adaptive parallel recombinative simulated annealing (PRSA) algorithm, and a self-adaptive genetic algorithm (GA). Results on bin packing problems yield the smallest trim losses we have seen in the published literature; with the FC heuristic, zero trim loss was achieved on problems of up to 97 rectangles. A comparison of the self-adaptive GA to fixed-parameter GAs is presented and the benefits of self-adaption are highlighted.

Original languageEnglish
Pages (from-to)1230-1248
Number of pages19
JournalEuropean Journal of Operational Research
Volume183
Issue number3
DOIs
Publication statusPublished - 2007 Dec 16

Fingerprint

Packing Problem
Adaptive algorithms
Adaptive Algorithm
Evolutionary algorithms
Evolutionary Algorithms
heuristics
Heuristics
Adaptive Genetic Algorithm
Genetic algorithms
Bins
Simulated annealing
Bin Packing Problem
Simulated Annealing Algorithm
Rectangle
Parallel Algorithms
Zero
Experiments
Experiment
efficiency
experiment

Keywords

  • Cutting
  • Evolutionary algorithms
  • Genetic algorithms
  • Packing
  • Simulated annealing

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this

Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic. / Binkley, Kevin J.; Hagiwara, Masafumi.

In: European Journal of Operational Research, Vol. 183, No. 3, 16.12.2007, p. 1230-1248.

Research output: Contribution to journalArticle

@article{7e3330b9efac4b088d975962017e679f,
title = "Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic",
abstract = "This paper proposes a four corners' heuristic for application in evolutionary algorithms (EAs) applied to two-dimensional packing problems. The four corners' (FC) heuristic is specifically designed to increase the search efficiency of EAs. Experiments with the FC heuristic are conducted on 31 problems from the literature both with rotations permitted and without rotations permitted, using two different EA algorithms: a self-adaptive parallel recombinative simulated annealing (PRSA) algorithm, and a self-adaptive genetic algorithm (GA). Results on bin packing problems yield the smallest trim losses we have seen in the published literature; with the FC heuristic, zero trim loss was achieved on problems of up to 97 rectangles. A comparison of the self-adaptive GA to fixed-parameter GAs is presented and the benefits of self-adaption are highlighted.",
keywords = "Cutting, Evolutionary algorithms, Genetic algorithms, Packing, Simulated annealing",
author = "Binkley, {Kevin J.} and Masafumi Hagiwara",
year = "2007",
month = "12",
day = "16",
doi = "10.1016/j.ejor.2004.12.029",
language = "English",
volume = "183",
pages = "1230--1248",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic

AU - Binkley, Kevin J.

AU - Hagiwara, Masafumi

PY - 2007/12/16

Y1 - 2007/12/16

N2 - This paper proposes a four corners' heuristic for application in evolutionary algorithms (EAs) applied to two-dimensional packing problems. The four corners' (FC) heuristic is specifically designed to increase the search efficiency of EAs. Experiments with the FC heuristic are conducted on 31 problems from the literature both with rotations permitted and without rotations permitted, using two different EA algorithms: a self-adaptive parallel recombinative simulated annealing (PRSA) algorithm, and a self-adaptive genetic algorithm (GA). Results on bin packing problems yield the smallest trim losses we have seen in the published literature; with the FC heuristic, zero trim loss was achieved on problems of up to 97 rectangles. A comparison of the self-adaptive GA to fixed-parameter GAs is presented and the benefits of self-adaption are highlighted.

AB - This paper proposes a four corners' heuristic for application in evolutionary algorithms (EAs) applied to two-dimensional packing problems. The four corners' (FC) heuristic is specifically designed to increase the search efficiency of EAs. Experiments with the FC heuristic are conducted on 31 problems from the literature both with rotations permitted and without rotations permitted, using two different EA algorithms: a self-adaptive parallel recombinative simulated annealing (PRSA) algorithm, and a self-adaptive genetic algorithm (GA). Results on bin packing problems yield the smallest trim losses we have seen in the published literature; with the FC heuristic, zero trim loss was achieved on problems of up to 97 rectangles. A comparison of the self-adaptive GA to fixed-parameter GAs is presented and the benefits of self-adaption are highlighted.

KW - Cutting

KW - Evolutionary algorithms

KW - Genetic algorithms

KW - Packing

KW - Simulated annealing

UR - http://www.scopus.com/inward/record.url?scp=34447092995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34447092995&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2004.12.029

DO - 10.1016/j.ejor.2004.12.029

M3 - Article

AN - SCOPUS:34447092995

VL - 183

SP - 1230

EP - 1248

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -