Services on Demand
Article
Indicators
Related links
-
Cited by Google
-
Similars in Google
Share
South African Journal of Industrial Engineering
On-line version ISSN 2224-7890
Print version ISSN 1012-277X
S. Afr. J. Ind. Eng. vol.20 n.2 Pretoria 2009
A genetic algorithm for two dimensional strip packing problems
V. MancapaI; T.I. van NiekerkII; T HuaIII
IDepartment of Electrical Engineering, Nelson Mandela Metropolitan University, South Africa mancapa@nmmu.ac.za
IIDepartment of Mechatronics, Nelson Mandela Metropolitan University, South Africa theo.vanNiekerk@nmmu.ac.za
IIIDepartment of Mechatronics, Nelson Mandela Metropolitan University, South Africa
ABSTRACT
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situations a raw material, usually in some standard size, has to be divided or cut into smaller items to complete the production of some product. It is therefore desirable that this raw material be used efficiently. A novel placement heuristic, hybridised with a genetic algorithm, is presented in this paper. A general solution encoding scheme, which is used to encode two dimensional strip packing problems, is also introduced in this study.
OPSOMMING
Die optimisering van sny- en pakprobleme vorm deel van die kombinasieleer. Dit is dikwels so by vervaardiging dat grondstof onderverdeel (gesny) word om te pas by die samestelling van 'n gegewe produk. Sodanige onderverdeling moet doeltreffend verrig word. 'n Veredelde heuristiese genetiese algoritme word hiervoor bekend gestel. 'n Algemene koderingsmetode vir tweedimensionele strookverpakking word voorgehou.
“Full text available only in PDF format”
REFERENCES
[1] Hopper, E. and Turton, B.C.H. 2001. A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review 16, pp. 257-300. [ Links ]
[2] Soke, A. and Bingul, Z. 2006. Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems. Engineering Applications of Artificial Intelligence, 19, pp. 557-567. [ Links ]
[3] Martello, S., Monaci, M. and Vigo, D. 2003. An exact approach to the strip-packing problem. Informs Journal on Computing 15, pp. 310-319. [ Links ]
[4] Fekete, S.P. and Schepers, J. 1997. On more-dimensional packing III: Exact algorithms. Technical Report ZPR97-290, Mathematisches Institut, Universität zu Köln. [ Links ]
[5] Hifi, M. 1998. Exact algorithms for the guillotine strip cutting problem. Computers Ops Res. Vol. 25, No. 11, pp. 925-940. [ Links ]
[6] Hopper, E. and Turton, B.C.H. 2001. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research, 128, pp. 34-57. [ Links ]
[7] Leung, T.W., Chan, C.K. and Troutt, M.D. 2003. Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. European Journal of Operational Research 145, pp. 530-542. [ Links ]
[8] Davis L. 1991. Handbook of genetic algorithms. New York: Van Nostrand Reinhold. [ Links ]
[9] Jakobs, S. 1996. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88, pp. 165-181. [ Links ]
[10] Liu, D. and Teng, H. 1999. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research 112, pp. 413-420. [ Links ]
[11] Hopper, E. and Turton, B. 1999. A genetic algorithm for a 2D industrial packing problem. Computers & Industrial Engineering, 37, pp. 375-378. [ Links ]
[12] Yeung, L.H.W. and Tang, W.K.S. 2004. Strip-packing using hybrid genetic approach. Engineering Applications of Artificial Intelligence, 17(2), pp. 169-177. [ Links ]
[13] Bortfeldt, A. 2006. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research, 172(3), p. 814-837. [ Links ]
[14] Gomes, A.M. and Oliveira, J.F. 2006. Solving irregular strip packing problems by hybridising simulated annealing and linear programming. European Journal of Operational Research, 171, pp. 811-829. [ Links ]
[15] Mitchell, M. 1998. An introduction to genetic algorithms. Cambridge, MA: MIT Press. [ Links ]
[16] Michalewicz, Z. and Fogel, D. B. 2000. How to solve it: Modern heuristics. Heidelberg: Springer-Verlag Berlin. [ Links ]
[17] MATLAB Version 7, 2006. Genetic algorithm and direct search toolbox 2: User's guide. Natick, MA: The Mathworks Inc. [ Links ]
[18] Euro Special Interest Group on Cutting and Packing, Listing Gallery: Data Sets 2D -Rectangular. Available from http://paginas.fe.up.pt/~esicup/tiki-listfilegallery.php?galleryId=3 (Accessed 8 August 2007). [ Links ]
[19] Oliveira, J., Gomes, A. and Ferreira, J. 2000. A new constructive algorithm for nesting. OR Spektrum, 22, pp. 263-284. [ Links ]
[20] Albano, A. and Sapuppo, G. 1980. Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Trans. Syste., Man, Cybern., SMC IEEE Transactions on Systems, Man and Cybernetics SMC-10, 5, pp. 242-248. [ Links ]
[21] Marques, V., Bispo, C. and Sentieiro, J. 1991. A system of compaction of two-dimensional irregular shapes based on simulated annealing. In IECON-91(IEEE). [ Links ]
1 The author was enrolled for an MTech (Electrical Engineering) degree at the Department of Electrical Engineering, Nelson Mandela Metropolitan University.