Summary
This chapter describes two kinds of the optimal cutting methods of material using genetic algorithms. The first is the optimal cutting of bars to satisfy two requirements of the minimum length of scraps produced and the balance among the numbers of finished products of each length to meet customer’s order, when a series of raw bars are cut to various ordered length. The second is to determine the layout of various patterns to be cut on a sheet to make the required sheet length minimum. By combining layout determing algorithms(LDAs) with order-type genetic algorithms the required calculation time is considerably reduced. System configuration including the expression of genes, fitness function and how to integrate other proper systems into genetic algorithms, and the results of simulation studies are explained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chauny, F. and Loulou, R. et al. : A Two-phase Heuristic for the Twodimensional Cutting-stock Problem, Journal of the Operational Research Society, Vol.42, No.1, pp.39–47, 1991
Christofides, N. and Hadjiconstantinou, E. : An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts, European Journal of Operational Research 83, pp.21–38, 1995
Davis, L. Ed. : Handbook of Genetic Algorithms, Van Nostrand Reinhold, 385p, 1991
Dyson, R. G. and Gregory, A. S. : The Cutting Stock Problem in the Flat Glass Industry, Operational Research Quarterly, Vol.25, No.1, pp.41–53, 1974
Goldberg, D.E. : Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Pub. Co., 412p, 1989
Holland, J.H. : Adaptation in Natural and Artificial Systems, The University of Michigan Press, 211p, 1975
Jakobs, S. : On genetic algorithms for the packing of polygons, Proc. of the KI-94 Workshop, pp.84–85, 1994
Michalewicz, Z. : Genetic Algorithms + Data Structures = Evolution Programs, Second, Extended Edition, Springer-Verlag, 340p, 1994
Ono, T. : Application of Neural Networks to Optimal Selection of Cutting Length of Bars (in Japanese), T.IEE Japan, Vol. 113-D, No.12, pp.1371–1377,1993
Ono, T. and Watanabe, G. : Application of Genetic Algorithms to Optimizing Problems(In Japanese), Language and Information Processing (Fukuoka Institute of Technology), Vol.6, pp.89–96, 1995
Ono, T. and Watanabe, G. : Application of Genetic Algorithms to Optimal Selection of Cutting Length of Bars, Proceedings of Fifth FIT-Ajou University Joint Seminar, pp.24–31, 1995
Petridis, V. and Kazarlis, S. : Varying Quality Function in Genetic Algorithms and The Cutting Problem, Proc. of the First IEEE Conf. on Evolutionary Computation, pp.166–169, 1994
Vasko, F. J. : A computational improvement to Wang’s two-dimensional cutting stock algorithm, Computers ind. Engng, Vol.16, No.1, pp.109–115, 1989
Whitley, L.D. and Vose, M.D. Ed. : Foundations of Genetic Algorithms.3, Morgan Kaufmann Pub., 336p, 1995
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ono, T., Watanabe, G. (1997). Genetic Algorithms for Optimal Cutting. In: Dasgupta, D., Michalewicz, Z. (eds) Evolutionary Algorithms in Engineering Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03423-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-662-03423-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08282-5
Online ISBN: 978-3-662-03423-1
eBook Packages: Springer Book Archive