Abstract
In rail-vehicle manufacturing enterprises, material costs are main part of total costs, so nesting optimization and material quota is important for enterprise’s cost control and supply chain management. Because most parts are rectangular, rectangular object layout is solved first in nesting optimization. Rectangular object layout is not a simple NP (nondeterministic polynomial) optimization problem because of the practical production rules, such as guillotine. Under certain situations, the guillotine is even more important than the pure using ratio of metal sheets. The purpose of this paper is to construct the model of genetic algorithm and design the genetic operators for a practical case. Combined with the lowest-horizontal-line search algorithm, Genetic algorithm model is applied into rectangular object layout optimization. Results show that the model can satisfy not only the practical production requirements of guillotine, but also the requirement for production convenience. In this way, users can get optimal layout results and a higher material using ratio for practical production effectively and quickly.
The research work presented in this paper was sponsored by State Key Technologies R&D Program (Grant No. 2006BAF01A01).
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
Yang, W., Liu, S., Luo, Y.: Genetic algorithm for large scale rectangular object optimal embed placement. Journal of Sichuan University 33(5), 35–38 (2001)
Cao, J., Zhou, J.: An approximate algorithm for rectangular cutting stock problem. Journal of computer aided design & computer graghics 7(3), 190–195 (1995)
Healy, P.: An optimal algorithm for rectangle placement. The Operations Research Letters 24, 73–80 (1999)
Gilmore, C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Operations Research 9, 849–859 (1961)
Gilmore, C., Gomory, R.E.: A linear programming approach to the cutting stock problem II. Operations Research 11, 863–888 (1963)
Gilmore, C., Gomory, R.E.: Multistage cutting stock problems of two and more dimensions. Operations Research 13, 94–120 (1965)
Gilmore, C., Gomory, R.E.: The theory and computation of Knap sack functions. Operations Research 13, 94–120 (1965)
Special Interest Group on Cutting and Packing Problem (SICUP), http://prodlog.wiwi.uni-halle.de/sicup
Farley, A.A.: Mathematical programming models for cutting-stock problems in the clothing industry. Journal of the Operational Research Society 39(l), 41–53 (1988)
Hinxman, A.I.: The trim-loss and assortment problem: a survey. European Journal of Operational Research and Development 16, 462–469 (1980)
Beasley, J.E.: Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36(4), 297–306 (1985)
Segenreich, S.A., Braga, F.: Optimal Nesting of General of Peane Figures: A Monte Carlo Heuristic Approach. Computers and Graphics 10(3), 229–238 (1986)
Jakobs, S.: Theory and methodology on genetic algorithms for the packing of polygons. The European Journal of Operational Research 88, 165–181 (1996)
Huang, H., Cui, Y.: Optimizing cutting pattern in rectangular packing problem by genetic algorithm. Guangxi Normal University (2005)
Yang, C., Gu, H., Shi, J.: Optimized layout of rectangular work piece using mixed genetic algorithm. Forging & Stamping Technology 30(3), 4–7 (2005)
Zhihui, L., Xingmei, H.: The system of the rectangles cutting stock problem based on genetic algorithm. Hunan University, 11 (2006)
Hopper, E., Turton, B.: Application of Genetic Algorithms to Packing Problems-A Review. In: Proceeding of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing, pp. 279–288. Springer, London (1997)
Zhang, K., Lin, J.: The research of the optimal layout of rectangular part. Shandong University (2006)
Zhou, M., Sun, S.: Genetic algorithm theory and applications. National defense industry press (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mi, X., Zhao, X., Zhao, W., Fan, W. (2008). Case Study on Optimization of Rectangular Object Layout by Genetic Algorithm. In: Shen, W., Yong, J., Yang, Y., Barthès, JP.A., Luo, J. (eds) Computer Supported Cooperative Work in Design IV. CSCWD 2007. Lecture Notes in Computer Science, vol 5236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92719-8_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-92719-8_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92718-1
Online ISBN: 978-3-540-92719-8
eBook Packages: Computer ScienceComputer Science (R0)