A human learning optimization algorithm and its application to multi-dimensional knapsack problems

A novel meta-heuristic named human learning optimization (HLO) is presented.Four learning operators inspired by the human learning process are developed.HLO is applied to solve multi-dimensional knapsack problems.The experimental results show that HLO is a promising optimization tool. Inspired by human learning mechanisms, a novel meta-heuristic algorithm named human learning optimization (HLO) is presented in this paper in which the individual learning operator, social learning operator, random exploration learning operator and re-learning operator are developed to generate new solutions and search for the optima by mimicking the human learning process. Then HLO is applied to solve the well-known 5.100 and 10.100 multi-dimensional knapsack problems from the OR-library and the performance of HLO is compared with that of other meta-heuristics collected from the recent literature. The experimental results show that the presented HLO achieves the best performance in comparison with other meta-heuristics, which demonstrates that HLO is a promising optimization tool.

[1]  Panos M. Pardalos,et al.  An adaptive fuzzy controller based on harmony search and its application to power plant control , 2013 .

[2]  Minrui Fei,et al.  Comparative performance analysis of various binary coded PSO algorithms in multivariable PID controller design , 2012, Expert Syst. Appl..

[3]  Jingqi Fu,et al.  A Novel Probability Binary Particle Swarm Optimization Algorithm and Its Application , 2008, J. Softw..

[4]  Dervis Karaboga,et al.  A survey: algorithms simulating bee swarm intelligence , 2009, Artificial Intelligence Review.

[5]  M. J. Mahjoob,et al.  A novel meta-heuristic optimization algorithm inspired by group hunting of animals: Hunting search , 2010, Comput. Math. Appl..

[6]  Mingchang Chih,et al.  Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem , 2015, Appl. Soft Comput..

[7]  Mostafa Zandieh,et al.  An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times , 2006, Appl. Math. Comput..

[8]  Panos M. Pardalos,et al.  An improved adaptive binary Harmony Search algorithm , 2013, Inf. Sci..

[9]  Victor O. K. Li,et al.  Chemical-Reaction-Inspired Metaheuristic for Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[10]  Andries Petrus Engelbrecht,et al.  Binary Differential Evolution , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[11]  André Rossi,et al.  An Artificial Bee Colony Algorithm for the 0-1 Multidimensional Knapsack Problem , 2010, IC3.

[12]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[13]  Zong Woo Geem,et al.  Harmony Search in Water Pump Switching Problem , 2005, ICNC.

[14]  A. Vasan,et al.  Comparative analysis of Simulated Annealing, Simulated Quenching and Genetic Algorithms for optimal reservoir operation , 2009, Appl. Soft Comput..

[15]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.

[16]  Sameh Al-Shihabi,et al.  A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem , 2010, Comput. Oper. Res..

[17]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[18]  Dorothy Ndedi Monekosso,et al.  A review of ant algorithms , 2009, Expert Syst. Appl..

[19]  Z. Michalewicz,et al.  A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[21]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[22]  M. Mahdavi,et al.  ARTICLE IN PRESS Available online at www.sciencedirect.com , 2007 .

[23]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[24]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[25]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[26]  Minrui Fei,et al.  A novel modified binary differential evolution algorithm and its applications , 2012, Neurocomputing.

[27]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[28]  George L. Gerstein,et al.  Two enhancements of the gravity algorithm for multiple spike train analysis , 2006, Journal of Neuroscience Methods.

[29]  Jian-Wei Ma,et al.  An improved artificial fish-swarm algorithm and its application in feed-forward neural networks , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[30]  Chun-Yin Wu,et al.  Topology optimization of structures using modified binary differential evolution , 2010 .

[31]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .