Skip to main content
SpringerLink
Log in

Pseudo-parallel chaotic self-learning antelope migration algorithm based on mobility models

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Self-learning Antelopes Migration Algorithm (SAMA) is a self-heuristic algorithm that simulates the local exploitation of ordinary antelopes and the global exploration of scout antelopes. Aiming at the imbalance between exploitation and exploration of SAMA, it is easy to fall into local optimum, and the convergence speed and precision will be affected. A pseudo-parallel chaotic self-learning antelope migration algorithm based on mobility model is proposed. Nine chaotic self-learning antelope migration algorithms are formed by incorporating nine kinds of chaotic local searching operators, and the total population is divided into several sub-populations through meme grouping, and the internal circulation optimization is carried out by using nine chaotic SAMAs. After the internal cycle is completed, the five migration models will perform their migration operations and mutation operations to form the pseudo-parallel chaotic SAMA to increase the diversity of the population, improve the optimization accuracy and the ability of the algorithm to balance exploitation and exploration. Three simulation experiments are carried out to verify the effectiveness of the proposed algorithm. Firstly, the chaotic SAMA and the pseudo-parallel chaotic SAMA based on the mobility models are used to optimize 17 benchmark test functions. Secondly, 25 test functions in CEC-BC-2017 are optimized respectively. Finally, the four engineering design problems are optimized, including three-bar truss design, welded beam design, pressure vessel design and spring design problems. Experimental results show that the improved algorithm can better solve the function optimization and engineering optimization problems. The pseudo-parallel chaotic SAMA based on the mobility models has the advantage of balancing exploitation and exploration in the optimization process, and improves the convergence accuracy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33

Similar content being viewed by others

References

  1. Garg, Harish (2016) A hybrid PSO-GA algorithm for constrained optimization problems[J]. Appl Math Comput 274:292–305

    MathSciNet  MATH  Google Scholar 

  2. Sayadi MK, Hafezalkotob A, Naini SGJ (2013) Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation[J]. J Manuf Syst 32(1):78–84

    Article  Google Scholar 

  3. Mokarram V, Banan MR (2018) A new PSO-based algorithm for multi-objective optimization with continuous and discrete design variables[J]. Struct Multidiscip Optim 57(2):509–533

    Article  MathSciNet  Google Scholar 

  4. Assad A, Deep K (2018) A hybrid harmony search and simulated annealing algorithm for continuous optimization[J]. Inf Sci 450:246–266

    Article  Google Scholar 

  5. Song X, Zhao M, Yan Q et al (2019) A high-efficiency adaptive artificial bee colony algorithm using two strategies for continuous optimization[J]. Swarm Evol Comput 50:1–23

    Article  Google Scholar 

  6. Han X, Dong Y, Yue L, Xu Q (2019) State transition simulated annealing algorithm for discrete-continuous optimization problems[J]. IEEE Access 7:44391–44403

    Article  Google Scholar 

  7. Venkata R, Patel V (2013) Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems[J]. Int J Ind Eng Comput 4(1):629–640

    Google Scholar 

  8. Jian J, Liu P, Yin J et al (2021) A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application[J]. J Comput Appl Math 113368

  9. Karaboga D, Basturk B (2007) Artificial bee Colony (ABC) optimization algorithm for solving constrained optimization[J]. Foundations of Fuzzy Logic & Soft Computing 11(3):789–798

    Article  MATH  Google Scholar 

  10. Gandomi AH, Yang XS, Alavi AH, Talatahari S (2013) Bat algorithm for constrained optimization tasks[J]. Neural Comput & Applic 22(6):1239–1255

    Article  Google Scholar 

  11. Saber AY, Ahmmed S, Alshareef A, et al. (2008) Constrained non-linear optimization by modified particle swarm optimization[C]// Computer and information technology, 2007. iccit 2007. 10th international conference on. IEEE, 1–7

  12. Cardoso MF, Salcedo RL, Azevedo SFD (1996) The simplex-simulated annealing approach to continuous non-linear optimization[J]. Comput Chem Eng 20(9):1065–1080

    Article  Google Scholar 

  13. Xing Y, Chen Y, Lv C et al (2016) Swarm intelligence-based power allocation and relay selection algorithm for wireless cooperative network[J]. Ksii Transactions on Internet & Information Systems 10(3):1111–1130

    Google Scholar 

  14. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm[J]. 39(3):459–471

  15. Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization[J]. Appl Math Comput 217(7):3166–3173

    MathSciNet  MATH  Google Scholar 

  16. Schrijver A (2004) Combinatorial optimization: polyhedra and efficiency[J]. Q J Belg Fr Ital Oper Res Soc 2(2):153–159

    MATH  Google Scholar 

  17. Kulkarni AJ, Shabir H (2016) Solving 0–1 knapsack problem using cohort intelligence algorithm[J]. Int J Mach Learn Cybern 7(3):427–441

    Article  Google Scholar 

  18. Ouaarab A, Ahiod B, Yang XS (2014) Discrete cuckoo search algorithm for the travelling salesman problem[J]. Neural Comput & Applic 24(7):1659–1669

    Article  Google Scholar 

  19. Kamil AT, Saleh HM, Abd-Alla IH (2021) A multi-swarm structure for particle swarm optimization: solving the welded beam design problem[J]. J Phys Conf Ser 1804(1):012012 (9pp)

    Article  Google Scholar 

  20. Holland JH (1975) Adaptation in natural and artificial systems, vol. 211. Ann Arbor, MI, USA: Univ. of Michigan Press, chs. 1–14

  21. Dorigo M, Birattari M, Thomas S (2007) Ant colony optimization[J]. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  22. Kennedy J, Eberhart R (1995) Particle swarm optimization[C]// Proceedings of ICNN'95 - International Conference on Neural Networks. IEEE, 1942-1948

  23. Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer[J]. Adv Eng Softw 69:46–61

    Article  Google Scholar 

  24. Yang XS (2012) Flower pollination algorithm for global optimization[J], 240–249

  25. Mirjalili S (2015) The ant lion optimizer[J]. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  26. Kaveh A, Eslamlou AD (2020) Water strider algorithm: a new metaheuristic and applications[J]. Structures 25:520–541

    Article  Google Scholar 

  27. Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example[J]. Knowl-Based Syst 26:69–74

    Article  Google Scholar 

  28. Mirjalili S, Lewis A (2016) The whale optimization algorithm[J]. Adv Eng Softw 95:51–67

    Article  Google Scholar 

  29. Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm[J]. Comput Struct 169:1–12

    Article  Google Scholar 

  30. Dhiman G, Kumar V (2017) Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications[J]. Adv Eng Softw 114:48–70

    Article  Google Scholar 

  31. Dhiman G, Kaur A (2019) STOA: a bio-inspired based optimization algorithm for industrial engineering problems[J]. Eng Appl Artif Intell 82:148–174

    Article  Google Scholar 

  32. Jain M, Singh V, Rani A (2018) A novel nature-inspired algorithm for optimization: squirrel search algorithm[J]. Swarm Evol Comput:1–28

  33. Faramarzi A, Heidarinejad M, Mirjalili S, Gandomi AH (2020) Marine predators algorithm: a nature-inspired Metaheuristic[J]. Expert Syst Appl:1–50

  34. Zervoudakis K, Tsafarakis S (2020) A mayfly optimization algorithm[J]. Comput Ind Eng 145:1–81

    Article  Google Scholar 

  35. Yu JJQ, Li VOK (2015) A social spider algorithm for global optimization[J]. Appl Soft Comput J 30:614–627

    Article  Google Scholar 

  36. Kallioras NA, Lagaros ND, Avtzis DN (1978) Pity beetle algorithm - A new metaheuristic inspired by the behaviour of bark beetles[J]. Adv Eng Softw 2018(121):147–166

    Google Scholar 

  37. Harifi S, Khalilian M, Mohammadzadeh J et al (2019) Emperor penguins Colony: a new metaheuristic algorithm for optimization[J]. Evol Intel:1–16

  38. Kaveh A, Zaerreza A (2020) Shuffled shepherd optimization method: a new meta-heuristic algorithm[J]. Eng Comput 37(7):2357–2389

    Article  Google Scholar 

  39. Fard AMF, Keshteli MH, Moghaddam RT (2020) Red deer algorithm (RDA): a new nature-inspired meta-heuristic[J]. Soft Comput:1–29

  40. N. Lin, L. Fu, and L. Zhao, et al. (2019) A high-performance self-learning antelopes migration algorithm (SAMA) for Global Optimization[C]// IEEE, 1025–1032

  41. Hu S, Xu X, Li X (2004) A virus coevolution genetic algorithm for project optimization scheduling[J]. Journal of Software 15(1):49–57

    MATH  Google Scholar 

  42. Pan QK, Wang L, Gao L, Li J (2011) An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem[J]. Int J Adv Manuf Technol 52(5–8):699–713

    Article  Google Scholar 

  43. Wang CD, Zhang YY (2003) Adaptive pseudo-parallel genetic algorithm based on real coding[J]. Journal of Xian Jiaotong University 37(7):707–710

    Google Scholar 

  44. L. Liu, Y. Song, and Y. Dai. Cooperative multi-ant colony pseudo-parallel optimization algorithm. The 2010 IEEE International Conference on Information and Automation, 2010, 1269–1274

  45. Yu ZH (2009) Adaptive pseudo-parallel immune algorithm on optimal path planning problem[J]. Computer Engineering and Applications 45(26):43–45

    Google Scholar 

  46. Keller J, Spenger G, Wendzel S (2017) Ant colony-inspired parallel algorithm to improve cryptographic pseudo random number generators. 2017 IEEE Security and Privacy Workshops (SPW), 1–6

  47. Kaur A, Pal SK, Singh AP (2018) New chaotic flower pollination algorithm for unconstrained non-linear optimization functions[J]. Int J Syst Assur Eng Manag 9(4):853–865

    Article  Google Scholar 

  48. Zhao W, Zhao L (2012) An improved bacterial foraging optimizer with adaptive and chaotic search[J]. J Comput Theoretical Nanoence 7(1):305–308

    Google Scholar 

  49. Anand P, Arora S (2020) A novel chaotic selfish herd optimizer for global optimization and feature selection[J]. Artif Intell Rev:1–46

  50. Heidari AA, Abbaspour RA, Jordehi AR (2017) An efficient chaotic water cycle algorithm for optimization tasks[J]. Neural Comput & Applic 28(1):57–85

    Article  Google Scholar 

  51. Gupta S, Deep K (2018) An opposition-based chaotic Grey wolf optimizer for global optimisation tasks[J]. J Exp Theor Artif Intell:1–29

  52. Saha S, Mukherjee V (2017) A novel quasi-oppositional chaotic antlion optimizer for global optimization[J]. Appl Intell 48(9):2628–2660

    Article  Google Scholar 

  53. Ewees AA, El Aziz MA, Hassanien AE (2017) Chaotic multi-verse optimizer-based feature selection[J]. Neural Comput & Applic:1–16

  54. Simon D (2008) Biogeography-based optimization[J]. IEEE Trans Evol Comput 12(6):702–713

    Article  Google Scholar 

  55. Chai W, Dong H, He J et al (2016) A biogeography-based optimization algorithm with multiple migrations[C]// IEEE/ACIS International Conference on Computer & Information Science. IEEE:1–8

  56. Ma H (2010) An analysis of the equilibrium of migration models for biogeography-based optimization[J]. Information ences 180(18):3444–3464

    MATH  Google Scholar 

  57. Wang G-G, Gandomi AH, Alavi AH (2014) An effective krill herd algorithm with migration operator in biogeography-based optimization[J]. Appl Math Model 38(9–10):2454–2462

    Article  MathSciNet  MATH  Google Scholar 

  58. Vimal S (2014) HBBABC: a hybrid optimization algorithm combining biogeography based optimization (BBO) and artificial bee Colony (ABC) optimization for obtaining global solution of discrete design problems[J]. Int J Comput Eng Res 2(7):85–97

    Google Scholar 

  59. Gouthamkumar N, Veena S, Naresh R, Singhal PK (2015) Sinusoidal migration of biogeography based optimization for short term hydrothermal scheduling[J]. Scholars Journal of Engineering and Technology 3(3A):244–251

    Google Scholar 

  60. Wang JS, Song JD (2016) Migration ratio model analysis of biogeography-based optimization algorithm and performance comparison[J]. Int J Comput Intell Syst 9(3):544–558

    Article  Google Scholar 

  61. Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization," Proceedings 2005 IEEE Swarm Intelligence Symposium. SIS 2005., Pasadena, CA, USA, pp. 68–75

  62. N. H. Awad, M. Z. Ali, J. J. Liang, B. Y. Qu, and P. N. Suganthan (2017) Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization, Nanyang Technological University, Singapore , Jordan University of Science and Technology, Jordan and Zhengzhou University, Zhengzhou China, Technical Repor

  63. Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: a novel physics-based algorithm[J]. Futur Gener Comput Syst 101:646–667

    Article  Google Scholar 

  64. Kommadath R, Kotecha P (2017) Teaching learning based optimization with focused learning and its performance on CEC2017 functions[C]// evolutionary computation. IEEE:2397–2403

Download references

Acknowledgements

This work was supported by the Basic Scientific Research Project of Institution of Higher Learning of Liaoning Province (Grant No. 2017FWDF10), and the Project by Liaoning Provincial Natural Science Foundation of China (Grant No. 20180550700 and 20190550263).

Author information

Authors and Affiliations

  1. School of Electronic and Information Engineering, University of Science & Technology Liaoning, Anshan, 114044, China

    Meng-wei Guo, Jie-sheng Wang, Wei Xie, Sha-sha Guo & Ling-feng Zhu

Authors
  1. Meng-wei Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie-sheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sha-sha Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ling-feng Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

A substantial amount of Meng-wei Guo’s contributions participated in the algorithm simulation and the draft writing. Jie-sheng Wang ‘s contributions participated in the concept, design and critical revision of this paper. Wei Xie’s contributions participated in the data collection and analysis. Sha-sha Guo and Ling-feng Zhu participated in the interpretation and commented on the manuscript.

Corresponding author

Correspondence to Jie-sheng Wang.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this article.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guo, Mw., Wang, Js., Xie, W. et al. Pseudo-parallel chaotic self-learning antelope migration algorithm based on mobility models. Appl Intell 52, 2369–2410 (2022). https://doi.org/10.1007/s10489-021-02510-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02510-3

Keywords

Search

Navigation