{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T19:10:10Z","timestamp":1746385810043,"version":"3.40.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319109596"},{"type":"electronic","value":"9783319109602"}],"license":[{"start":{"date-parts":[[2014,9,21]],"date-time":"2014-09-21T00:00:00Z","timestamp":1411257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,9,21]],"date-time":"2014-09-21T00:00:00Z","timestamp":1411257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-10960-2_10","type":"book-chapter","created":{"date-parts":[[2014,9,20]],"date-time":"2014-09-20T11:40:07Z","timestamp":1411213207000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clustering Bin Packing Instances for Generating a Minimal Set of Heuristics by Using Grammatical Evolution"],"prefix":"10.1007","author":[{"given":"Marco Aurelio","family":"Sotelo-Figueroa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor Jos\u00e9","family":"Puga Soberanes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Mart\u00edn","family":"Carpio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9ctor J.","family":"Fraire Huacuja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura Cruz","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge Alberto","family":"Soria Alcaraz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,21]]},"reference":[{"key":"10_CR1","unstructured":"Feigenbaum, E.A., Feldman, J.: Computers and Thought. AAAI Press (1963)"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1111\/j.1467-8640.1985.tb00058.x","volume":"1","author":"MHJ Romanycia","year":"1985","unstructured":"Romanycia, M.H.J., Pelletier, F.J.: What is a heuristic? Comput. Intell. 1(1), 47\u201358 (1985)","journal-title":"Comput. Intell."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"FW Glover","year":"1986","unstructured":"Glover, F.W.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"10_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979)"},{"key":"10_CR5","unstructured":"Koza, J.R.: Hierarchical genetic algorithms operating on populations of computer programs. In: IJCAI. pp. 768\u2013774 (1989)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel Problem Solving from Nature\u2014PPSN IX","author":"EK Burke","year":"2006","unstructured":"Burke, E.K., Hyde, M., Kendall, G.: Evolving bin packing heuristics with genetic programming. In: Runarsson, T., Beyer, H.G., Burke, E., Merelo-Guerv\u00f3s, J., Whitley, L., Yao, X. (eds.) Parallel Problem Solving from Nature\u2014PPSN IX. Lecture Notes in Computer Science, vol. 4193, pp. 860\u2013869. Springer, Berlin, Heidelberg (2006)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ryan, C., Collins, J., Collins, J., O\u2019Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Proceedings of the First European Workshop on Genetic Programming, Lecture Notes in Computer Science 1391, pp. 83\u201395. Springer (1998)","DOI":"10.1007\/BFb0055930"},{"key":"10_CR8","unstructured":"M., O., A, B.: Grammatical differential evolution. In: International Conference on Artificial Intelligence (ICAI\u201906). CSEA Press, Las Vegas, Nevada (2006)"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s11047-006-9007-7","volume":"5","author":"M O\u2019Neill","year":"2006","unstructured":"O\u2019Neill, M., Brabazon, A.: Grammatical swarm: The generation of programs by social programming. Nat. Comput. 5(4), 443\u2013462 (2006)","journal-title":"Nat. Comput."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Togelius, J., Nardi, R.D., Moraglio, A.: Geometric pso\u00a0+\u00a0gp\u00a0=\u00a0particle swarm programming. IEEE Congress on Evolutionary Computation, pp. 3594\u20133600 (2008)","DOI":"10.1109\/CEC.2008.4631284"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-12148-7_15","volume-title":"Genetic Programming","author":"A Moraglio","year":"2010","unstructured":"Moraglio, A., Silva, S.: Geometric differential evolution on the space of genetic programs. In: Esparcia-Alc\u00e1zar, A., Ek\u00e1rt, A., Silva, S., Dignum, S., Uyar, A. (eds.) Genetic Programming. Lecture Notes in Computer Science, vol. 6021, pp. 171\u2013183. Springer, Berlin \/ Heidelberg (2010)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Sotelo-Figueroa, M.A., Puga\u00a0Soberanes, H.J., Mart\u00edn\u00a0Carpio, J., Fraire\u00a0Huacuja, H.J., Reyes, C.L., Soria-Alcaraz, J.A.: Evolving bin packing heuristic using micro-differential evolution with indirect representation. In: Castillo, O., Melin, P., Kacprzyk, J. (eds.) Recent Advances on Hybrid Intelligent Systems, Studies in Computational Intelligence, vol. 451, pp. 349\u2013359. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-33021-6_28"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Allen, S., Burke, E.K., Hyde, M., Kendall, G.: Evolving reusable 3d packing heuristics with genetic programming. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. pp. 931\u2013938. GECCO\u201909, ACM, New York (2009)","DOI":"10.1145\/1569901.1570029"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Fukunaga, A.S.: Evolving local search heuristics for sat using genetic programming. In: Genetic and Evolutionary Computation\u2014GECCO 2004, Lecture Notes in Computer Science, vol. 3103, pp. 483\u2013494. Springer Berlin, Heidelberg (2004)","DOI":"10.1007\/978-3-540-24855-2_59"},{"issue":"12","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1057\/jors.2012.149","volume":"64","author":"MR Hyde","year":"2013","unstructured":"Hyde, M.R., Burke, E.K., Kendall, G.: Automated code generation by local search. J. Oper. Res. Soc. 64(12), 1725\u20131741 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"10_CR16","unstructured":"Hyde, M.: A Genetic programming hyper-heuristic approach to automated packing. Ph.D. thesis, University of Nottingham (2010)"},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3(4), 299\u2013325 (1974)","journal-title":"SIAM J. Comput."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/322186.322187","volume":"27","author":"ACC Yao","year":"1980","unstructured":"Yao, A.C.C.: New algorithms for bin packing. J. ACM 27, 207\u2013227 (1980)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.18.2.438","volume":"18","author":"WT Rhee","year":"1993","unstructured":"Rhee, W.T., Talagrand, M.: On line bin packing with items of random size. Math. Oper. Res. 18(2), 438\u2013445 (1993)","journal-title":"Math. Oper. Res."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Coffman, E., Jr., Galambos, G., Martello, S., Vigo, D.: Bin Packing Approximation Algorithms: Combinatorial Analysis. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4757-3023-4_3"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02283751","volume":"16","author":"T K\u00e4mpke","year":"1988","unstructured":"K\u00e4mpke, T.: Simulated annealing: Use of a new tool in bin packing. Ann. Oper. Res. 16, 327\u2013332 (1988)","journal-title":"Ann. Oper. Res."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2, 5\u201330 (1996)","journal-title":"J. Heuristics"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Ponce-P\u00e9rez, A., P\u00e9rez-Garcia, A., Ayala-Ramirez, V.: Bin-packing using genetic algorithms. In: Proceedings of the 15th International Conference on Electronics, Communications and Computers (CONIELECOMP 2005). pp. 311\u2013314. IEEE Computer Society, Los Alamitos, CA, USA (2005)","DOI":"10.1109\/CONIEL.2005.25"},{"issue":"5\u20136","key":"10_CR24","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1111\/j.1475-3995.1997.tb00093.x","volume":"4","author":"P Schwerin","year":"1997","unstructured":"Schwerin, P., W\u00e4scher, G.: The bin-packing problem: A problem generator and some numerical experiments with ffd packing and mtp. Int. Trans. Oper. Res. 4(5\u20136), 377\u2013389 (1997)","journal-title":"Int. Trans. Oper. Res."},{"issue":"5","key":"10_CR25","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"M O'Neill","year":"2012","unstructured":"O'Neill, M., Brabazon, A.: Measuring instance difficulty for combinatorial optimization problems. Comput. Oper. Res. 39(5), 875\u2013889 (2012)","journal-title":"Comput. Oper. Res."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Sotelo-Figueroa, M., Puga\u00a0Soberanes, H., Martin\u00a0Carpio, J., Fraire\u00a0Huacuja, H., Cruz\u00a0Reyes, L., Soria-Alcaraz, J.: Evolving and reusing bin packing heuristic through grammatical differential evolution. In: Nature and Biologically Inspired Computing (NaBIC), 2013 World Congress on. pp. 92\u201398 (2013)","DOI":"10.1109\/NaBIC.2013.6617844"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Derrac, J., Garc\u00eda, S., Molina, S., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, pp. 3\u201318 (2011)","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d np-completeness results: motivation, examples, and implications. J. ACM 25, 499\u2013508 (1978)","journal-title":"J. ACM"},{"key":"10_CR29","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, New York (1990)"},{"key":"10_CR30","unstructured":"Schoenfield, J.E.: Fast, exact solution of open bin packing problems without linear programming. Ph.D. thesis, US Army Space and Missile Defense Command, Huntsville, Alabama (2002)"},{"key":"10_CR31","doi-asserted-by":"publisher","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."},{"issue":"11","key":"10_CR32","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."},{"issue":"7","key":"10_CR33","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., J\u00fcrgens, C.: Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput. Oper. Res. 24(7), 627\u2013645 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A Alvim","year":"2004","unstructured":"Alvim, A., Ribeiro, C., Glover, F., Aloise, D.: A hybrid improvement heuristic for the one-dimensional bin packing problem. J. Heuristics 10(2), 205\u2013229 (2004)","journal-title":"J. Heuristics"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proceedings of IEEE International Conference on Robotics and Automation, vol. 2, pp. 1186\u20131192 May 1992","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"10_CR36","unstructured":"Coffman, Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation Algorithms for Bin Packing: A Survey. In: Hochbaum, D.S. (eds.) Approximation Algorithms for NP-hard Problems, pp. 46\u201393. PWS Publishing Co., Boston (1997)"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-61217-6_8","volume-title":"Evolutionary Algorithms in Management Applications","author":"E Falkenauer","year":"1995","unstructured":"Falkenauer, E.: Tapping the full power of genetic algorithm through suitable representation and local optimization: application to bin packing. In: Biethahn, J., Nissen, V. (eds.) Evolutionary Algorithms in Management Applications, pp. 167\u2013182. Springer, Berlin (1995)"},{"issue":"4","key":"10_CR38","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I Gent","year":"1998","unstructured":"Gent, I.: Heuristic solution of open bin packing problems. J. Heuristics 3(4), 299\u2013304 (1998)","journal-title":"J. Heuristics"},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/0-387-28356-0_5","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"JR Koza","year":"2005","unstructured":"Koza, J.R., Poli, R.: Genetic programming. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 127\u2013164. Kluwer, Boston (2005)"},{"key":"10_CR40","unstructured":"lan Fang, H., lan Fang, H., Ross, P., Ross, P., Corne, D., Corne, D.: A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In: Proceedings of the Fifth International Conference on Genetic Algorithms. pp. 375\u2013382. Morgan Kaufmann (1993)"},{"key":"10_CR41","unstructured":"Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures. CRC, 2nd. edn. (2000)"}],"container-title":["Studies in Computational Intelligence","Fuzzy Logic Augmentation of Nature-Inspired Optimization Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10960-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T18:55:26Z","timestamp":1746384926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10960-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,21]]},"ISBN":["9783319109596","9783319109602"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10960-2_10","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014,9,21]]},"assertion":[{"value":"21 September 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}