{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:38:23Z","timestamp":1766086703510},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T00:00:00Z","timestamp":1314748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10732-011-9187-x","type":"journal-article","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T19:36:38Z","timestamp":1314732998000},"page":"253-273","source":"Crossref","is-referenced-by-count":11,"title":["A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company"],"prefix":"10.1007","volume":"19","author":[{"given":"Carlos","family":"Gracia","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Andr\u00e9s","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Gracia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,31]]},"reference":[{"key":"9187_CR1","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.ejor.2008.04.005","volume":"196","author":"T. Aktin","year":"2009","unstructured":"Aktin, T., \u00d6zdemir, R.G.: An integrated approach to the one dimensional cutting stock problem in coronary stent manufacturing. Eur. J. Oper. Res. 196, 737\u2013743 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR2","doi-asserted-by":"crossref","first-page":"1315","DOI":"10.1016\/j.cor.2006.08.014","volume":"35","author":"C. Alves","year":"2008","unstructured":"Alves, C., Val\u00e9rio\u00a0de\u00a0Carvalho, J.M.: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Comput. Oper. Res. 35, 1315\u20131328 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9187_CR3","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/S0278-6125(00)87642-6","volume":"18","author":"S. Anand","year":"1999","unstructured":"Anand, S., McCord, C., Sharma, R., et al.: An integrated machine vision based system for solving the nonconvex cutting stock problem using genetic algorithms. J. Manuf. Syst. 18, 396\u2013415 (1999)","journal-title":"J. Manuf. Syst."},{"key":"9187_CR4","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/S0377-2217(02)00125-X","volume":"141","author":"G. Belov","year":"2002","unstructured":"Belov, G., Scheithauer, G.: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. 141, 274\u2013294 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","volume":"83","author":"N. Christofides","year":"1995","unstructured":"Christofides, N., Hadjiconstantinou, E.: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur. J. Oper. Res. 83, 21\u201338 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10732-009-9102-x","volume":"16","author":"R. Elizondo","year":"2010","unstructured":"Elizondo, R., Parada, V., Pradenas, L., Artigues, C.: An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport. J. Heuristics 16, 575\u2013591 (2010)","journal-title":"J. Heuristics"},{"key":"9187_CR7","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10732-008-9089-8","volume":"16","author":"L. Fan","year":"2010","unstructured":"Fan, L., Mumford, C.L.: A metaheuristic approach to the urban transit routing problem. J. Heuristics 16, 353\u2013372 (2010)","journal-title":"J. Heuristics"},{"key":"9187_CR8","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T. Gau","year":"1995","unstructured":"Gau, T., W\u00e4scher, G.: CUTGEN1: a problem generator for the standard one-dimensional cutting stock problem. Eur. J. Oper. Res. 84, 572\u2013579 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR9","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"9187_CR10","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Part II. Oper. Res. 11, 863\u2013888 (1963)","journal-title":"Oper. Res."},{"key":"9187_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10732-008-9097-8","volume":"16","author":"G. Ghiani","year":"2010","unstructured":"Ghiani, G., Lagan\u00e0, G., Laporte, G., Mari, F.: Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Heuristics 16, 211\u2013233 (2010)","journal-title":"J. Heuristics"},{"key":"9187_CR12","author":"J.F. Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, G.C.: Biased random-key genetic algorithms for combinatorial optimization. J.\u00a0Heuristics (2011). doi: 10.1007\/s10732-010-9143-1","journal-title":"J.\u00a0Heuristics"},{"key":"9187_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(98)00140-4","volume":"114","author":"M. Gradisar","year":"1999","unstructured":"Gradisar, M., Kljajic, M., Resinovic, G., et al.: A sequential heuristic procedure for one-dimensional cutting. Eur. J. Oper. Res. 114, 557\u2013568 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(92)90074-U","volume":"16","author":"R.W. Haessler","year":"1992","unstructured":"Haessler, R.W.: One-dimensional cutting stock problems and solution procedures. Math. Comput. Model. 16, 1\u20138 (1992)","journal-title":"Math. Comput. Model."},{"issue":"2","key":"9187_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0377-2217(91)90293-5","volume":"54","author":"R.W. Haessler","year":"1991","unstructured":"Haessler, R.W., Sweeney, P.E.: Cutting stock problems and solution procedures. Eur. J. Oper. Res. 54(2), 141\u2013150 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0305-0483(79)90102-6","volume":"7","author":"R.W. Haessler","year":"1979","unstructured":"Haessler, R.W.: Solving the two-stage cutting stock problem. Omega 7, 145\u2013151 (1979)","journal-title":"Omega"},{"key":"9187_CR17","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-60154-6_54","volume-title":"Progress in Evolutionary Computation","author":"R. Hinterding","year":"1995","unstructured":"Hinterding, R., Khan, L.: Genetic algorithms for cutting stock problems: with and without contiguity. In: Yao, X. (ed.) Progress in Evolutionary Computation. LNAI, vol. 956, pp. 166\u2013186. Springer, Berlin (1995)"},{"key":"9187_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0377-2217(02)00126-1","volume":"141","author":"O. Holthaus","year":"2002","unstructured":"Holthaus, O.: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. Eur. J. Oper. Res. 141, 295\u2013312 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L.V. Kantorovich","year":"1939","unstructured":"Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6, 366\u2013422 (1939) (Translation to English 1960)","journal-title":"Manag. Sci."},{"key":"9187_CR20","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0305-0548(01)00039-9","volume":"29","author":"K. Liang","year":"2002","unstructured":"Liang, K., Yao, X., Newton, C., et al.: A new evolutionary approach to cutting stock problems with and without contiguity. Comput. Oper. Res. 29, 1641\u20131659 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9187_CR21","doi-asserted-by":"crossref","first-page":"2074","DOI":"10.1016\/j.cor.2008.07.001","volume":"36","author":"K. Poldi","year":"2009","unstructured":"Poldi, K., Arenales, M.: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Comput. Oper. Res. 36, 2074\u20132081 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9187_CR22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0925-5273(01)00134-7","volume":"74","author":"S.M.A. Suliman","year":"2001","unstructured":"Suliman, S.M.A.: Pattern generating procedure for the cutting stock problem. Int. J. Prod. Econ. 74, 293\u2013301 (2001)","journal-title":"Int. J. Prod. Econ."},{"key":"9187_CR23","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.-G. Talbi","year":"2002","unstructured":"Talbi, E.-G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8, 541\u2013564 (2002)","journal-title":"J. Heuristics"},{"key":"9187_CR24","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0377-2217(95)00198-0","volume":"95","author":"R. Vahrenkamp","year":"1996","unstructured":"Vahrenkamp, R.: Random search in the one-dimensional cutting stock problem. Eur. J. Oper. Res. 95, 191\u2013200 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR25","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"48","author":"F. Vanderbeck","year":"2000","unstructured":"Vanderbeck, F.: Exact algorithm for minimizing the number of set ups in the one dimensional cutting stock problems. Oper. Res. 48, 915\u2013926 (2000)","journal-title":"Oper. Res."},{"key":"9187_CR26","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/S0377-2217(98)00244-6","volume":"117","author":"B.J. Wagner","year":"1999","unstructured":"Wagner, B.J.: A genetic algorithm solution for one-dimensional bundled stock cutting. Eur. J. Oper. Res. 117, 368\u2013381 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9187_CR27","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9187-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9187-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9187-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:32Z","timestamp":1559256872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9187-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,31]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9187"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9187-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,31]]}}}