Solving facility layout problems using genetic programming

  • Authors:
  • Jaime Garces-Perez;Dale A. Schoenefeld;Roger L. Wainwright

  • Affiliations:
  • The University of Tulsa, Tulsa, OK;The University of Tulsa, Tulsa, OK;The University of Tulsa, Tulsa, OK

  • Venue:
  • GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

This research applies techniques and tools from Genetic Programming (GP) to the facility layout problem. The facility layout problem (FLP) is an NP-complete combinatorial optimization problem that has applications to efficient facility design for manufacturing and service industries. A facility layout is represented as a collection of rectangular blocks using a slicing tree structure (STS). We use a multiple purpose genetic programming kernel to generate slicing trees that are converted into candidate solutions for an FLP. The utility of our techniques is established using eight previously published benchmark problems. Our genetic programming techniques that evolve STSs are more natural and more flexible than all of the previously published genetic algorithm and simulated annealing techniques. Previous genetic algorithm techniques use a two-phase optimization strategy. The first phase uses clustering techniques to determine a near optimal fixed tree structure that is represented as a chromosome in a genetic algorithm. Within the constraints implied by the fixed tree structure, genetic algorithm techniques are applied during the second phase to optimize the placement of facilities in relation to each other. Our genetic programming technique is a single phase global optimization strategy using an unconstrained tree structure. This yields superior results.