{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:18:50Z","timestamp":1742919530250,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642203633"},{"type":"electronic","value":"9783642203640"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20364-0_11","type":"book-chapter","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T13:21:34Z","timestamp":1303824094000},"page":"118-129","source":"Crossref","is-referenced-by-count":2,"title":["Frequency Distribution Based Hyper-Heuristic for the Bin-Packing Problem"],"prefix":"10.1007","author":[{"given":"He","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jifeng","family":"Xuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An Emerging Direction in Modern Search Technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Vaquez-Rodr\u00edguez, J.A., Petrovic, S., Burke, E.K.: Dispatching Rules for Production Scheduling: a Hyper-heuristic Landscape Analysis. In: Proceedings of the IEEE CEC, Trondheim, Norway, pp. 1873\u20131880 (2009)","DOI":"10.1109\/CEC.2009.4983169"},{"key":"11_CR3","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A Survey of Hyper-heuristics. Technical Report, School of Computer Science and Information Technology, University of Nottingham, Computer Science (2009)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1007\/3-540-45110-2_5","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"P. Ross","year":"2003","unstructured":"Ross, P., Marin-Blazquez, J.G., Schulenburg, S., Hart, E.: Learning a Procedure that Can Solve Hard Bin-packing Problems: A new GA-based Approach to Hyper-heuristics. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1295\u20131306. Springer, Heidelberg (2003)"},{"key":"11_CR5","unstructured":"Bai, R., Blazewicz, J., Burke, E.K., Kendall, G., McCollum, B.: A Simulated Annealing Hyper-heuristic Methodology for Flexible Decision Support. Technical report, School of CSiT, University of Nottingham (2007)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1057\/jors.2008.102","volume":"60","author":"R. Qu","year":"2008","unstructured":"Qu, R., Burke, E.K.: Hybridisations within a Graph Based Hyper-heuristic Framework for University Timetabling Problems. JORS\u00a060, 1273\u20131285 (2008)","journal-title":"JORS"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2008.10.001","volume":"198","author":"R. Qu","year":"2008","unstructured":"Qu, R., Burke, E.K., McCollum, B.: Adaptive Automated Construction of Hybrid Heuristics for Exam Timetabling and Graph Colouring Problems. EJOR\u00a0198, 392\u2013404 (2008)","journal-title":"EJOR"},{"key":"11_CR8","first-page":"394","volume-title":"Proceedings of the International Conference on the Practice and Theory of Automated Timetabling","author":"B. Bilgin","year":"2007","unstructured":"Bilgin, B., Ozcan, E., Korkmaz, E.E.: An Experimental Study on Hyper-heuristics and Final Exam Scheduling. In: PATAT 2006, pp. 394\u2013412. Springer, Berlin (2007)"},{"key":"11_CR9","unstructured":"Vazquez-Rodriguez, J.A., Petrovic, S., Salhi, A.: A Combined Meta-heuristic with Hyper-heuristic Approach to the Scheduling of the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines. In: Proceedings of the 3rd Multidisciplinary International Scheduling Conference, Paris, France, pp. 506\u2013513 (2007)"},{"key":"11_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-540-24581-0_69","volume-title":"AI 2003: Advances in Artificial Intelligence","author":"L. Han","year":"2003","unstructured":"Han, L., Kendall, G.: Guided Operators for a Hyper-heuristic Genetic Algorithm. In: Gedeon, T(T.) D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol.\u00a02903, pp. 807\u2013820. Springer, Heidelberg (2003)"},{"key":"11_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. John Wiley & Sons, Chichester (1990)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.eswa.2006.12.018","volume":"34","author":"F. Thabtah","year":"2008","unstructured":"Thabtah, F., Cowling, P.: Mining the Data from a Hyperheuristic Approach Using Associative Classification. Expert Systems with Applications\u00a034(2), 1093\u20131101 (2008)","journal-title":"Expert Systems with Applications"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-31996-2_3","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"K. Chakhlevitch","year":"2005","unstructured":"Chakhlevitch, K., Cowling, P.: Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol.\u00a03448, pp. 23\u201333. Springer, Heidelberg (2005)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","first-page":"546","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"Z. Ren","year":"2010","unstructured":"Ren, Z., Jiang, H., Xuan, J., Luo, Z.: Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 546\u2013555. Springer, Heidelberg (2010)"},{"key":"11_CR15","unstructured":"Cross-domain Heuristic Search Challenge, \n                  \n                    http:\/\/www.asap.cs.nott.ac.uk\/chesc2011\/index.html"},{"issue":"7","key":"11_CR16","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K. Fleszar","year":"2002","unstructured":"Fleszar, K., Hindi, K.S.: New Heuristics for One-dimensional Bin-packing. Computers and Operations Research\u00a029(7), 821\u2013839 (2002)","journal-title":"Computers and Operations Research"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/B:HEUR.0000026267.44673.ed","volume":"10","author":"A.C.F. Alvim","year":"2004","unstructured":"Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A Hybrid Improvement Heuristic for the One Dimensional Bin Packing Problem. Journal of Heuristics\u00a010, 205\u2013229 (2004)","journal-title":"Journal of Heuristics"},{"key":"11_CR18","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. Journal of Heuristics\u00a02, 5\u201330 (1996)","journal-title":"Journal of Heuristics"},{"issue":"7","key":"11_CR19","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., Jurgens, C.: BISON: A Fast Hybrid Procedure for Exactly Solving the One Dimensional Bin Packing Problem. Computers & Operations Research\u00a024(7), 627\u2013645 (1997)","journal-title":"Computers & Operations Research"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J.M. Valerio de Carvalho","year":"1999","unstructured":"Valerio de Carvalho, J.M.: Exact Solution of Bin-packing Problems Using Column Generation and branch-and-bound. Annals of Operations Research\u00a086, 629\u2013659 (1999)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20364-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:19:50Z","timestamp":1558574390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20364-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203633","9783642203640"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20364-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}