{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:54:26Z","timestamp":1768517666544,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,25]],"date-time":"2015-01-25T00:00:00Z","timestamp":1422144000000},"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":["Nat Comput"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11047-015-9483-8","type":"journal-article","created":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T16:28:50Z","timestamp":1422116930000},"page":"181-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Evolution of new algorithms for the binary knapsack problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Lucas","family":"Parada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Sep\u00falveda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Parada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,25]]},"reference":[{"key":"9483_CR1","doi-asserted-by":"crossref","unstructured":"Affenzeller M, Winkler S, Wagner S, Beham A (2009) Genetic algorithms and genetic programming: modern concepts and practical applications, 1st edn. CRC, Chapman and Hall","DOI":"10.1201\/9781420011326"},{"issue":"9","key":"9483_CR2","first-page":"190","volume":"5","author":"A Ahmed","year":"2011","unstructured":"Ahmed A, Shaikh AW, Ali M et al (2011) Hyper-heuristic approach for solving scheduling problem: a case study. Aust J Basic Appl Sci 5(9):190\u2013199","journal-title":"Aust J Basic Appl Sci"},{"key":"9483_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.swevo.2012.06.004","volume":"7","author":"A Alinia","year":"2012","unstructured":"Alinia A, Vakil B, Badamchi Z et al (2012) Hybrid particle swarm optimization transplanted into a hyper-heuristic structure for solving examination timetabling problem. Swarm Evol Comput 7:21\u201334. doi: 10.1016\/j.swevo.2012.06.004","journal-title":"Swarm Evol Comput"},{"issue":"11","key":"9483_CR4","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E Angelelli","year":"2010","unstructured":"Angelelli E, Mansini R, Grazia S (2010) Kernel search: a general heuristic for the multi-dimensional knapsack problem. Comput Oper Res 37(11):2017\u20132026","journal-title":"Comput Oper Res"},{"issue":"5","key":"9483_CR5","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28(5):1130\u20131154","journal-title":"Oper Res"},{"issue":"3","key":"9483_CR6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.orl.2007.09.003","volume":"36","author":"D Bienstock","year":"2008","unstructured":"Bienstock D (2008) Approximate formulations for 0-1 knapsack sets. Oper Res Lett 36(3):317\u2013320","journal-title":"Oper Res Lett"},{"issue":"3","key":"9483_CR7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10732-011-9192-0","volume":"18","author":"B Bilgin","year":"2012","unstructured":"Bilgin B, Demeester P, Misir M et al (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18(3):401\u2013434. doi: 10.1007\/s10732-011-9192-0","journal-title":"J Heuristics"},{"key":"9483_CR8","doi-asserted-by":"crossref","unstructured":"Burke E, Kendall G, Newall J et al (2003) Hyper-heuristics: an emerging direction in modern search technology. Handbook of metaheuristics, pp 457\u2013474","DOI":"10.1007\/0-306-48056-5_16"},{"key":"9483_CR9","doi-asserted-by":"crossref","unstructured":"Burke E, Hyde M, Kendall G et al (2010) A classification of hyper-heuristic approaches. In: Handbook of metaheuristics (international series in operations research & management science, vol 146). Nottingham, UK, pp 449\u2013468","DOI":"10.1007\/978-1-4419-1665-5_15"},{"issue":"1","key":"9483_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"E Burke","year":"2012","unstructured":"Burke E, Hyde M, Kendall G et al (2012) Automating the packing heuristic design process with genetic programming. Evol Comput 20(1):63\u201389. doi: 10.1162\/EVCO_a_00044","journal-title":"Evol Comput"},{"issue":"2","key":"9483_CR11","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.amc.2006.09.020","volume":"187","author":"M Darehmiraki","year":"2007","unstructured":"Darehmiraki M, Mishmast N (2007) Molecular solution to the 0\u20131 knapsack problem based on DNA computing. Appl Math Comput 187(2):1033\u20131037","journal-title":"Appl Math Comput"},{"issue":"1","key":"9483_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10951-011-0258-5","volume":"15","author":"P Demeester","year":"2012","unstructured":"Demeester P, Bilgin B, De Causmaecker P et al (2012) A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice. J Sched 15(1):83\u2013103. doi: 10.1007\/s10951-011-0258-5","journal-title":"J Sched"},{"issue":"9","key":"9483_CR13","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/1562164.1562186","volume":"52","author":"L Fortnow","year":"2009","unstructured":"Fortnow L (2009) The status of the P versus NP problem. Commun ACM 52(9):78\u201386","journal-title":"Commun ACM"},{"key":"9483_CR14","unstructured":"Fraser A, Weinbrenner T (1993) GPC++-genetic programming C++ class library. [Online]. ftp:\/\/cs.bham.ac.uk\/pub\/authors\/W.B.Langdon\/weinbenner\/gp.html . Accessed 17 Dec 2013"},{"key":"9483_CR15","unstructured":"Garey M, Johnson D (1979) Computers and intractability. A guide to the theory of NP-completeness. A series of books in the mathematical sciences. WH Freeman and Company, San Francisco, Calif"},{"issue":"1","key":"9483_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.3233\/FI-2012-726","volume":"119","author":"P Garrido","year":"2012","unstructured":"Garrido P, Castro C (2012) A flexible and adaptive hyper-heuristic approach for (dynamic) capacitated vehicle routing problems. Fundam Inform 119(1):29\u201360. doi: 10.3233\/FI-2012-726","journal-title":"Fundam Inform"},{"issue":"3","key":"9483_CR17","first-page":"321","volume":"16","author":"JC G\u00f3mez","year":"2012","unstructured":"G\u00f3mez JC, Terashima-Mar\u00edn H (2012) Building general hyper-heuristics for multi-objective cutting stock problems. Computacion y Sistemas 16(3):321\u2013334","journal-title":"Computacion y Sistemas"},{"key":"9483_CR18","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"J Koza","year":"1992","unstructured":"Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. The MIT press, Massachusetts"},{"issue":"2","key":"9483_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/4235.687879","volume":"1","author":"J Koza","year":"1997","unstructured":"Koza J, Bennett F, Andre D et al (1997) Automated synthesis of analog electrical circuits by means of genetic programming. IEEE Trans Evol Comput 1(2):109\u2013128. doi: 10.1109\/4235.687879","journal-title":"IEEE Trans Evol Comput"},{"key":"9483_CR20","volume-title":"Genetic programming IV: routine human-competitive machine intelligence","author":"J Koza","year":"2005","unstructured":"Koza J, Keane M, Streeter M, Mydlowec W, Yu J, Lanza G (2005) Genetic programming IV: routine human-competitive machine intelligence. Kluwer Academic Publishers, Norwell"},{"issue":"3","key":"9483_CR21","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.asoc.2009.08.037","volume":"10","author":"R Kumar","year":"2010","unstructured":"Kumar R, Singh P (2010) Assessing solution quality of biobjective 0\u20131 knapsack problem using evolutionary and heuristic algorithms. Appl Soft Comput 10(3):711\u2013718","journal-title":"Appl Soft Comput"},{"key":"9483_CR22","unstructured":"Martello S, Toth P (1990). Knapsack problems: algorithms and computer implementations (revised). University of Bologna, Bologna, Italy"},{"issue":"9","key":"9483_CR23","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger D (2005) Where are the hard knapsack problems? Comput Oper Res 32(9):2271\u20132284","journal-title":"Comput Oper Res"},{"key":"9483_CR24","unstructured":"Poli R, Langdon W, McPhee N (2008) A field guide to genetic programming. Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk"},{"issue":"3","key":"9483_CR25","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1016\/j.future.2012.09.005","volume":"29","author":"A Rajni","year":"2013","unstructured":"Rajni A, Chana I (2013) Bacterial foraging based hyper-heuristic for resource scheduling in grid computing. Future Gener Comput Syst 29(3):751\u2013762. doi: 10.1016\/j.future.2012.09.005","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"9483_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-011-0309-9","volume":"37","author":"N Sabar","year":"2012","unstructured":"Sabar N, Ayob M, Qu R et al (2012) A graph coloring constructive hyper-heuristic for examination timetabling problems. Appl Intell 37(1):1\u201311. doi: 10.1007\/s10489-011-0309-9","journal-title":"Appl Intell"},{"key":"9483_CR27","doi-asserted-by":"crossref","unstructured":"Taghipour H, Rezaei M, Esmaili H (2013) Solving the 0\/1 knapsack problem by a biomolecular DNA computer. Advances in bioinformatics","DOI":"10.1155\/2013\/341419"},{"issue":"3","key":"9483_CR28","first-page":"669","volume":"8","author":"L Ye","year":"2013","unstructured":"Ye L, Zhang M (2013) Solutions to the 0-1 knapsack problem based on DNA encoding and computing method. J Comput 8(3):669\u2013675","journal-title":"J Comput"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9483-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9483-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9483-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T09:37:03Z","timestamp":1598693823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9483-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,25]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9483"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9483-8","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,25]]}}}