{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:27:36Z","timestamp":1762507656370,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"CONACyT","award":["2016-01-1920 (Investigacion en Fronteras de la Ciencia 2016)","241461"],"award-info":[{"award-number":["2016-01-1920 (Investigacion en Fronteras de la Ciencia 2016)","241461"]}]},{"name":"ITESM Research Group with Strategic Focus in Intelligent Systems"},{"name":"CONACyT","award":["287479"],"award-info":[{"award-number":["287479"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00500-019-03822-w","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T03:21:49Z","timestamp":1549682509000},"page":"12711-12728","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Evolutionary-based tailoring of synthetic instances for the Knapsack problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Luis Fernando","family":"Plata-Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8821-7137","authenticated-orcid":false,"given":"Ivan","family":"Amaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3408-2166","authenticated-orcid":false,"given":"Jos\u00e9 Carlos","family":"Ortiz-Bayliss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6270-3164","authenticated-orcid":false,"given":"Santiago Enrique","family":"Conant-Pablos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-0773","authenticated-orcid":false,"given":"Hugo","family":"Terashima-Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8435-680X","authenticated-orcid":false,"given":"Carlos A.","family":"Coello\u00a0Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"key":"3822_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-99259-4_30","volume-title":"Parallel problem solving from nature PPSN XV, lecture notes in computer science","author":"I Amaya","year":"2018","unstructured":"Amaya I, Ortiz-Bayliss JC, Conant-Pablos SE, Terashima-Mar\u00edn H, Coello Coello CA (2018) Tailoring instances of the 1D bin packing problem for assessing strengths and weaknesses of its solvers. In: Auger A, Fonseca CM, Louren\u00e7o N, Machado P, Paquete L, Whitley D (eds) Parallel problem solving from nature PPSN XV, lecture notes in computer science, vol 11101. Springer, Cham, pp 373\u2013384. https:\/\/doi.org\/10.1007\/978-3-319-99259-4_30"},{"key":"3822_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.swevo.2015.02.003","volume":"23","author":"IDID Ariyasingha","year":"2015","unstructured":"Ariyasingha IDID, Fernando TGI (2015) Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm Evol Comput 23:11\u201326. https:\/\/doi.org\/10.1016\/j.swevo.2015.02.003","journal-title":"Swarm Evol Comput"},{"key":"3822_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.swevo.2013.09.002","volume":"14","author":"MAK Azad","year":"2014","unstructured":"Azad MAK, Rocha AMAC, Fernandes EMGP (2014) Improved binary artificial fish swarm algorithm for the 0\u20131 multidimensional knapsack problems. Swarm Evol Comput 14:66\u201375. https:\/\/doi.org\/10.1016\/j.swevo.2013.09.002","journal-title":"Swarm Evol Comput"},{"issue":"11","key":"3822_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J Beasley","year":"1990","unstructured":"Beasley J (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069\u20131072","journal-title":"J Oper Res Soc"},{"issue":"12","key":"3822_CR5","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G (2013) Hyper-heuristics : a survey of the state of the art. J Oper Res Soc 64(12):1695\u20131724","journal-title":"J Oper Res Soc"},{"key":"3822_CR6","unstructured":"Christofides N (1979) The vehicle routing problem. Comb Optim 315\u2013338"},{"issue":"9\/10","key":"3822_CR7","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1108\/K-09-2013-0201","volume":"43","author":"JH Drake","year":"2014","unstructured":"Drake JH, Hyde M, Ibrahim K, Ozcan E (2014) A genetic programming hyper-heuristic for the multidimensional knapsack problem. Kybernetes 43(9\/10):1500\u20131511. https:\/\/doi.org\/10.1108\/K-09-2013-0201","journal-title":"Kybernetes"},{"issue":"1","key":"3822_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1162\/EVCO_a_00145","volume":"24","author":"JH Drake","year":"2016","unstructured":"Drake JH, \u00d6zcan E, Burke EK (2016) A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem john. Evol Comput 24(1):113\u2013141","journal-title":"Evol Comput"},{"issue":"2","key":"3822_CR9","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","volume":"262","author":"F Furini","year":"2017","unstructured":"Furini F, Ljubi\u0107 I, Sinnl M (2017) An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur J Oper Res 262(2):438\u2013448","journal-title":"Eur J Oper Res"},{"key":"3822_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.amc.2013.12.088","volume":"230","author":"J Gao","year":"2014","unstructured":"Gao J, He G, Liang R, Feng Z (2014) A quantum-inspired artificial immune system for the multiobjective 0\u20131 knapsack problem. Appl Math Comput 230:120\u2013137","journal-title":"Appl Math Comput"},{"key":"3822_CR11","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison Wesley, Boston"},{"key":"3822_CR12","volume-title":"Adaptation in natural and artificial systems","author":"JR Holland","year":"1975","unstructured":"Holland JR (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor"},{"key":"3822_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems, vol 1. Springer, New York"},{"issue":"2","key":"3822_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149\u2013172","journal-title":"Evol Comput"},{"issue":"2","key":"3822_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch T, Achterberg T, Andersen E, Bastert O, Berthold T, Bixby RE, Danna E, Gamrath G, Gleixner AM, Heinz S, Lodi A, Mittelmann H, Ralphs T, Salvagnin D, Steffy DE, Wolter K (2011) MIPLIB 2010. Math Program Comput 3(2):103\u2013163. https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math Program Comput"},{"issue":"10","key":"3822_CR16","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34(10):2918\u20132930. https:\/\/doi.org\/10.1016\/j.cor.2005.11.018","journal-title":"Comput Oper Res"},{"key":"3822_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.measurement.2015.10.035","volume":"79","author":"H Li","year":"2016","unstructured":"Li H, Yao T, Ren M, Rong J, Liu C, Jia L (2016) Physical topology optimization of infrastructure health monitoring sensor network for high-speed rail. Measurement 79:83\u201393","journal-title":"Measurement"},{"issue":"4","key":"3822_CR18","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 (2012) The multiobjective multidimensional knapsack problem: a survey and a new approach. Int Trans Oper Res 19(4):495\u2013520","journal-title":"Int Trans Oper Res"},{"key":"3822_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.swevo.2013.12.003","volume":"15","author":"Y Marinakis","year":"2014","unstructured":"Marinakis Y, Marinaki M (2014) A bumble bees mating optimization algorithm for the open vehicle routing problem. Swarm Evol Comput 15:80\u201394. https:\/\/doi.org\/10.1016\/j.swevo.2013.12.003","journal-title":"Swarm Evol Comput"},{"key":"3822_CR20","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Hoboken"},{"issue":"2","key":"3822_CR21","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 (2000) The three-dimensional bin packing problem. Oper Res 48(2):256\u2013267","journal-title":"Oper Res"},{"key":"3822_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.amc.2015.08.018","volume":"270","author":"G Mavrotas","year":"2015","unstructured":"Mavrotas G, Florios K, Figueira JR (2015) An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics. Appl Math Comput 270:25\u201343","journal-title":"Appl Math Comput"},{"issue":"3","key":"3822_CR23","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 JC, Terashima-Mar\u00edn H, Conant-Pablos SE (2016) Combine and conquer: an evolutionary hyper-heuristic approach for solving constraint satisfaction problems. Artif Intell Rev 46(3):327\u2013349","journal-title":"Artif Intell Rev"},{"key":"3822_CR24","unstructured":"Petursson KB, Runarsson TP (2016) An evolutionary approach to the discovery of hybrid branching rules for mixed integer solvers. In: Proceedings\u20142015 IEEE symposium series on computational intelligence, SSCI 2015. pp 1436\u20131443"},{"issue":"9","key":"3822_CR25","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 (2005) Where are the hard knapsack problems? Comput Oper Res 32(9):2271\u20132284","journal-title":"Comput Oper Res"},{"issue":"4","key":"3822_CR26","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIBA traveling salesman problem library. ORSA J Comput 3(4):376\u2013384. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J Comput"},{"key":"3822_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ijpe.2017.06.025","volume":"193","author":"M Samavati","year":"2017","unstructured":"Samavati M, Essam D, Nehring M, Sarker R (2017) A methodology for the large-scale multi-period precedence-constrained knapsack problem: an application in the mining industry. Int J Prod Econ 193:12\u201320","journal-title":"Int J Prod Econ"},{"issue":"3","key":"3822_CR28","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.ejor.2016.06.049","volume":"256","author":"J Simon","year":"2017","unstructured":"Simon J, Apte A, Regnier E (2017) An application of the multiple knapsack problem: the self-sufficient marine. Eur J Oper Res 256(3):868\u2013876","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3822_CR29","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 (2011) Discovering the suitability of optimisation algorithms by learning from evolved instances. Ann Math Artif Intell 61(2):87\u2013104","journal-title":"Ann Math Artif Intell"},{"key":"3822_CR30","unstructured":"Smith-Miles K, van Hemert J, Lim X (2010) Understanding tspdifficulty by learning from evolved instances. In: Blum C, Battiti R(eds) Learning and intelligent optimization, Lecture notes in computer science, vol 6073. Springer, Berlin, pp 266\u2013280"},{"key":"3822_CR31","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.dam.2013.11.007","volume":"167","author":"T Szkaliczki","year":"2014","unstructured":"Szkaliczki T, Eberhard M, Hellwagner H, Szobonya L (2014) Piece selection algorithms for layered video streaming in P2P networks. Discret Appl Math 167:269\u2013279","journal-title":"Discret Appl Math"},{"key":"3822_CR32","doi-asserted-by":"crossref","unstructured":"van Hemert JI (2003) Evolving binary constraint satisfaction problem instances that are difficult to solve. In: Proceedings of the 2003 IEEE congress on evolutionary computation (CEC\u201903), IEEE Press, pp 1267\u20131273","DOI":"10.1109\/CEC.2003.1299814"},{"issue":"4","key":"3822_CR33","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 JI (2006) Evolving combinatorial problem instances that are difficult to solve. Evol Comput 14(4):433\u2013462","journal-title":"Evol Comput"},{"issue":"4","key":"3822_CR34","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"3822_CR35","doi-asserted-by":"publisher","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. TIK\u2013report, vol 103, pp 95\u2013100. https:\/\/doi.org\/10.3929\/ethz-a-004284029","DOI":"10.3929\/ethz-a-004284029"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03822-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03822-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03822-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T17:08:54Z","timestamp":1662916134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03822-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":35,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3822"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03822-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"9 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Luis Fernando Plata-Gonz\u00e1lez declares that he has no conflict of interest. Ivan Amaya declares that he has no conflict of interest. Jos\u00e9 Carlos Ortiz-Bayliss declares that he has no conflict of interest. Santiago Enrique Conant-Pablos declares that he has no conflict of interest. Hugo Terashima-Mar\u00edn declares that he has no conflict of interest. Carlos A. Coello Coello declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}