A genetic algorithm based heuristic for adjacent paper-reel layout problem.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 9070463 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A genetic algorithm based heuristic for adjacent paper-reel layout problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Zhang%2C+G%2E+Q%2E%22">Zhang, G. Q.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Xue%2C+J%2E%22">Xue, J.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Lai%2C+K%2E+K%2E%22">Lai, K. K.</searchLink><relatesTo>1</relatesTo><i> mskklai@cityu.edu.hk</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. 9/20/2000, Vol. 38 Issue 14, p3343-3356. 14p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Layout+%28Printing%29%22">Layout (Printing)</searchLink><br /><searchLink fieldCode="DE" term="%22Manufacturing+cells%22">Manufacturing cells</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristic%22">Heuristic</searchLink><br /><searchLink fieldCode="DE" term="%22Genetic+algorithms%22">Genetic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Cost%22">Cost</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=9070463 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/002075400418289 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 14 StartPage: 3343 Subjects: – SubjectFull: Algorithms Type: general – SubjectFull: Layout (Printing) Type: general – SubjectFull: Manufacturing cells Type: general – SubjectFull: Heuristic Type: general – SubjectFull: Genetic algorithms Type: general – SubjectFull: Cost Type: general – SubjectFull: Linear programming Type: general Titles: – TitleFull: A genetic algorithm based heuristic for adjacent paper-reel layout problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Zhang, G. Q. – PersonEntity: Name: NameFull: Xue, J. – PersonEntity: Name: NameFull: Lai, K. K. IsPartOfRelationships: – BibEntity: Dates: – D: 20 M: 09 Text: 9/20/2000 Type: published Y: 2000 Identifiers: – Type: issn-print Value: 00207543 Numbering: – Type: volume Value: 38 – Type: issue Value: 14 Titles: – TitleFull: International Journal of Production Research Type: main |
| ResultId | 1 |
