{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:03:12Z","timestamp":1760709792143},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030028367"},{"type":"electronic","value":"9783030028374"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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-030-02837-4_10","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:21:45Z","timestamp":1546215705000},"page":"118-128","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Quartile-Based Hyper-heuristic for Solving the 0\/1 Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Fernando","family":"G\u00f3mez-Herrera","sequence":"first","affiliation":[]},{"given":"Rodolfo A.","family":"Ramirez-Valenzuela","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[]},{"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Amuthan, A., Thilak, K.D.: Survey on Tabu search meta-heuristic optimization. In: 2016 International Conference on Signal Processing, Communication, Power and Embedded System (SCOPES), pp. 1539\u20131543, October 2016","DOI":"10.1109\/SCOPES.2016.7955697"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Banda, J., Velasco, J., Berrones, A.: A hybrid heuristic algorithm based on mean-field theory with a simple local search for the quadratic knapsack problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2559\u20132565, June 2017","DOI":"10.1109\/CEC.2017.7969616"},{"issue":"1","key":"10_CR3","first-page":"8","volume":"8","author":"V Barichard","year":"2003","unstructured":"Barichard, V., Hao, J.K.: Genetic Tabu search for the multi-objective knapsack problem. Tsinghua Sci. Technol. 8(1), 8\u201313 (2003)","journal-title":"Tsinghua Sci. Technol."},{"key":"10_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"E Burke","year":"2005","unstructured":"Burke, E., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0"},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Metaheuristics, pp. 449\u2013468","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 449\u2013468. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_15"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Chou, Y.H., Yang, Y.J., Chiu, C.H.: Classical and quantum-inspired Tabu search for solving 0\/1 knapsack problem. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics, pp. 1364\u20131369, October 2011","DOI":"10.1109\/ICSMC.2011.6083848"},{"key":"10_CR7","unstructured":"Cui, X., Wang, D., Yan, Y.: AES algorithm for dynamic knapsack problems in capital budgeting. In: 2010 Chinese Control and Decision Conference, pp. 481\u2013485, May 2010"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"The Ant Colony Optimization Metaheuristic","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: The Ant Colony Optimization Metaheuristic, pp. 25\u201364. MIT Press, Cambridge (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Gagliardi, E.O., Dorz\u00e1n, M.G., Leguizam\u00f3n, M.G., Pe\u00f1alver, G.H.: Approximations on minimum weight pseudo-triangulation problem using ant colony optimization metaheuristic. In: 2011 30th International Conference of the Chilean Computer Science Society, pp. 238\u2013246, November 2011","DOI":"10.1109\/SCCC.2011.31"},{"key":"10_CR10","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 (1979)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Hifi, M., Otmani, N.: A first level scatter search for disjunctively constrained knapsack problems. In: 2011 International Conference on Communications, Computing and Control Applications (CCCA), pp. 1\u20136, March 2011","DOI":"10.1109\/CCCA.2011.6031544"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TEVC.2002.802873","volume":"6","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: On the performance of multiple-objective genetic local search on the 0\/1 knapsack problem - a comparative experiment. IEEE Trans. Evol. Comput. 6(4), 402\u2013412 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Kiss, Z.I., Hosu, A.C., Varga, M., Polgar, Z.A.: Load balancing solution for heterogeneous wireless networks based on the knapsack problem. In: 2015 38th International Conference on Telecommunications and Signal Processing (TSP), pp. 1\u20136, July 2015","DOI":"10.1109\/TSP.2015.7296381"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s13042-014-0272-y","volume":"7","author":"AJ Kulkarni","year":"2016","unstructured":"Kulkarni, A.J., Shabir, H.: Solving 0\u20131 knapsack problem using cohort intelligence algorithm. Int. J. Mach. Learn. Cybern. 7(3), 427\u2013441 (2016)","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2015.11.045","volume":"41","author":"J Lv","year":"2016","unstructured":"Lv, J., Wang, X., Huang, M., Cheng, H., Li, F.: Solving 0\u20131 knapsack problem by greedy degree and expectation efficiency. Appl. Soft Comput. J. 41, 94\u2013103 (2016)","journal-title":"Appl. Soft Comput. J."},{"issue":"9","key":"10_CR16","doi-asserted-by":"publisher","first-page":"4475","DOI":"10.1016\/j.eswa.2013.12.050","volume":"41","author":"M Maashi","year":"2014","unstructured":"Maashi, M., \u00d6zcan, E., Kendall, G.: A multi-objective hyper-heuristic based on choice function. Expert Syst. Appl. 41(9), 4475\u20134493 (2014)","journal-title":"Expert Syst. Appl."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Naldi, M., Nicosia, G., Pacifici, A., Pferschy, U., Leder, B.: A simulation study of fairness-profit trade-off in project selection based on HHI and knapsack models. In: 2016 European Modelling Symposium (EMS), pp. 85\u201390, November 2016","DOI":"10.1109\/EMS.2016.025"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Niar, S., Freville, A.: A parallel Tabu search algorithm for the 0\u20131 multidimensional knapsack problem. In: Proceedings 11th International Parallel Processing Symposium, pp. 512\u2013516, April 1997","DOI":"10.1109\/IPPS.1997.580948"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10462-016-9466-x","volume":"46","author":"JC Ortiz-Bayliss","year":"2016","unstructured":"Ortiz-Bayliss, J.C., Terashima-Mar\u00edn, H., Conant-Pablos, S.E.: Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif. Intell. Rev. 46(3), 327\u2013349 (2016)","journal-title":"Artif. Intell. Rev."},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3\u201323 (2008)","journal-title":"Intell. Data Anal."},{"issue":"10","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1109\/TCYB.2013.2294185","volume":"44","author":"Z Ren","year":"2014","unstructured":"Ren, Z., Jiang, H., Xuan, J., Hu, Y., Luo, Z.: New insights into diversification of hyper-heuristics. IEEE Trans. Cybern. 44(10), 1747\u20131761 (2014)","journal-title":"IEEE Trans. Cybern."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Sapra, D., Sharma, R., Agarwal, A.P.: Comparative study of metaheuristic algorithms using knapsack problem. In: 2017 7th International Conference on Cloud Computing, Data Science Engineering - Confluence, pp. 134\u2013137, January 2017","DOI":"10.1109\/CONFLUENCE.2017.7943137"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Terashima-Mar\u00edn, H., Flores-Alvarez, E.J., Ross, P.: Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In: Proceedings of the 7th annual conference on Genetic and evolutionary computation, pp. 637\u2013643. ACM (2005)","DOI":"10.1145\/1068009.1068115"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02837-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T03:45:06Z","timestamp":1573616706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02837-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030028367","9783030028374"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02837-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enseneda","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}