A hybrid genetic algorithm for a variant of two-dimensional packing problem

Authors:
Jin Kim;Byung-Ro Moon
Affiliations:
Seoul National University, Seoul, South Korea;Seoul National University, Seoul, South Korea
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 4
Cited 0

Uniform Crossover in Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
On Multi-Dimensional Encoding/Crossover

Proceedings of the 6th International Conference on Genetic Algorithms
Toward More Powerful Recombinations

Proceedings of the 6th International Conference on Genetic Algorithms
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variant of two-dimensional packing problem was given in the GECCO'2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the No. 1 prize. As the problem is naturally represented by a two-dimensional chromosome, two-dimensional crossovers are used to generate more diverse chromosomes and effectively maintain geographical linkage among genes. We developed a local search heuristic based on the breadth-first search algorithm; we describe how to implement the heuristic efficiently using problem-specific knowledge. The local search was combined with a steady-state genetic algorithm and the combination showed strong synergy.