An Improved Most Valuable Player Algorithm with Twice Training Mechanism

The most valuable player algorithm is inspired from these players who want to win the Most Valuable Player (MVP) trophy, it have higher overall success percentage. Teaching-learning-based optimization (TLBO) simulates the process of teaching and learning. TLBO has fewer parameters that must be determined during the renewal process. This paper proposes twice training mechanism to enhance the search ability of the most valuable player algorithm (MVPA) through hybrid TLBO algorithm, and named it teaching the most valuable player algorithm (TMVPA). In TMVPA, designs two behaviors of training and abstract two training modes: pre-competition training and post-competition training. Before individual competition, join the pre-competition training to coordinated exploitation ability and the exploration ability of the original algorithm and join the post-competition training to prevent from falling into the local optimal field after the corporate competition. We test three benchmark functions and an engineering design problem. Results show that TMVPA has effectively raised algorithm accuracy.

[1]  Xin-She Yang,et al.  Firefly Algorithms for Multimodal Optimization , 2009, SAGA.

[2]  R. Venkata Rao,et al.  Teaching-Learning-Based Optimization: An optimization method for continuous non-linear large scale problems , 2012, Inf. Sci..

[3]  A. Kaveh,et al.  A novel heuristic optimization method: charged system search , 2010 .

[4]  Seyed Mohammad Mirjalili,et al.  Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm , 2015, Knowl. Based Syst..

[5]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[6]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[7]  Q. H. Wu,et al.  A heuristic particle swarm optimizer for optimization of pin connected structures , 2007 .

[8]  Ling Wang,et al.  An effective co-evolutionary particle swarm optimization for constrained engineering design problems , 2007, Eng. Appl. Artif. Intell..

[9]  H. R. E. H. Bouchekara,et al.  Most Valuable Player Algorithm: a novel optimization algorithm inspired from sport , 2020, Oper. Res..

[10]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[11]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[12]  Siamak Talatahari,et al.  An improved ant colony optimization for constrained engineering design problems , 2010 .

[13]  Xin-She Yang,et al.  Nature-Inspired Optimization Algorithms: Challenges and Open Problems , 2020, J. Comput. Sci..

[14]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[15]  Kalyanmoy Deb,et al.  GeneAS: A Robust Optimal Design Technique for Mechanical Component Design , 1997 .

[16]  Elias Kyriakides,et al.  Hybrid Ant Colony-Genetic Algorithm (GAAPI) for Global Continuous Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[17]  Yuping Wang,et al.  An orthogonal genetic algorithm with quantization for global numerical optimization , 2001, IEEE Trans. Evol. Comput..

[18]  Amir Hossein Gandomi,et al.  Erratum to: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems , 2013, Engineering with Computers.