A genetic algorithm based heuristic for adjacent paper-reel layout problem.

Saved in:
Bibliographic Details
Title: A genetic algorithm based heuristic for adjacent paper-reel layout problem.
Authors: Zhang, G. Q.1, Xue, J.1, Lai, K. K.1 mskklai@cityu.edu.hk
Source: International Journal of Production Research. 9/20/2000, Vol. 38 Issue 14, p3343-3356. 14p.
Subjects: Algorithms, Layout (Printing), Manufacturing cells, Heuristic, Genetic algorithms, Cost, Linear programming
Abstract: In this paper, we present an algorithm that solves a paper reel layout problem where the available space is divided into equal-size cells. The problem is to find a layout with the minimum transportation cost subject to adjacency and other constraints. A genetic algorithm is used in a two-stage iterative approach to solve the problem. Computational results seem to indicate the efficiency and effectiveness of the proposed solution method. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we present an algorithm that solves a paper reel layout problem where the available space is divided into equal-size cells. The problem is to find a layout with the minimum transportation cost subject to adjacency and other constraints. A genetic algorithm is used in a two-stage iterative approach to solve the problem. Computational results seem to indicate the efficiency and effectiveness of the proposed solution method. [ABSTRACT FROM AUTHOR]
ISSN:00207543
DOI:10.1080/002075400418289