Abstract
This work presents a multi-objective approach to solve the Constrained 2D Cutting Stock Problem. The problem targets the cutting of a large rectangle of fixed dimensions in a set of smaller rectangles using orthogonal guillotine cuts. Although the problem is usually focused on a single objective, in this work we want to optimise the layout of rectangular parts on the sheet of raw material so as to maximise the total profit, as well as minimise the number of cuts to achieve the final demanded pieces. For this, we apply Multi-Objective Evolutionary Algorithms given its great effectiveness when dealing with other types real-world multi-objective problems. For the problem solution, we have implemented an encoding scheme which uses a post-fix notation. According to the two different optimisation criteria the approach provides a set of solutions offering a range of trade-offs between the two objectives, from which clients can choose according to their needs.
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
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183(3), 1109–1130 (2007)
Wang, P.Y.: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 31(3), 573–586 (1983)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation and Application. John Wiley, New York (1986)
Viswanathan, K.V., Bagchi, A.: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems. Operations Research 41(4), 768–776 (1993)
Hifi, M.: An Improvement of Viswanathan and Bagchi’s Exact Algorithm for Constrained Two-Dimensional Cutting Stock. Computer Operations Research 24(8), 727–736 (1997)
Cung, V.D., Hifi, M., Le-Cun, B.: Constrained Two-Dimensional Cutting Stock Problems: A Best-First Branch-and-Bound Algorithm. Technical Report 97/020, Laboratoire PRiSM, Université de Versailles (1997)
Burke, E.K., Kendall, G., Whitwell, G.: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research 52(4), 655–671 (2004)
Ntene, N., Van Vuuren, J.: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. Discrete Optimization 6(2), 174–188 (2009)
de Armas, J., Miranda, G., Leon, C., Segura, C.: Optimisation of a Multi-Objective Two-Dimensional Strip Packing Problem based on Evolutionary Algorithms. International Journal of Production Research 48(7), 2011 (2009)
Tiwari, S., Chakraborti, N.: Multi-objective optimization of a two-dimensional cutting problem using genetic algorithms. Journal of Materials Processing Technology 173, 384–393 (2006)
Ono, T., Ikeda, T.: Optimization of two-dimensional guillotine cutting by genetic algorithms. In: Zimmermann, H.J. (ed.) European Congress on Intelligent Techniques and Soft Computing, vol. 1, pp. 7–10 (1998)
Goldberg, D.E., Lingle, J.R.: Allelesloci and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 154–159. Lawrence Erlbaum, Mahwah (1985)
DEIS - Operations Research Group: Library of Instances: Bin Packing Problem, http://www.or.deis.unibo.it/research_pages/ORinstances/2CBP.html
Hifi, M.: 2D Cutting Stock Problem Instances, ftp://cermsem.univ-paris1.fr/pub/CERMSEM/hifi/2Dcutting/
Knowles, J.: A summary-attainment-surface plotting method for visualizing the performance of stochastic multiobjective optimizers. In: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications, pp. 552–557. IEEE Computer Society Press, Los Alamitos (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Armas, J., Miranda, G., León, C. (2011). A Multi-objective Approach for the 2D Guillotine Cutting Stock Problem. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21498-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-21498-1_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21497-4
Online ISBN: 978-3-642-21498-1
eBook Packages: Computer ScienceComputer Science (R0)