Skip to main content
Top
Published in: International Journal of Machine Learning and Cybernetics 9/2020

21-02-2020 | Original Article

Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem

Authors: José García, Eduardo Lalla-Ruiz, Stefan Voß, Enrique López Droguett

Published in: International Journal of Machine Learning and Cybernetics | Issue 9/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Solving combinatorial optimization problems is of great interest in the areas of computer science and operations research. Optimization algorithms and particularly metaheuristics are constantly improved in order to reduce execution times, increase the quality of solutions and address larger instances. In this work, an improvement of the binarization framework which uses the K-means technique is developed. To achieve this, a perturbation operator based on the K-nearest neighbor technique is incorporated into the framework with the aim of generating more robust binarized algorithms. The technique of K-nearest neighbors is used for improving the properties of diversification and intensification of metaheuristics in its binary version. The contribution of the K-nearest neighbors perturbation operator to the final results is systematically analyzed. Particle Swarm Optimization and Cuckoo Search are used as metaheuristic techniques. To verify the results, the well-known multidimensional knapsack problem is tackled. A computational comparison is made with the state-of-the-art of metaheuristic techniques that use general mechanisms of binarization. The results show that our improved framework produces consistently better results. In this sense, the contribution of the operator which uses the K-nearest neighbors technique is investigated finding that this operator contributes significantly to the quality of the results.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Show more products
Footnotes
1
OR-Library: http://www.brunel.ac.uk/mastjjb/jeb/orlib/mknapinfo.html.
 
3
Best values within our comparison are indicated in bold. This also holds for the next table.
 
Literature
1.
go back to reference Ahmad SR, Bakar AA, Yaakub MR (2015) Metaheuristic algorithms for feature selection in sentiment analysis. In: Science and Information Conference (SAI), pp 222–226. IEEE Ahmad SR, Bakar AA, Yaakub MR (2015) Metaheuristic algorithms for feature selection in sentiment analysis. In: Science and Information Conference (SAI), pp 222–226. IEEE
2.
go back to reference 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–21 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–21
3.
go back to reference Asta S, Özcan E, Curtois T (2016) A tensor based hyper-heuristic for nurse rostering. Knowl-Based Syst 98:185–199 Asta S, Özcan E, Curtois T (2016) A tensor based hyper-heuristic for nurse rostering. Knowl-Based Syst 98:185–199
4.
go back to reference Cadenas JM, Garrido MC, Muñoz E (2009) Using machine learning in a cooperative hybrid parallel strategy of metaheuristics. Inf Sci 179(19):3255–3267 Cadenas JM, Garrido MC, Muñoz E (2009) Using machine learning in a cooperative hybrid parallel strategy of metaheuristics. Inf Sci 179(19):3255–3267
5.
go back to reference 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–280MathSciNetMATH 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–280MathSciNetMATH
6.
go back to reference Caserta M, Voß S (2010) Metaheuristics: intelligent problem solving. Springer, Boston, pp 1–38 Caserta M, Voß S (2010) Metaheuristics: intelligent problem solving. Springer, Boston, pp 1–38
7.
go back to reference Chen E, Li J, Liu X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260–3269 Chen E, Li J, Liu X (2011) In search of the essential binary discrete particle swarm. Appl Soft Comput 11(3):3260–3269
8.
go back to reference 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 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
9.
go back to reference 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–3142 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–3142
10.
go back to reference 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–80 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–80
11.
go back to reference 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–80 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–80
12.
go back to reference Crawford B, Soto R, Astorga G, García J, Castro C, Paredes F (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity, 2017:Article ID 8404231 Crawford B, Soto R, Astorga G, García J, Castro C, Paredes F (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity, 2017:Article ID 8404231
13.
go back to reference Damaševičius R, Woźniak M (2017) State flipping based hyper-heuristic for hybridization of nature inspired algorithms. In: International Conference on Artificial Intelligence and Soft Computing, pp 337–346. Springer Damaševičius R, Woźniak M (2017) State flipping based hyper-heuristic for hybridization of nature inspired algorithms. In: International Conference on Artificial Intelligence and Soft Computing, pp 337–346. Springer
14.
go back to reference 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–312 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–312
15.
go back to reference De Jong K (2007) Parameter setting in EAs: a 30 year perspective. Parameter setting in evolutionary algorithms. Springer, Berlin, pp 1–18 De Jong K (2007) Parameter setting in EAs: a 30 year perspective. Parameter setting in evolutionary algorithms. Springer, Berlin, pp 1–18
16.
go back to reference de León AD, Lalla-Ruiz E, Melián-Batista B, Moreno-Vega JM (2017) A machine learning-based system for berth scheduling at bulk terminals. Expert Syst Appl 87:170–182 de León AD, Lalla-Ruiz E, Melián-Batista B, Moreno-Vega JM (2017) A machine learning-based system for berth scheduling at bulk terminals. Expert Syst Appl 87:170–182
17.
go back to reference 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–45. Elsevier 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–45. Elsevier
18.
go back to reference 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–45 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–45
19.
go back to reference Fréville A (2004) The multidimensional 0–1 knapsack problem: an overview. Eur J Oper Res 155(1):1–21MathSciNetMATH Fréville A (2004) The multidimensional 0–1 knapsack problem: an overview. Eur J Oper Res 155(1):1–21MathSciNetMATH
20.
go back to reference García J, Altimiras F, Peña 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 García J, Altimiras F, Peña 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
21.
go back to reference García, 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–138. Springer García, 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–138. Springer
22.
go back to reference García 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–13. Springer García 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–13. Springer
23.
go back to reference García 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–664 García 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–664
24.
go back to reference García 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–380 García 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–380
25.
go back to reference García J, Moraga P, Valenzuela M, Crawford B, Soto R, Pinto H, Peña A, Altimiras F, Astorga G (2019b) A db-scan binarization algorithm applied to matrix covering problems. Comput Intell Neurosci, 2019 García J, Moraga P, Valenzuela M, Crawford B, Soto R, Pinto H, Peña A, Altimiras F, Astorga G (2019b) A db-scan binarization algorithm applied to matrix covering problems. Comput Intell Neurosci, 2019
26.
go back to reference Garey M, Johnson D (1979) A guide to the theory of NP-completeness. Comput Intractability Garey M, Johnson D (1979) A guide to the theory of NP-completeness. Comput Intractability
27.
go back to reference 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–398 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–398
28.
go back to reference Iooss B, Lemaître P (2015) A review on global sensitivity analysis methods. Uncertainty management in simulation-optimization of complex systems. Springer, Berlin, pp 101–122 Iooss B, Lemaître P (2015) A review on global sensitivity analysis methods. Uncertainty management in simulation-optimization of complex systems. Springer, Berlin, pp 101–122
29.
go back to reference 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–219. IEEE 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–219. IEEE
30.
go back to reference 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–72MathSciNet 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–72MathSciNet
31.
go back to reference 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 5, pp 4104–4108. IEEE 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 5, pp 4104–4108. IEEE
32.
go back to reference Korkmaz S, Babalik A, Kiran MS (2018) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybernet 9(7):1233–1247 Korkmaz S, Babalik A, Kiran MS (2018) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybernet 9(7):1233–1247
33.
go back to reference 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–150 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–150
34.
go back to reference 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–129 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–129
35.
go back to reference Leonard BJ, Engelbrecht AP, Cleghorn CW (2015) Critical considerations on angle modulated particle swarm optimisers. Swarm Intell 9(4):291–314 Leonard BJ, Engelbrecht AP, Cleghorn CW (2015) Critical considerations on angle modulated particle swarm optimisers. Swarm Intell 9(4):291–314
36.
go back to reference 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–331 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–331
37.
go back to reference Liu J, Wu C, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for the 0–1 multidimensional knapsack problem. Appl Math Model 40(23–24):9788–9805MathSciNetMATH Liu J, Wu C, Cao J, Wang X, Teo KL (2016) A binary differential search algorithm for the 0–1 multidimensional knapsack problem. Appl Math Model 40(23–24):9788–9805MathSciNetMATH
38.
go back to reference 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–8 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–8
39.
go back to reference López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The irace package: Iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43–58MathSciNet López-Ibáñez M, Dubois-Lacoste J, Cáceres LP, Birattari M, Stützle T (2016) The irace package: Iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43–58MathSciNet
40.
go back to reference Mann PS, Singh S (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40–52 Mann PS, Singh S (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40–52
41.
go back to reference 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–178MathSciNetMATH 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–178MathSciNetMATH
42.
go back to reference 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–150 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–150
43.
go back to reference 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–14 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–14
44.
go back to reference Pampara G (2012) Angle modulated population based algorithms to solve binary problems. PhD thesis, University of Pretoria, Pretoria Pampara G (2012) Angle modulated population based algorithms to solve binary problems. PhD thesis, University of Pretoria, Pretoria
45.
go back to reference 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–793 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–793
46.
go back to reference 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–3):70–77 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–3):70–77
47.
go back to reference Saremi S, Mirjalili S, Lewis A (2015) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625–640 Saremi S, Mirjalili S, Lewis A (2015) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625–640
48.
go back to reference Smith-Miles K, Baatar D, Wreford B, Lewis R (2014) Towards objective measures of algorithm performance across instance space. Comput Oper Res 45:12–24MathSciNetMATH Smith-Miles K, Baatar D, Wreford B, Lewis R (2014) Towards objective measures of algorithm performance across instance space. Comput Oper Res 45:12–24MathSciNetMATH
49.
go back to reference 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–645MATH 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–645MATH
50.
go back to reference 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–1252 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–1252
51.
go back to reference Talbi E-G (2016) Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann Oper Res 240(1):171–215MathSciNetMATH Talbi E-G (2016) Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann Oper Res 240(1):171–215MathSciNetMATH
52.
go back to reference Tsai C-W, Chiang M-C, Ksentini A, Chen M (2016) Metaheuristic algorithms for healthcare: open issues and challenges. Compu Electr Eng 53:421–434 Tsai C-W, Chiang M-C, Ksentini A, Chen M (2016) Metaheuristic algorithms for healthcare: open issues and challenges. Compu Electr Eng 53:421–434
53.
go back to reference Tyasnurita R, Özcan 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 Tyasnurita R, Özcan 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
54.
go back to reference 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–157MathSciNetMATH 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–157MathSciNetMATH
55.
go back to reference Veček N, Mernik M, Filipič B, Črepinšek M (2016) Parameter tuning with chess rating system (CRS-tuning) for meta-heuristic algorithms. Inf Sci 372:446–469 Veček N, Mernik M, Filipič B, Črepinšek M (2016) Parameter tuning with chess rating system (CRS-tuning) for meta-heuristic algorithms. Inf Sci 372:446–469
56.
go back to reference 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 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
57.
go back to reference Yalcinoz T, Altun H (2001) Power economic dispatch using a hybrid genetic algorithm. IEEE Power Eng Rev 21(3):59–60 Yalcinoz T, Altun H (2001) Power economic dispatch using a hybrid genetic algorithm. IEEE Power Eng Rev 21(3):59–60
58.
go back to reference Yang M-H (2001) An efficient algorithm to allocate shelf space. Eur J Oper Res 131(1):107–118MATH Yang M-H (2001) An efficient algorithm to allocate shelf space. Eur J Oper Res 131(1):107–118MATH
59.
go back to reference 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–722. IEEE 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–722. IEEE
60.
go back to reference Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17(3):303–351MATH Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heuristics 17(3):303–351MATH
61.
go back to reference 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–595 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–595
62.
go back to reference 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–7120 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–7120
Metadata
Title
Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem
Authors
José García
Eduardo Lalla-Ruiz
Stefan Voß
Enrique López Droguett
Publication date
21-02-2020
Publisher
Springer Berlin Heidelberg
Published in
International Journal of Machine Learning and Cybernetics / Issue 9/2020
Print ISSN: 1868-8071
Electronic ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-020-01085-8

Other articles of this Issue 9/2020

International Journal of Machine Learning and Cybernetics 9/2020 Go to the issue