A genetic algorithm approach for the cutting stock problem

Journal of Intelligent Manufacturing

Volumn 14, Issue 2, 2003, Pages 209-218

  Onwubolu, Godfrey C ^a   Mutingi, Michael ^b  

^a UNIVERSITY OF THE SOUTH PACIFIC   (Fiji)

^b NONE

Author keywords

Cutting stock; Genetic algorithms; Optimization

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

CUTTING STOCK PROBLEM;

INVENTORY CONTROL;

EID: 0038680345     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022955531018     Document Type: Article

References (21)

1. Babu, A. R. and Babu, N. R. (1999) Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. International Journal of Production Research, 37(7), 1625-1643.
2. Benati, S. (1997) An algorithm for a cutting stock problem on a strip. Journal of Operational Research Society, 48, 288-294.
3. Berkey, J. O. and Wang, P. Y. (1987) Two-dimensional final bin-packing algorithms. Journal of Operational Research Society, 38, 423-429.
4. Chauny, F., Loulou, R., Sadones, S. and Soumis, F. (1991) A two-phase heuristic for the two-dimensional cutting-stock problem. Journal of Operational Research Society, 42, 32-47.
5. Dagli, C. H. and Poshyanonda, P. (1997) New approaches to nesting rectangular patterns. Journal of Intelligent Manufacturing, 8, 177-190.
6. Dorigo, M. and Gambardella, L. M. (1997) Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Transaction on Evolutionary Computation 1(10), 53-66.
7. Fleurent, C. and Ferland, J. (1994) Genetic hybrids for the quadratic assignment problem. DIMACS. Series in Mathematical Theoretical Computer Science, 16, 190-206.
8. Garey, M. R. and Johnson, D. S. (1979) Computers and intractability: a guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, CA, USA.
9. Gilmore, P. C. and Gomory, R. E. (1963a) A linear programming approach to the cutting stock problem, Part II. Operations Research, 11, 863-888.
10. Gilmore, P. C. and Gomory, R. E. (1963b) The theory and the computation of knapsack functions. Operational Research, 14, 1045-1074.
11. Gilmore, P. C. and Gomory, R. E. (1966) Multi-stage cutting stock problems of two and more dimensions. Operational Research, 13, 94-120.
12. Glover, F. (1989) Tabu search - Part I, ORSA Journal of Computing, 1, 190-206.
13. Goldberg, D. E. (1989) Genetic Algorithms: In Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA.
14. Hains, M. J. and Freeman, H. (1970) A multistage solution of the template-layout problem. IEEE Transactions on System, Science and Cybernetics, SSC-6, 145-151.
15. Kroger, B. (1995) Guillotinable bin packing: a genetic approach. European Journal of Operational Research, 84, 645-661.
16. Liepins, G. E. and Hilliard, M. R. (1986) Genetic algorithms as a paradigm for machine learning. Paper Presented at the ORSA/IMS Joint National Meeting, Miami, FL, USA.
17. Onwubolu, G. C. and Mutingi, M. (2001) Optimizing the multiple constrained resources product mix problem using genetic algorithms. International Journal of Production Research, 39(9), 1897-1910.
18. Paradza Daza, V., Munoz, R. de-A. and Gomes, A. (1995) A hybrid genetic algorithm for the two-dimensional guillotine cutting problem, in Biethan, J. and Nissen, V. (eds.) Evolutionary Algorithms in Management Applications, Berlin, pp. 183-196.
19. Poshyanonda, P., Bahrami, A. and Dagli, C. (1992) Artificial neural networks in stock cutting problem, in Neural Networks in Manufacturing and Robotics, Shin, Y. C., Abodelmonen, A. H. and Kumara, S. (eds.) ASME Press, New York, pp. 143-153.
20. Spears, W. M. and De Jong, K. A. (1990) Using neural networks and genetic algorithms as heuristics for NP-complete problems, in Proceedings of the International Joint Conference on Neural Networks IEEE, 1, 118-123.
21. Wang, P. Y. (1983) Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31, 573-586.