Advertisement

An Improved Most Valuable Player Algorithm with Twice Training Mechanism

  • Xin Liu
  • Qifang Luo
  • Dengyun Wang
  • Mohamed Abdel-Baset
  • Shengqi Jiang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10954)

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.

Keywords

Most valuable player algorithm Two training modes Benchmark functions Teaching-learning-based optimization Engineering design problems 

Notes

Acknowledgment

This work is supported by National Science Foundation of China under Grant No. 61563008.

References

  1. 1.
    Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier B.V., Amsterdam (2014)MATHGoogle Scholar
  2. 2.
    Leung, Y.W., Wang, Y.: An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans. Evol. Comput. 5(1), 41–53 (2002)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Srinivas, M., Patnaik, L.M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. Syst. Man Cybern. 24(4), 656–667 (2002)CrossRefGoogle Scholar
  5. 5.
    Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)CrossRefGoogle Scholar
  6. 6.
    Kaveh, A., Talatahari, S.: An improved ant colony optimization for constrained engineering design problems. Eng. Comput. 27(1), 155–182 (2010)CrossRefGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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_14CrossRefGoogle Scholar
  9. 9.
    Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol. 284, 65–74 (2010)MATHGoogle Scholar
  10. 10.
    Kaveh, A., Talatahari, S.: A novel heuristic optimization method: charged system search. Acta Mech. 213(3–4), 267–289 (2010)CrossRefGoogle Scholar
  11. 11.
    Yang, X.S., Deb, S.: Cuckoo search via lévy flights. Nat. Biol. Inspired Comput. 71(1), 210–214 (2010)Google Scholar
  12. 12.
    Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228–249 (2015)CrossRefGoogle Scholar
  13. 13.
    Bouchekara, H.R.E.H.: Electromagnetic device optimization based on electromagnetism-like mechanism. Appl. Comput. Electromagnet. Soc. J. 28(3), 241–248 (2013)Google Scholar
  14. 14.
    Bouchekara, H.R.E.H.: Most Valuable Player Algorithm: a novel optimization algorithm inspired from sport. Oper. Res. Int. J. 80, 1–57 (2017)Google Scholar
  15. 15.
    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)MathSciNetCrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    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_27CrossRefGoogle Scholar
  19. 19.
    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)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Xin Liu
    • 1
  • Qifang Luo
    • 1
    • 2
  • Dengyun Wang
    • 1
  • Mohamed Abdel-Baset
    • 3
  • Shengqi Jiang
    • 1
  1. 1.College of Information Science and EngineeringGuangxi University for NationalitiesNanningChina
  2. 2.Guangxi High School Key Laboratory of Complex System and Computational IntelligenceNanningChina
  3. 3.Faculty of Computers and InformaticsZagazig UniversityZagazigEgypt

Personalised recommendations