{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T15:55:58Z","timestamp":1774713358912,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:00:00Z","timestamp":1582243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T00:00:00Z","timestamp":1582243200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002848","name":"Comisi\u00f3n Nacional de Investigaci\u00f3n Cient\u00edfica y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["11180056"],"award-info":[{"award-number":["11180056"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s13042-020-01085-8","type":"journal-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T19:02:36Z","timestamp":1582311756000},"page":"1951-1970","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3126-8352","authenticated-orcid":false,"given":"Jos\u00e9","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique L\u00f3pez","family":"Droguett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"key":"1085_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad SR, Bakar AA, Yaakub MR (2015) Metaheuristic algorithms for feature selection in sentiment analysis. In: Science and Information Conference (SAI), pp 222\u2013226. IEEE","DOI":"10.1109\/SAI.2015.7237148"},{"key":"1085_CR2","doi-asserted-by":"crossref","unstructured":"Al-Madi N, Faris H, Mirjalili S (2019) Binary multi-verse optimization algorithm for global optimization and discrete problems. Int J Mach Learn Cybern 1\u201321","DOI":"10.1007\/s13042-019-00931-8"},{"key":"1085_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.knosys.2016.01.031","volume":"98","author":"S Asta","year":"2016","unstructured":"Asta S, \u00d6zcan E, Curtois T (2016) A tensor based hyper-heuristic for nurse rostering. Knowl-Based Syst 98:185\u2013199","journal-title":"Knowl-Based Syst"},{"issue":"19","key":"1085_CR4","doi-asserted-by":"crossref","first-page":"3255","DOI":"10.1016\/j.ins.2009.05.014","volume":"179","author":"JM Cadenas","year":"2009","unstructured":"Cadenas JM, Garrido MC, Mu\u00f1oz E (2009) Using machine learning in a cooperative hybrid parallel strategy of metaheuristics. Inf Sci 179(19):3255\u20133267","journal-title":"Inf Sci"},{"issue":"1","key":"1085_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1515\/math-2017-0029","volume":"15","author":"L Calvet","year":"2017","unstructured":"Calvet L, de Armas J, Masip D, Juan AA (2017) Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math 15(1):261\u2013280","journal-title":"Open Math"},{"key":"1085_CR6","first-page":"1","volume-title":"Metaheuristics: intelligent problem solving","author":"M Caserta","year":"2010","unstructured":"Caserta M, Vo\u00df S (2010) Metaheuristics: intelligent problem solving. Springer, Boston, pp 1\u201338"},{"issue":"3","key":"1085_CR7","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1016\/j.asoc.2011.01.002","volume":"11","author":"E Chen","year":"2011","unstructured":"Chen E, Li J, Liu X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260\u20133269","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1085_CR8","doi-asserted-by":"crossref","first-page":"04015002","DOI":"10.1061\/(ASCE)CP.1943-5487.0000466","volume":"30","author":"J-S Chou","year":"2015","unstructured":"Chou J-S, Ngo N-T, Pham A-D (2015) Shear strength prediction in reinforced concrete deep beams using nature-inspired metaheuristic support vector regression. J Comput Civ Eng 30(1):04015002","journal-title":"J Comput Civ Eng"},{"issue":"7","key":"1085_CR9","doi-asserted-by":"crossref","first-page":"3132","DOI":"10.1109\/TII.2018.2794389","volume":"14","author":"J-S Chou","year":"2018","unstructured":"Chou J-S, Nguyen T-K (2018) Forward forecast of stock price using sliding-window metaheuristic-optimized machine-learning regression. IEEE Trans Industr Inf 14(7):3132\u20133142","journal-title":"IEEE Trans Industr Inf"},{"key":"1085_CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ins.2017.02.051","volume":"399","author":"J-S Chou","year":"2017","unstructured":"Chou J-S, Pham A-D (2017) Nature-inspired metaheuristic optimization in least squares support vector regression for obtaining bridge scour information. Inf Sci 399:64\u201380","journal-title":"Inf Sci"},{"key":"1085_CR11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.autcon.2016.03.015","volume":"68","author":"J-S Chou","year":"2016","unstructured":"Chou J-S, Thedja JPP (2016) Metaheuristic optimization within machine learning-based classification system for early warnings related to geotechnical problems. Autom Constr 68:65\u201380","journal-title":"Autom Constr"},{"key":"1085_CR12","doi-asserted-by":"crossref","unstructured":"Crawford B, Soto R, Astorga G, Garc\u00eda J, Castro C, Paredes F (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity, 2017:Article ID 8404231","DOI":"10.1155\/2017\/8404231"},{"key":"1085_CR13","doi-asserted-by":"crossref","unstructured":"Dama\u0161evi\u010dius R, Wo\u017aniak M (2017) State flipping based hyper-heuristic for hybridization of nature inspired algorithms. In: International Conference on Artificial Intelligence and Soft Computing, pp 337\u2013346. Springer","DOI":"10.1007\/978-3-319-59063-9_30"},{"key":"1085_CR14","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cie.2016.09.006","volume":"101","author":"R de Alvarenga Rosa","year":"2016","unstructured":"de Alvarenga Rosa R, Machado AM, Ribeiro GM, Mauri GR (2016) A mathematical model and a clustering search metaheuristic for planning the helicopter transportation of employees to the production platforms of oil and gas. Comput Ind Eng 101:303\u2013312","journal-title":"Comput Ind Eng"},{"key":"1085_CR15","first-page":"1","volume-title":"Parameter setting in evolutionary algorithms","author":"K De Jong","year":"2007","unstructured":"De Jong K (2007) Parameter setting in EAs: a 30 year perspective. Parameter setting in evolutionary algorithms. Springer, Berlin, pp 1\u201318"},{"key":"1085_CR16","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.eswa.2017.06.010","volume":"87","author":"AD de Le\u00f3n","year":"2017","unstructured":"de Le\u00f3n AD, Lalla-Ruiz E, Meli\u00e1n-Batista B, Moreno-Vega JM (2017) A machine learning-based system for berth scheduling at bulk terminals. Expert Syst Appl 87:170\u2013182","journal-title":"Expert Syst Appl"},{"key":"1085_CR17","doi-asserted-by":"crossref","unstructured":"Fernandes S, Setoue K, Adeli H, Papa J (2017) Fine-tuning enhanced probabilistic neural networks using metaheuristic-driven optimization. In: Bio-Inspired Computation and Applications in Image Processing, pp 25\u201345. Elsevier","DOI":"10.1016\/B978-0-12-804536-7.00002-8"},{"issue":"1","key":"1085_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TSC.2015.2439695","volume":"9","author":"S Fong","year":"2016","unstructured":"Fong S, Wong R, Vasilakos AV (2016) Accelerated PSO swarm search feature selection for data stream mining big data. IEEE Trans Serv Comput 9(1):33\u201345","journal-title":"IEEE Trans Serv Comput"},{"issue":"1","key":"1085_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155(1):1\u201321","journal-title":"Eur J Oper Res"},{"key":"1085_CR20","doi-asserted-by":"crossref","unstructured":"Garc\u00eda J, Altimiras F, Pe\u00f1a A, Astorga G, Peredo O (2018a) A binary cuckoo search big data algorithm applied to large-scale crew scheduling problems. Complexity, 2018:Article ID 8395193","DOI":"10.1155\/2018\/8395193"},{"key":"1085_CR21","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, J, Crawford B, Soto R, Astorga G (2017) A percentile transition ranking algorithm applied to knapsack problem. In: Proceedings of the Computational Methods in Systems and Software, pp 126\u2013138. Springer","DOI":"10.1007\/978-3-319-67621-0_11"},{"key":"1085_CR22","doi-asserted-by":"crossref","unstructured":"Garc\u00eda J, Crawford B, Soto R, Astorga G (2018b) A percentile transition ranking algorithm applied to binarization of continuous swarm intelligence metaheuristics. In: International Conference on Soft Computing and Data Mining, pp 3\u201313. Springer","DOI":"10.1007\/978-3-319-72550-5_1"},{"key":"1085_CR23","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.swevo.2018.08.006","volume":"44","author":"J Garc\u00eda","year":"2019","unstructured":"Garc\u00eda J, Crawford B, Soto R, Astorga G (2019a) A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics. Swarm Evol Comput 44:646\u2013664","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1085_CR24","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10489-017-0972-6","volume":"48","author":"J Garc\u00eda","year":"2018","unstructured":"Garc\u00eda J, Crawford B, Soto R, Castro C, Paredes F (2018c) A k-means binarization framework applied to multidimensional knapsack problem. Appl Intell 48(2):357\u2013380","journal-title":"Appl Intell"},{"key":"1085_CR25","doi-asserted-by":"crossref","unstructured":"Garc\u00eda J, Moraga P, Valenzuela M, Crawford B, Soto R, Pinto H, Pe\u00f1a A, Altimiras F, Astorga G (2019b) A db-scan binarization algorithm applied to matrix covering problems. Comput Intell Neurosci, 2019","DOI":"10.1155\/2019\/3238574"},{"key":"1085_CR26","unstructured":"Garey M, Johnson D (1979) A guide to the theory of NP-completeness. Comput Intractability"},{"issue":"3","key":"1085_CR27","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s13042-015-0450-6","volume":"9","author":"H Guo","year":"2018","unstructured":"Guo H, Liu B, Cai D, Lu T (2018) Predicting protein-protein interaction sites using modified support vector machine. Int J Mach Learn Cybernet 9(3):393\u2013398","journal-title":"Int J Mach Learn Cybernet"},{"key":"1085_CR28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4899-7547-8_5","volume-title":"Uncertainty management in simulation-optimization of complex systems","author":"B Iooss","year":"2015","unstructured":"Iooss B, Lema\u00eetre P (2015) A review on global sensitivity analysis methods. Uncertainty management in simulation-optimization of complex systems. Springer, Berlin, pp 101\u2013122"},{"key":"1085_CR29","doi-asserted-by":"crossref","unstructured":"Jin Y, Qu R, Atkin J (2014) A population-based incremental learning method for constrained portfolio optimisation. In: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on, pp 212\u2013219. IEEE","DOI":"10.1109\/SYNASC.2014.36"},{"key":"1085_CR30","first-page":"62","volume":"2","author":"AA Juan","year":"2015","unstructured":"Juan AA, Faulin J, Grasman SE, Rabe M, Figueira G (2015) A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper Res Perspect 2:62\u201372","journal-title":"Oper Res Perspect"},{"key":"1085_CR31","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on, vol\u00a05, pp 4104\u20134108. IEEE"},{"issue":"7","key":"1085_CR32","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1007\/s13042-017-0772-7","volume":"9","author":"S Korkmaz","year":"2018","unstructured":"Korkmaz S, Babalik A, Kiran MS (2018) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybernet 9(7):1233\u20131247","journal-title":"Int J Mach Learn Cybernet"},{"key":"1085_CR33","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.asoc.2016.03.012","volume":"46","author":"R Kuo","year":"2016","unstructured":"Kuo R, Kuo P, Chen YR, Zulvia FE (2016a) Application of metaheuristics-based clustering algorithm to item assignment in a synchronized zone order picking system. Appl Soft Comput 46:143\u2013150","journal-title":"Appl Soft Comput"},{"key":"1085_CR34","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.neucom.2016.04.017","volume":"205","author":"R-J Kuo","year":"2016","unstructured":"Kuo R-J, Mei C, Zulvia FE, Tsai C (2016b) An application of a metaheuristic algorithm-based clustering ensemble method to APP customer segmentation. Neurocomputing 205:116\u2013129","journal-title":"Neurocomputing"},{"issue":"4","key":"1085_CR35","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11721-015-0114-x","volume":"9","author":"BJ Leonard","year":"2015","unstructured":"Leonard BJ, Engelbrecht AP, Cleghorn CW (2015) Critical considerations on angle modulated particle swarm optimisers. Swarm Intell 9(4):291\u2013314","journal-title":"Swarm Intell"},{"key":"1085_CR36","first-page":"324","volume-title":"Information and automation","author":"Z-q Li","year":"2011","unstructured":"Li Z-q, Zhang H-l, Zheng J-h, Dong M-j, Xie Y-f, Tian Z-j (2011) Heuristic evolutionary approach for weighted circles layout. Information and automation. Springer, Berlin, pp 324\u2013331"},{"issue":"23\u201324","key":"1085_CR37","doi-asserted-by":"crossref","first-page":"9788","DOI":"10.1016\/j.apm.2016.06.002","volume":"40","author":"J Liu","year":"2016","unstructured":"Liu J, Wu C, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for the 0\u20131 multidimensional knapsack problem. Appl Math Model 40(23\u201324):9788\u20139805","journal-title":"Appl Math Model"},{"key":"1085_CR38","doi-asserted-by":"crossref","unstructured":"Liu W, Liu L, Cartes D (2007) Angle modulated particle swarm optimization based defensive islanding of large scale power systems. IEEE Power Engineering Society Conference and Exposition in Africa 1\u20138","DOI":"10.1109\/PESAFR.2007.4498114"},{"key":"1085_CR39","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The irace package: Iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"key":"1085_CR40","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.jnca.2017.01.031","volume":"83","author":"PS Mann","year":"2017","unstructured":"Mann PS, Singh S (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40\u201352","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"1085_CR41","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ejor.2016.02.045","volume":"254","author":"S Martin","year":"2016","unstructured":"Martin S, Ouelhadj D, Beullens P, Ozcan E, Juan AA, Burke EK (2016) A multi-agent based cooperative approach to scheduling and routing. Eur J Oper Res 254(1):169\u2013178","journal-title":"Eur J Oper Res"},{"key":"1085_CR42","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.eswa.2019.04.050","volume":"133","author":"S Mirghasemi","year":"2019","unstructured":"Mirghasemi S, Andreae P, Zhang M (2019) Domain-independent severely noisy image segmentation via adaptive wavelet shrinkage using particle swarm optimization and fuzzy c-means. Expert Syst Appl 133:126\u2013150","journal-title":"Expert Syst Appl"},{"key":"1085_CR43","unstructured":"Moiz DZ, AE, Mezioud C, Draa A (2015) Binary bat algorithm: On the efficiency of mapping functions when handling binary problems using continuous-variable-based metaheuristics. In: Computer Science and Its Applications - 5th IFIP TC 5 International Conference, CIIA 2015, Saida, Algeria, May 20-21, 2015, Proceedings, pp 3\u201314"},{"key":"1085_CR44","unstructured":"Pampara G (2012) Angle modulated population based algorithms to solve binary problems. PhD thesis, University of Pretoria, Pretoria"},{"issue":"5","key":"1085_CR45","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1057\/jors.2014.46","volume":"66","author":"J Ries","year":"2015","unstructured":"Ries J, Beullens P (2015) A semi-automated design of instance-based fuzzy parameter tuning for metaheuristics based on decision tree induction. J Oper Res Soc 66(5):782\u2013793","journal-title":"J Oper Res Soc"},{"issue":"1\u20133","key":"1085_CR46","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.neucom.2006.07.008","volume":"70","author":"HG Santos","year":"2006","unstructured":"Santos HG, Ochi LS, Marinho EH, Drummond LMDA (2006) Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. Neurocomputing 70(1\u20133):70\u201377","journal-title":"Neurocomputing"},{"issue":"3","key":"1085_CR47","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/s00521-014-1743-5","volume":"26","author":"S Saremi","year":"2015","unstructured":"Saremi S, Mirjalili S, Lewis A (2015) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625\u2013640","journal-title":"Neural Comput Appl"},{"key":"1085_CR48","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles K, Baatar D, Wreford B, Lewis R (2014) Towards objective measures of algorithm performance across instance space. Comput Oper Res 45:12\u201324","journal-title":"Comput Oper Res"},{"key":"1085_CR49","first-page":"644","volume-title":"Genetic and evolutionary computation conference","author":"F Streichert","year":"2003","unstructured":"Streichert F, Stein G, Ulmer H, Zell A (2003) A clustering based niching method for evolutionary algorithms. Genetic and evolutionary computation conference. Springer, Berlin, pp 644\u2013645"},{"key":"1085_CR50","unstructured":"Swagatam D, Rohan M, Rupam K (2013) Multi-user detection in multi-carrier cdma wireless broadband system using a binary adaptive differential evolution algorithm. Proceedings of the 15th annual conference on Genetic and evolutionary computation, GECCO, pp 1245\u20131252"},{"issue":"1","key":"1085_CR51","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","volume":"240","author":"E-G Talbi","year":"2016","unstructured":"Talbi E-G (2016) Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann Oper Res 240(1):171\u2013215","journal-title":"Ann Oper Res"},{"key":"1085_CR52","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.compeleceng.2016.03.005","volume":"53","author":"C-W Tsai","year":"2016","unstructured":"Tsai C-W, Chiang M-C, Ksentini A, Chen M (2016) Metaheuristic algorithms for healthcare: open issues and challenges. Compu Electr Eng 53:421\u2013434","journal-title":"Compu Electr Eng"},{"key":"1085_CR53","unstructured":"Tyasnurita R, \u00d6zcan E, Shahriar A, John R (2015) Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing. In: 15th UK Workshop on Computational Intelligence, UK"},{"issue":"2","key":"1085_CR54","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M Vasquez","year":"2001","unstructured":"Vasquez M, Hao J-K (2001) A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Comput Optim Appl 20(2):137\u2013157","journal-title":"Comput Optim Appl"},{"key":"1085_CR55","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.ins.2016.08.066","volume":"372","author":"N Ve\u010dek","year":"2016","unstructured":"Ve\u010dek N, Mernik M, Filipi\u010d B, \u010crepin\u0161ek M (2016) Parameter tuning with chess rating system (CRS-tuning) for meta-heuristic algorithms. Inf Sci 372:446\u2013469","journal-title":"Inf Sci"},{"issue":"5","key":"1085_CR56","first-page":"50","volume":"13","author":"Y Xue","year":"2019","unstructured":"Xue Y, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data (TKDD) 13(5):50","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"3","key":"1085_CR57","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/39.911360","volume":"21","author":"T Yalcinoz","year":"2001","unstructured":"Yalcinoz T, Altun H (2001) Power economic dispatch using a hybrid genetic algorithm. IEEE Power Eng Rev 21(3):59\u201360","journal-title":"IEEE Power Eng Rev"},{"issue":"1","key":"1085_CR58","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0377-2217(99)00448-8","volume":"131","author":"M-H Yang","year":"2001","unstructured":"Yang M-H (2001) An efficient algorithm to allocate shelf space. Eur J Oper Res 131(1):107\u2013118","journal-title":"Eur J Oper Res"},{"key":"1085_CR59","doi-asserted-by":"crossref","unstructured":"Yang Y, Mao Y, Yang P, Jiang Y (2013) The unit commitment problem based on an improved firefly and particle swarm optimization hybrid algorithm. In: Chinese Automation Congress (CAC), 2013, pp 718\u2013722. IEEE","DOI":"10.1109\/CAC.2013.6775828"},{"issue":"3","key":"1085_CR60","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-010-9136-0","volume":"17","author":"G Zhang","year":"2011","unstructured":"Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17(3):303\u2013351","journal-title":"J Heuristics"},{"key":"1085_CR61","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.asoc.2016.02.027","volume":"43","author":"X Zhang","year":"2016","unstructured":"Zhang X, Wu C, Li J, Wang X, Yang Z, Lee J-M, Jung K-H (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583\u2013595","journal-title":"Appl Soft Comput"},{"issue":"20","key":"1085_CR62","doi-asserted-by":"crossref","first-page":"7110","DOI":"10.1016\/j.eswa.2015.04.066","volume":"42","author":"B Zheng","year":"2015","unstructured":"Zheng B, Zhang J, Yoon SW, Lam SS, Khasawneh M, Poranki S (2015) Predictive modeling of hospital readmissions using metaheuristics and data mining. Expert Syst Appl 42(20):7110\u20137120","journal-title":"Expert Syst Appl"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01085-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-020-01085-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-020-01085-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T10:44:15Z","timestamp":1695811455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-020-01085-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,21]]},"references-count":62,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s13042-020-01085-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,21]]},"assertion":[{"value":"5 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}