Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier B.V., Amsterdam (2014)
Leung, Y.W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5(1), 41–53 (2002)
Ciornei, I., Kyriakides, E.: Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization. IEEE Trans. Syst. Man Cybern. Part B Cybern. Publ. IEEE Syst. Man Cybern. Soc. 42(1), 234 (2012)
Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656–667 (2002)
Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)
Kaveh, A., Talatahari, S.: An improved ant colony optimization for constrained engineering design problems. Eng. Comput. 27(1), 155–182 (2010)
He, Q., Wang, L.: An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng. Appl. Artif. Intell. 20(1), 89–99 (2007)
Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 169–178. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04944-6_14
Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol. 284, 65–74 (2010)
Kaveh, A., Talatahari, S.: A novel heuristic optimization method: charged system search. Acta Mech. 213(3–4), 267–289 (2010)
Yang, X.S., Deb, S.: Cuckoo search via lévy flights. Nat. Biol. Inspired Comput. 71(1), 210–214 (2010)
Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228–249 (2015)
Bouchekara, H.R.E.H.: Electromagnetic device optimization based on electromagnetism-like mechanism. Appl. Comput. Electromagnet. Soc. J. 28(3), 241–248 (2013)
Bouchekara, H.R.E.H.: Most Valuable Player Algorithm: a novel optimization algorithm inspired from sport. Oper. Res. Int. J. 80, 1–57 (2017)
Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching-Learning-Based Optimization: an optimization method for continuous non-linear large scale problems. Inf. Sci. 183(1), 1–15 (2012)
Gandomi, A.H., Yang, X.S., Alavi, A.H.: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng. Comput. 29(2), 245 (2013)
Coello, C.A.C., Montes, E.M.: Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv. Eng. Inform. 16(3), 193–203 (2002)
Deb, K.: GeneAS: a robust optimal design technique for mechanical component design. In: Dasgupta, D., Michalewicz, Z. (eds.) Evolutionary Algorithms in Engineering Applications, pp. 497–514. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-662-03423-1_27
Li, L.J., Huang, Z.B., Liu, F., et al.: A heuristic particle swarm optimizer for optimization of pin connected structures. Comput. Struct. 85(7–8), 340–349 (2007)
Acknowledgment
This work is supported by National Science Foundation of China under Grant No. 61563008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Liu, X., Luo, Q., Wang, D., Abdel-Baset, M., Jiang, S. (2018). An Improved Most Valuable Player Algorithm with Twice Training Mechanism. In: Huang, DS., Bevilacqua, V., Premaratne, P., Gupta, P. (eds) Intelligent Computing Theories and Application. ICIC 2018. Lecture Notes in Computer Science(), vol 10954. Springer, Cham. https://doi.org/10.1007/978-3-319-95930-6_85
Download citation
DOI: https://doi.org/10.1007/978-3-319-95930-6_85
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95929-0
Online ISBN: 978-3-319-95930-6
eBook Packages: Computer ScienceComputer Science (R0)