Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock Selection

  • Laura ClimentEmail author
  • Barry O’Sullivan
  • Steven D. Prestwich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10079)


In this paper we deal with a variant of the Multiple Stock Size Cutting Stock Problem (MSSCSP) arising from population harvesting, in which some sets of large pieces of raw material (of different shapes) must be cut following certain patterns to meet customer demands of certain product types. The main extra difficulty of this variant of the MSSCSP lies in the fact that the available patterns are not known a priori. Instead, a given complex algorithm maps a vector of continuous variables called a values vector into a vector of total amounts of products, which we call a global products pattern. Modeling and solving this MSSCSP is not straightforward since the number of value vectors is infinite and the mapping algorithm consumes a significant amount of time, which precludes complete pattern enumeration. For this reason a representative sample of global products patterns must be selected. We propose an approach to bounding the search space of the values vector and an algorithm for performing an exhaustive sampling using such bounds. Our approach has been evaluated with real data provided by an industry partner.



This research was supported in part by Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289.


  1. 1.
    Anderson, D., Sweeney, D., Williams, T., Camm, J., Cochran, J.: An Introduction to Management Science: Quantitative Approaches to Decision Making. Cengage Learning, Boston (2015)Google Scholar
  2. 2.
    Bellman, R., Dreyfus, S.: Applied Dynamic Programming. Princeton University Press, Princeton (1962)CrossRefzbMATHGoogle Scholar
  3. 3.
    Dyckhoff, H.: A typology of cutting and packing problems. Eur. J. Oper. Res. 44(2), 145–159 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Getz, W.M., Haight, R.G.: Population Harvesting: Demographic Models of Fish, Forest, and Animal Resources, vol. 27. Princeton University Press, Princeton (1989)Google Scholar
  5. 5.
    Gradišar, M., Kljacić, M., Resinovič, G., Jesenko, J.: A sequential heuristic procedure for one-dimensional cutting. Eur. J. Oper. Res. 114, 557–568 (1999)CrossRefzbMATHGoogle Scholar
  6. 6.
    Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6(4), 366–422 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Prestwich, S.D., Fajemisin, A.O., Climent, L., O’Sullivan, B.: Solving a hard cutting stock problem by machine learning and optimisation. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Soares, C., Gama, J., Jorge, A. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9284, pp. 335–347. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-23528-8_21 CrossRefGoogle Scholar
  8. 8.
    Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Laura Climent
    • 1
    Email author
  • Barry O’Sullivan
    • 1
  • Steven D. Prestwich
    • 1
  1. 1.Insight Centre for Data Analytics, Department of Computer ScienceUniversity College CorkCorkIreland

Personalised recommendations