×

A population heuristic for constrained two-dimensional non-guillotine cutting. (English) Zbl 1056.90011

Summary: We present a heuristic algorithm for the constrained two-dimensional non-guillotine cutting problem. This is the problem of cutting a number of rectangular pieces from a single large rectangle so as to maximise the value of the pieces cut. In addition the number of pieces of each type that are cut must lie within prescribed limits. Our heuristic algorithm is a population heuristic, where a population of solutions to the problem are progressively evolved. This heuristic is based on a new, non-linear, formulation of the problem. Computational results are presented for a number of standard test problems taken from the literature and for a number of large randomly generated problems.

MSC:

90B10 Deterministic network models in operations research
90C59 Approximation methods and heuristics in mathematical programming

Software:

OR-Library
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] A. Amaral, A.N. Letchford, Improved upper bounds for a two-dimensional cutting problem, Working paper available from the second author at Department of Management Science, Management School, Lancaster University, Lancaster LA1 4YW, England, 1999
[2] A. Amaral, A.N. Letchford, Comment on an exact algorithm for general, orthogonal, two-dimensional knapsack problems, Working paper available from the second author at Department of Management Science, Management School, Lancaster University, Lancaster LA1 4YW, England, 1999
[3] Arenales, M.; Morabito, R., An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems, European journal of operational research, 84, 599-617, (1995) · Zbl 0928.90074
[4] ()
[5] Beasley, J.E., An exact two-dimensional non-guillotine cutting tree search procedure, Operations research, 33, 49-64, (1985) · Zbl 0569.90038
[6] Beasley, J.E., OR-library: distributing test problems by electronic mail, Journal of the operational research society, 41, 1069-1072, (1990)
[7] Beasley, J.E., Obtaining test problems via Internet, Journal of global optimization, 8, 429-433, (1996) · Zbl 0848.90126
[8] Beasley, J.E., Population heuristics, (), 138-157
[9] Beasley, J.E.; Chu, P.C., A genetic algorithm for the set covering problem, European journal of operational research, 94, 392-404, (1996) · Zbl 0953.90565
[10] Beasley, J.E.; Meade, N.; Chang, T.-J., An evolutionary heuristic for the index tracking problem, European journal of operational research, 148, 3, 621-643, (2003) · Zbl 1037.90038
[11] Beasley, J.E.; Sonander, J.; Havelock, P., Scheduling aircraft landings at London heathrow using a population heuristic, Journal of the operational research society, 52, 483-493, (2001) · Zbl 1088.90514
[12] Chang, T.-J.; Meade, N.; Beasley, J.E.; Sharaiha, Y.M., Heuristics for cardinality constrained portfolio optimisation, Computers and operations research, 27, 1271-1302, (2000) · Zbl 1032.91074
[13] Chazelle, B., The bottom-left bin-packing heuristic: an efficient implementation, IEEE transactions on computers C, 32, 697-707, (1983) · Zbl 0526.68065
[14] N. Christofides, Optimal cutting of two-dimensional rectangular plates, CAD74 Proceedings, 1974, pp. 1-10
[15] Christofides, N.; Whitlock, C., An algorithm for two-dimensional cutting problems, Operations research, 25, 30-44, (1977) · Zbl 0369.90059
[16] Chu, P.C.; Beasley, J.E., A genetic algorithm for the generalised assignment problem, Computers and operations research, 24, 17-23, (1997) · Zbl 0881.90070
[17] Chu, P.C.; Beasley, J.E., A genetic algorithm for the multidimensional knapsack problem, Journal of heuristics, 4, 63-86, (1998) · Zbl 0913.90218
[18] Chu, P.C.; Beasley, J.E., Constraint handling in genetic algorithms: the set partitioning problem, Journal of heuristics, 4, 323-357, (1998) · Zbl 1071.90573
[19] J.J. Dongarra, Performance of various computers using standard linear equations software, Working paper (2001) available from the author at Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301, USA. Also available at http://www.netlib.org/benchmark/performance.ps
[20] Dowsland, K.A.; Dowsland, W.B., Packing problems, European journal of operational research, 56, 2-14, (1992) · Zbl 0825.90355
[21] Dyckhoff, H., A typology of cutting and packing problems, European journal of operational research, 44, 145-159, (1990) · Zbl 0684.90076
[22] Fekete, S.P.; Schepers, J., A new exact algorithm for general orthogonal d-dimensional knapsack problems, Springer lecture notes in computer science, 1284, 144-156, (1997)
[23] S.P. Fekete, J. Schepers, On more-dimensional packing III: Exact algorithms, Report no. 97.290 available from the first author at Department of Mathematics, Technical University Berlin, D-10623 Berlin, Germany (1997), revised (2000)
[24] Hadjiconstantinou, E.; Christofides, N., An exact algorithm for general, orthogonal, two-dimensional knapsack problems, European journal of operational research, 83, 39-56, (1995) · Zbl 0903.90124
[25] Haessler, R.W.; Sweeney, P.E., Cutting stock problems and solution procedures, European journal of operational research, 54, 141-150, (1991) · Zbl 0736.90062
[26] Healy, P.; Creavin, M.; Kuusik, A., An optimal algorithm for rectangle placement, Operations research letters, 24, 73-80, (1999) · Zbl 0956.90034
[27] Holland, J.H., Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, (1975), University of Michigan Press · Zbl 0317.68006
[28] Jakobs, S., On genetic algorithms for the packing of polygons, European journal of operational research, 88, 165-181, (1996) · Zbl 0913.90229
[29] Lai, K.K.; Chan, J.W.M., Developing a simulated annealing algorithm for the cutting stock problem, Computers and industrial engineering, 32, 115-127, (1997)
[30] Lai, K.K.; Chan, W.M., An evolutionary algorithm for the rectangular cutting stock problem, International journal of industrial engineering, 4, 130-139, (1997)
[31] Leung, T.W.; Yung, C.H.; Troutt, M.D., Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem, Computers and industrial engineering, 40, 201-214, (2001)
[32] Mitchell, M., An introduction to genetic algorithms, (1996), MIT Press
[33] Reeves, C.R., Genetic algorithms, (), 151-196
[34] Reeves, C.R., Genetic algorithms for the operations researcher, INFORMS journal on computing, 9, 231-250, (1997) · Zbl 0893.90145
[35] Scheithauer, G.; Terno, J., Modeling of packing problems, Optimization, 28, 63-84, (1993) · Zbl 0818.90083
[36] Sweeney, P.E.; Paternoster, E.R., Cutting and packing problems: A categorized, application-orientated research bibliography, Journal of the operational research society, 43, 691-706, (1992) · Zbl 0757.90055
[37] Tsai, R.D.; Malstrom, E.M.; Meeks, H.D., A two-dimensional palletizing procedure for warehouse loading operations, IIE transactions, 20, 418-425, (1988)
[38] Wang, P.Y., Two algorithms for constrained two-dimensional cutting stock problems, Operations research, 31, 573-586, (1983) · Zbl 0517.90093
[39] Wu, Y.-L.; Huang, W.; Lau, S.-C.; Wong, C.K.; Young, G.H., An effective quasi-human based heuristic for solving the rectangle packing problem, European journal of operational research, 141, 341-358, (2002) · Zbl 1081.90615
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.