{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T18:22:17Z","timestamp":1746642137842,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992587"},{"type":"electronic","value":"9783319992594"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99259-4_30","type":"book-chapter","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T13:28:18Z","timestamp":1534771698000},"page":"373-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Tailoring Instances of the 1D Bin Packing Problem for Assessing Strengths and Weaknesses of Its Solvers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"Ivan","family":"Amaya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6270-3164","authenticated-orcid":false,"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-0773","authenticated-orcid":false,"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8435-680X","authenticated-orcid":false,"given":"Carlos A.","family":"Coello Coello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"issue":"11","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley, J.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-55453-2_13","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"JH Drake","year":"2017","unstructured":"Drake, J.H., Swan, J., Neumann, G., \u00d6zcan, E.: Sparse, continuous policy representations for uniform online bin packing via regression of interpolants. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 189\u2013200. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_13"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10710-017-9301-4","volume":"19","author":"JC Gomez","year":"2017","unstructured":"Gomez, J.C., Terashima-Mar\u00edn, H.: Evolutionary hyper-heuristics for tackling bi-objective 2D bin packing problems. Genet. Program. Evol. Mach. 19, 151\u2013181 (2017). https:\/\/doi.org\/10.1007\/s10710-017-9301-4","journal-title":"Genet. Program. Evol. Mach."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"van Hemert, J.I.: Evolving binary constraint satisfaction problem instances that are difficult to solve. In: Proceedings of the 2003 IEEE Congress on Evolutionary Computation (CEC 2003), pp. 1267\u20131273. IEEE Press (2003)","DOI":"10.1109\/CEC.2003.1299814"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1162\/evco.2006.14.4.433","volume":"14","author":"JI Hemert van","year":"2006","unstructured":"van Hemert, J.I.: Evolving combinatorial problem instances that are difficult to solve. Evol. Comput. 14(4), 433\u2013462 (2006)","journal-title":"Evol. Comput."},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000)","journal-title":"Evol. Comput."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Camacho, E., Terashima-Mar\u00edn, H., Ross, P.: A hyper-heuristic for solving one and two-dimensional bin packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 257\u2013258 (2011). https:\/\/doi.org\/10.1145\/2001858.2002003","DOI":"10.1145\/2001858.2002003"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1475-3995.2011.00840.x","volume":"19","author":"T Lust","year":"2012","unstructured":"Lust, T., Teghem, J.: The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19(4), 495\u2013520 (2012)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Vigo, D.: The three-dimensional bin packing problem. Oper. Res. 48(2), 256\u2013267 (2000)","journal-title":"Oper. Res."},{"key":"30_CR11","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"\u00d6zcan, E., Parkes, A.J.: Policy matrix evolution for generation of heuristics. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation - GECCO 2011, p. 2011 (2011). https:\/\/doi.org\/10.1145\/2001576.2001846","DOI":"10.1145\/2001576.2001846"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Petursson, K.B., Runarsson, T.P.: An evolutionary approach to the discovery of hybrid branching rules for mixed integer solvers. In: Proceedings - 2015 IEEE Symposium Series on Computational Intelligence, SSCI 2015, pp. 1436\u20131443 (2016)","DOI":"10.1109\/SSCI.2015.204"},{"issue":"9","key":"30_CR14","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., van Hemert, J.: Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann. Math. Artif. Intell. 61(2), 87\u2013104 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-13800-3_29","volume-title":"Learning and Intelligent Optimization","author":"K Smith-Miles","year":"2010","unstructured":"Smith-Miles, K., van Hemert, J., Lim, X.Y.: Understanding TSP difficulty by learning from evolved instances. In: Blum, C., Battiti, R. (eds.) LION 2010. LNCS, vol. 6073, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13800-3_29"},{"key":"30_CR17","doi-asserted-by":"publisher","unstructured":"Sosa-Ascencio, A., Terashima-Mar\u00edn, H., Ortiz-Bayliss, J.C., Conant-Pablos, S.E.: Grammar-based selection hyper-heuristics for solving irregular bin packing problems. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion - GECCO 2016 Companion, pp. 111\u2013112. ACM Press, New York (2016). https:\/\/doi.org\/10.1145\/2908961.2908970","DOI":"10.1145\/2908961.2908970"},{"key":"30_CR18","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. In: Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, pp. 95\u2013100 (2001)"},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99259-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T12:44:53Z","timestamp":1571748293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99259-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992587","9783319992594"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99259-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}