Skip to content

README.md

Latest commit

 

History

History
34 lines (26 loc) · 2.99 KB

README.md

File metadata and controls

34 lines (26 loc) · 2.99 KB

1D

  • correia

    • Correia, M. H., Oliveira, J. F., & Ferreira, J. S. (2004). Reel and sheet cutting at a paper mill. Computers & Operations Research, 31(8), 1223-1243. DOI: https://doi.org/10.1016/S0305-0548(03)00076-5
    • The objective is to minimize trim loss when producing and cutting master reels of paper into ordered reels and sheets.

  • dualdistribution

    • 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. DOI: https://doi.org/10.1109/CEC.2010.5586388
    • The item sizes are drawn from gaussian distributions, and some are taken from two such distributions.

  • falkenauer

    • Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of heuristics, 2(1), 5-30. DOI: https://doi.org/10.1007/BF00226291
    • 1D Bin-Packing Problems from FALKENAUER (1996) (Data sets: binpack1, binpack2, binpack3, binpack4, binpack5, binpack6, binpack7, binpack8)

  • hard28

    • Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting. European journal of operational research, 171(1), 85-106. DOI: https://doi.org/10.1016/j.ejor.2004.08.036
    • The 28 VERY hard BPP instances of J. Schoenfield (with m from 140 to 200).

  • PatternReductionTestInstances

    • 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.

  • scholl

    • Scholl, A., Klein, R., & Jürgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7), 627-645. DOI: https://doi.org/10.1016/S0305-0548(96)00082-2
    • 1D Bin-Packing Problems (Data sets: bin1data, bin2data, bin3data)

  • schwerin

    • Schwerin, P., & Wäscher, G. (1997). The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP. International transactions in operational research, 4(5-6), 377-389. DOI: https://doi.org/10.1111/j.1475-3995.1997.tb00093.x
    • 1D Bin-Packing Problems (Files: sch_wae1, sch_wae2)

  • waescher

    • Wäscher, G., & Gau, T. (1996). Heuristics for the integer one-dimensional cutting stock problem: A computational study. Operations-Research-Spektrum, 18(3), 131-144. DOI: https://doi.org/10.1007/BF01539705
    • 1D Bin-Packing Problems (Files: wae_gau1, wae_gau2)