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.
- C. A. Anderson, K. F. Jones, and J. Ryan. A two-dimensional genetic algorithm for the Ising problem. Complex Systems, 5:327--333, 1991.Google Scholar
- T. N. Bui and B.-R. Moon. On multi-dimensional encoding/crossover. In Sixth International Conference on Genetic Algorithms, pages 49--56, 1995. Google ScholarDigital Library
- J. P. Cohoon and W. Paris. Genetic placement. In IEEE International Conference on Computer-Aided Design, pages 422--425, 1986.Google Scholar
- C.-H. Im, H.-K. Jung, and Y.-J. Kim. Hybrid genetic algorithm for electromagnetic topology optimization. IEEE Transactions on Magnetics, 39(5): 2163--2169, 2003.Google ScholarCross Ref
- A. B. Kahng and B.-R. Moon. Toward more powerful recombinations. In Sixth International Conference on Genetic Algorithms, pages 96--103, 1995. Google ScholarDigital Library
- B.-R. Moon, Y.-S. Lee, and C.-K. Kim. GEORG: VLSI circuit partitioner with a new genetic algorithm framework. Journal of Intelligent Manufacturing, 9(5):401--412, 1998.Google ScholarCross Ref
- E.-J. Park, Y.-H. Kim, and B.-R. Moon. Genetic search for fixed channel assignment problem with limited bandwidth. In Genetic and Evolutionary Computation Conference, pages 1172--1179, 2002. Google ScholarDigital Library
- G. Syswerda. Uniform crossover in genetic algorithms. In Third International Conference on Genetic Algorithms, pages 2--9, 1989. Google ScholarDigital Library
Index Terms
A hybrid genetic algorithm for a variant of two-dimensional packing problem
Recommendations
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
This paper addresses a constrained two-dimensional (2D), non-guillotine restricted, packing problem, where a fixed set of small rectangles has to be placed into a larger stock rectangle so as to maximize the value of the rectangles packed. The algorithm ...
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem
Special Issue on Modeling and Verification of Discrete Event SystemsThe bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential constructive crossover has been developed to obtain heuristic ...
A hybrid genetic algorithm with the Baldwin effect
Here we present a new hybrid genetic algorithm (HGA) with the Baldwin effect. In the HGA, a local search is employed to change the fitness of individuals but the acquired improvements do not change the individual itself. This local search step exploits ...
Comments