In this paper, we present an algorithm that solves a paper reel layout prob
lem where the available space is divided into equal-size cells. The problem
is to rnd a layout with the minimum transportation cost subject to adjacen
cy and other constraints. A genetic algorithm is used in a two-stage iterat
ive approach to solve the problem. Computational results seem to indicate t
he efficiency and effectiveness of the proposed solution method.