A GENETIC ALGORITHM FOR TWO DIMENSIONAL STRIP PACKING PROBLEMS

V Mancapa, TI Van Niekerk, T Hua

Abstract


Cutting and packing problems are combinatorial optimisation problems. In mostmanufacturing situations a raw material, usually in some standard size, has to be divided orcut into smaller items to complete the production of some product. It is therefore desirablethat this raw material be used efficiently. A novel placement heuristic, hybridised with agenetic algorithm, is presented in this paper. A general solution encoding scheme, which isused to encode two dimensional strip packing problems, is also introduced in this study.


Full Text:

PDF


DOI: https://doi.org/10.7166/20-2-766

Refbacks

  • There are currently no refbacks.




Copyright (c) 2015 The South African Journal of Industrial Engineering


ISSN 2224-7890 (on-line) ; ISSN 1012-277X (print)


Powered by OJS and hosted by Stellenbosch University Library and Information Service since 2011.


Disclaimer:

This journal is hosted by the SU LIS on request of the journal owner/editor. The SU LIS takes no responsibility for the content published within this journal, and disclaim all liability arising out of the use of or inability to use the information contained herein. We assume no responsibility, and shall not be liable for any breaches of agreement with other publishers/hosts.

SUNJournals Help