A Slicing Tree Representation and QCP-Model-Based Heuristic Algorithm for the Unequal-Area Block Facility Layout Problem

Abstract EN

The facility layout problem is a typical combinational optimization problem.

In this research, a slicing tree representation and a quadratically constrained program model are combined with harmony search to develop a heuristic method for solving the unequal-area block layout problem.

Because of characteristics of slicing tree structure, we propose a regional structure of harmony memory to memorize facility layout solutions and two kinds of harmony improvisation to enhance global search ability of the proposed heuristic method.

The proposed harmony search based heuristic is tested on 10 well-known unequal-area facility layout problems from the literature.

The results are compared with the previously best-known solutions obtained by genetic algorithm, tabu search, and ant system as well as exact methods.

For problems O7, O9, vC10Ra, M11*, and Nug12, new best solutions are found.

For other problems, the proposed approach can find solutions that are very similar to previous best-known solutions.