1D Bin Packing problem set used in the paper: Burke E. K., Hyde M. R. and Kendall G. (2010). “Providing a Memory Mechanism to Enhance the Evolutionary Design of Heuristics”. In Proceedings of the IEEE World Congress on Computational Intelligence (CEC 2010). July 18-23 2010, Barcelona, Spain, pp 3883–3890. The item sizes are drawn from gaussian distributions, and some are taken from two such distributions.

1D Bin-Packing Problems from SCHOLL/KLEIN/JUERGENS (1997) (Data sets: bin1data, bin2data, bin3data)

1D Bin-Packing Problems from FALKENAUER (1996) (Data sets: binpack1, binpack2, binpack3, binpack4, binpack5, binpack6, binpack7, binpack8)

These files are the test problems used in the paper Correia, Oliveira and Ferreira (2003). The objective is to minimise trim loss when producing and cutting master reels of paper into ordered reels and sheets.

The 28 VERY hard BPP instances of J. Schoenfield (with m from 140 to 200). Test results with an LP-based approach in (Data sets: hard28)

1D Bin-Packing Problems from SCHWERIN/WAESCHER (1998) (Files: sch_wae1, sch_wae2)

1D Bin-Packing Problems from WAESCHER/GAU (1996) (Files: wae_gau1, wae_gau2)

These instances are solutions to the 1D-CSP and are intended to provide a test-bed to evaluate pattern reduction heuristics, i.e. whether the solution be transformed into another with fewer patterns, but the same run length, order allocation and waste.

See for example

Foerster, H., & Wascher, G. (2000). Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 1657-1676.

Instances used in ‘Yanasse, H. H. and Morabito, R. (2006). Linear models for 1-group two-dimensional guillotine cutting problems. International Journal of Production Research,44:17,3471-3491. DOI: https://doi.org/10.1080/00207540500478603′.

Instances used in “François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud. Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. 2016.” (https://hal.inria.fr/hal-01426690/document)

2D Rectangular Strip Packing Problems (T and N) from HOPPER (2000) This set of guillotineable and non-guillotineable test problems with known optima was constructed with the problem generators described in Hopper (2000).

2D Unconstrained guillotine cutting data sets from CUI (2004) The test problems used in paper: Y Cui, Z Wang, J Li. Exact and heuristic algorithms for staged cutting problems.

2D Constrained non-guillotine cutting data sets (NGCUTFS) from FEKETE/SCHPERS (????) Files ngcutfs1, ngcutfs2 and ngcutfs3 contain the Fekete and Schepers problems (types I, II and III respectively) solved in the working paper.

2D Rectangular Bin Packing Problems (NGCUTBIN) from HOPPER/TURTON (2002) This file contains 12 test problems from Beasley (1985), which have been used in Hopper and Turton (2002) for comparison purposes.

2D Rectangular Bin Packing Problems (M) from HOPPER/TURTON (2002) This file contains three problem categories that consist of 100 and 150 rectangles.

2D Rectangular Bin Packing Problems (M) from HOPPER/TURTON (2002) This file contains three problem categories that consist of 100 and 150 rectangles.

2D Rectangular Strip Packing Problems (J) from JAKOBS (1996). This file contains two test problems from Jakobs (1996).

2D Rectangular Strip Packing Problems (J) from JAKOBS (1996). This file contains two test problems from Jakobs (1996).

2D Rectangular Bin Packing Problems (GCUTBIN) from HOPPER/TURTON (2002) This file contains 13 test problems from Beasley (1985), which have been used in Hopper and Turton (2002) for comparison purposes.

2D Rectangular Strip Packing Problems (D) DAGLI/POSHYANONDA (1997), RATANAPAN/DAGLI (1997) and RATANAPAN/DAGLI (1998). This file contains four test problems that were obtained from Dagli (1997), Ratanapan (1997) and Ratanapan (1998).

2D Rectangular Strip Packing Problems (D) DAGLI/POSHYANONDA (1997), RATANAPAN/DAGLI (1997) and RATANAPAN/DAGLI (1998). This file contains four test problems that were obtained from Dagli (1997), Ratanapan (1997) and Ratanapan (1998).

2D Rectangular Bin Packing Problems (CGCUTBIN) from HOPPER/TURTON (2002). This file contains three test problems from Christofides (1977), which have been used in Hopper and Turton (2002) for comparison purposes.

2D Constrained guillotine cutting data sets (CGCUT) from CHRISTOFIDES/WHITLOCK (1977). These data files are the 3 test problems from Table 2 of Christofides (1977) 30-44.

2D Rectangular Strip Packing Problems (C) from HOPPER/TURTON (2000) This file contains 21 test problems used in Hopper and Turton (2000). All problems are regular. The problem size lies between 16 to 197 items.

2D Assortment test problems (ASSORT) from BEASLEY (1985) These data files are the 12 test problems from Table 1 of Beasley (1985). Heuristic solution values are given in the above paper.

2D rectangular orthogonal guillotine cutting problem which arises in commercial printing. Minimize a function which is not the weighted sum of the rectangles as explained in “Expert-Level Job Ganging using Systematic and Local Search”. This file contains 22 problems from that paper.

Constrained 2D Guillotine Cutting Problem from MORABITO/PUREZA (2008) “A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem 2 (DOI 10.1007/s10479-008-0457-4). The data set contains 450 randomly generated unweighted test cases and 30 classic unweighted and weighted test cases for the Constrained Two-dimensional Guillotine Cutting Problem.

Two-dimensional variable sized bin packing problem test instances uses in “The two-dimensional bin packing problem with variable bin sizes and costs”, by David Pisinger, Mikkel Sigurd. iscrete Optimization, Volume 2, Issue 2, 30 June 2005, Pages 154-167, ISSN 1572-5286, DOI: 10.1016/j.disopt.2005.01.002.

This is a big data for 2D strip or rectangle packing problem. They are generated by combining zero-waste and non-zero-waste instances. The details can be find from the following papers: Defu Zhang, Lijun Wei, Stephen C. H. Leung, Qingshan Chen. A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip Packing Problem. INFORMS Journal on Computing 25 (2) (2013) 332-345. Leung SCH,Zhang D. A fast layer-based heuristic for non-guillotine strip packing. Expert Systems with Applications 38(10) (2011) 13032-13042. The details can see readme.txt in the attached file.

Unconstrained 2D guillotine cutting. Fifteen instances from: Mauro Russo, Antonio Sforza, Claudio Sterle, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, Computers & Operations Research, Volume 50, October 2014, Pages 97-114 (DOI: 10.1016/j.cor.2014.04.001). LW1-LW4 and LU1-LU4 date back to Hifi, M., Exact algorithms for large-scale unconstrained two and three staged cutting problems, Computational Optimization and Applications, 18 (1), (2001) , pp. 63-88 (DOI: 10.1023/A:1008743711658). New instances LW5, LU5, LX1-LX5. Unknown optimum for LU5 and LX5.

540 Irregular test instances artificially created data set with convex polygons. Procedure described by Terashima-Marín, H., Ross, P., Farías-Zárate, C. J., López-Camacho, E., and Valenzuela-Rendón, M. Generalized hyper-heuristics for solving 2D regular and irregular packing problems. Annals of Operations Research 179 (2010), 369-392

480 Irregular test instances artificially created data set with convex and non-convex polygons. Procedure described by López-Camacho, E. An Evolutionary Framework for Producing Hyper-heuristics for Solving the 2D Irregular Bin Packing Problem PhD Dissertation. Tecnológico de Monterrey, 2012.

Irregular test problem (ALBANO) from ALBANO/SAPPUPO (1980). Data set from the textile industry, scanned by E. Hopper from sample layout in Albano A. and Sappupo G., 1980, “Optimal Allocation of two-dimensional irregular shapes using heuristic search methods”, IEEE Transactions on Systems, Man and Cybernetics, SMC-10, 242-248.

2D Irregular data sets (BLAZ) from OLIVEIRA/GOMES/FERREIRA (2000) and HOPPER. Artificially created data set, based in Blazewicz J., Hawryluk P. and Walkowiak R., 1993, “Using a tabu search approach for solving the two-dimensional irregular cutting problem”, Annals of Operations Research 41, 313-327, coordinates stated in Oliveira J. F., Gomes A. M. and Ferreira S., 2000, “A new constructive algorithm for nesting problems”, OR Spectrum 22 (2), 263-284.

2D Irregular test problem (DAGLI) by HOPPER. Data set from the textile industry, scanned by E. Hopper from sample layout in Ratanapan K. and Dagli C. H., 1997, “An object-based evolutionary algorithm for solving irregular nesting problems”, In: Proceedings for Artificial Neural Networks in Engineering Conference (ANNIE’97), vol. 7, ASME Press, New York, pp. 383-388.

2D Irregular test problems (DIGHE) from DIGHE/JAKIELA (1996). Jigsaw problems (with known optimum), constructed by E. Hopper according to a sample layout in Dighe R. and Jakiela M. J., 1996, “Solving Pattern Nesting Problems with Genetic Algorithms Employing Task Decomposition and Contact Detection”, Evolutionary Computation 3, 239-266.

2D Irregular Strip Packing Problems (FU) from FUJITA/AKAGJI/KIROKAWA (1993). Artificially created data set, scanned by E. Hopper from sample layout in Fujita K., Akagji, S. and Kirokawa, N., 1993, “Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm”, Proceedings of the 19th Annual ASME Design Automation Conference, Part 1 (of 2), Albuquerque, NM, USA, vol. 65, part 1, pp. 477-484.

2D Irregular Strip Packing Problem (HAN) from HAN/NA (1996). Artificially created data set, scanned by E. Hopper from sample layout in Han G. C. and Na S. J., 1996, “Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing”, In: Proceedings of the Institute of Mechanical Engineers, Part B, Journal of Engineering Manufacture 210, B6, pp. 509-519.

2D Irregular Strip Packing Problems (JAKOBS) from JAKOBS (1996). Artificially created data set, constructed by E. Hopper from sample layout in Jakobs S., 1996, “On genetic algorithms for the packing of polygons”, European Journal of Operations Research 88, 165-181.

2D Irregular test problem (MAO) from BOUNSAYTHIP/MAOUCHE (1997). Data set from the textile industry, scanned by E. Hopper from sample layout in Bounsaythip C. and Maouche S., 1997, “Irregular shape nesting and placing with evolutionary approach”, In: Proceedings of the IEEE International Conference On Systems, Man and Cybernetics, vol. 4, pp. 3425-3430.

2D Irregular test problem (MARQUES) from MARQUES/BISPO/SENTIEIRO 1991. Data set from the textile industry, scanned by E. Hopper from sample layout in Marques V. M. M., Bispo C. F .G. and Sentieiro J. J. S., 1991, “A system for the compaction of two-dimensional irregular shapes based on simulated annealing”, Proceedings of the 1991 International Conference on Industrial Electronics, Control and Instrumentation – IECON ’91, Kobe, Japan, Oct. 1991, pp. 1911-1916.

poly1a – poly2a – poly2b – poly3a – poly3b – poly4a – poly4b – poly5a – poly5b – readme – test_data_irreg – irr

2D Irregular Strip Packing Problems (POLY) from HOPPER. Artificially created data set, coordinates stated in Hopper, Eva, “Two-dimensional Packing utilising Evolutionary Algorithms and other Meta-Heuristic Methods”, PhD Thesis, Cardiff University, School of Engineering, 2000.

2D Irregular data sets (SHAPES) from OLIVEIRA/GOMES/FERREIRA (2000). Artificially created data set, coordinates stated in Oliveira J. F., Gomes A. M. and Ferreira S., 2000, “A new constructive algorithm for nesting problems”, OR Spectrum 22 (2), 263-284.

2D Irregular data set (SHIRTS) from OLIVEIRA/GOMES/FERREIRA (2000). Data set from the textile industry, instance initially used in Dowsland K. A., Dowsland W. B. and Bennell J. A., 1998, “Jostling for position: local improvement for irregular cutting patterns”, Journal of the Operational Research Society 49, 647-658, coordinates stated in Oliveira J. F., Gomes A. M. and Ferreira S., 2000, “A new constructive algorithm for nesting problems”, OR Spectrum 22 (2), 263-284.

2D Irregular data set (SHIRTS) from OLIVEIRA/GOMES/FERREIRA (2000). Data set from the textile industry, instance initially used in Dowsland K. A., Dowsland W. B. and Bennell J. A., 1998, “Jostling for position: local improvement for irregular cutting patterns”, Journal of the Operational Research Society 49, 647-658, coordinates stated in Oliveira J. F., Gomes A. M. and Ferreira S., 2000, “A new constructive algorithm for nesting problems”, OR Spectrum 22 (2), 263-284.

2D Irregular data set (TROUSERS) from OLIVEIRA/GOMES/FERREIRA (2000). Data set from the textile industry, coordinates stated in Oliveira J. F., Gomes A. M. and Ferreira S., 2000, “A new constructive algorithm for nesting problems”, OR Spectrum 22 (2), 263-284.

2D Irregular data sets (THREE) from ALVAREZ-VALDES et. al. (2013). Artificially created data set, based in Alvarez-Valdes, R., A. Martinez, and J. Tamarit, 2013 “A branch & bound algorithm for cutting and packing irregularly shaped pieces”, International Journal of Production Economics 145 (2), 463 – 477.

Irregular_Guillotine_Bin_Packing

Irregular Guillotine Packing

The file contain the test problems used in Alonso et al (2018). The problem deal with a number of layers demanded for a specific day. The layers have to be stacked in pallets and the pallets are loaded into trucks according to the day demanded.

These instances have been provided courtesy by ORTEC.

A company that has to serve its customers by first putting the products on pallets and then loading pallets onto trucks. When a large number of units of a product have to be shipped, the company requires that homogeneous pallets, with only one product (stock pallets), are built first, then weakly heterogeneous pallets, in which each layer corresponds to a single product (case pallets), and finally strongly heterogeneous pallets with the remaining units of the products (rest pallets).

These instances have been provided courtesy by ORTEC.

3D Container loading problem (THPACK9 IMM) from IVANCIC/MATHUR/MOHANTY (1989) This data was originally used in Ivancic (1989) and then in Bischoff (1995).

3D Container loading problem (THPACK8 LN) from LOH/NEE (1992) This data was originally used in Loh (1992) and then in Ngoi (1994) and then in Bischoff (1995).

3D Container loading problems (THPACK1-7 BR) from BISCHOFF/RATCLIFF (1995) These files were generated and used in Bischoff (1995). The procedure used to create these test problems is presented in the paper.

3D Boxes on shelves test problems (BAYTP) from HOARE/BEASLEY (2001) These data files are the test problems used in the paper Hoare (2001).

This dataset includes the instances for the 3D Irregular packing problems solved in: “Voxel-based solution approaches to the 3D irregular packing problem”, C. Lamas-Fernandez, A. Martinez Sykora, J. Bennell

Solving a VRPTW, the solutions guarantee that goods arrive at the client on time.

These files are the test problems used in the paper Correia, Oliveira and Ferreira (2011). The objective is to minimise paper production to satisfy orders of reels and sheets, considering simultaneous production planning of different grades of paper.