Abstract
Monarch butterfly optimization (MBO) is a newly proposed meta-heuristic algorithm for solving optimization problems. It has been proved experimentally that MBO is superior to the other five state-of-the-art meta-heuristic algorithms on most test problems. This paper presents a new improved MBO algorithm with Simulated Annealing (SA) strategy, in which the SA strategy is involved into the migration operator and butterfly adjusting operator. So the newly proposed algorithm SAMBO not only accepts all the butterfly individuals whose fitness are better than their parents’ but also randomly selects some individuals that are worse than their parents to disturbance the convergence of algorithm. In the final, the experiments are carried out on 14 famous continuous nonlinear functions; the results demonstrate that SAMBO algorithm is significantly better than the original MBO algorithm on most test functions.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014). ISBN: 978-0-12-416743-8
Wang, G., Guo, L., Duan, H., Liu, L., Wang, H., Shao, M.: Pathplanning for uninhabited combat aerial vehicle using hybrid metaheuristic DE/BBO algorithm. Adv. Sci. Eng. Med. 4(6), 550–564 (2012)
Zhou, Z.: Machine Learning. Tsinghua University Press, Beijing (2016)
Feng, Y., Wang, G.G., Deb, S., Lu, M., Zhao, X.J.: Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput. Appl. 28(7), 1619–1634 (2017). https://doi.org/10.1007/s00521-015-2135-1
Duan, H., Luo, Q.: New progresses in swarm intelligence-based computation. Int. J. Bio-Inspired Comput. 7(1), 26–35 (2015)
Gao, X.Z., Ovaska, S.J., Wang, X., Chow, M.Y.: A neural networks-based negative selection algorithm in fault diagnosis. Neural Comput. Appl. 17(1), 91–98 (2007)
Cui, Z., Fan, S., Zeng, J., Shi, Z.: APOA with parabola model for directing orbits of chaotic systems. Int. J. Bio-Inspired Comput. 5(1), 67–72 (2013)
Cui, Z., Gao, X.: Theory and applications of swarm intelligence. Neural Comput. Appl. 21(2), 205–206 (2012)
Zhao, X.: A perturbed particle swarm algorithm for numerical optimization. Appl. Soft Comput. 10(1), 119–124 (2010)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)
Mirjalili, S., Wang, G.-G., Coelho, L.S.: Binary optimization using hybrid particle swarm optimization and gravitational search algorithm. Neural Comput. Appl. 25(6), 1423–1435 (2014)
Li, X., Zhang, J., Yin, M.: Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput. Appl. 24(7–8), 1867–1877 (2014)
Zainal, N., Zain, A.M., Sharif, S.: Overview of artificial fish swarm algorithm and its applications in industrial problems. Appl. Mech. Mater. 815, 253–257 (2015)
Wang, G.G, Deb, S, Cui, Z.: Monarch butterfly optimization. Neural Comput. Appl., 1–20 (2015)
Ahuja, R.K., Orlin, J.B., Sharma, D.: Very large-scale neighborhood search. Int. Trans. Oper. Res. 7(4-5), 301–317 (2000)
Ceschia, S., Schaerf, A., Stützle, T.: Local search techniques for a routing-packing problem. Comput. Ind. Eng. 66(4), 1138–1149 (2013)
Ceschia, S., Schaerf, A.: Local search and lower bounds for the patient admission scheduling problem. Comput. Oper. Res. 38(10), 1452–1463 (2011)
Sha, Z.-C., Huang, Z.-T., Zhou, Y.-Y., Wang, F.-H.: Blind spreading sequence estimation based on hill-climbing algorithm. In: Proceedings of 2012 IEEE 11th International Conference on Signal Processing (ICSP 2012) Renovate (2012)
Meza, J.C.: Steepest descent. Wiley Interdisc. Rev. Comput. Stat. 2(6), 719–722 (2010)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Glover, F.: Tabu search - part I. ORSA J. Comput. 1(3), 190–306 (1989)
Glover, F.: Tabu search - part II. ORSA J. Comput. 2(1), 4–32 (1990)
Urli, T.: Hybrid meta-heuristics for combinatorial optimization. Ph.D. Thesis, Università degli Studi di Udine, Udine, Italy (2014)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (61373052), the Project of Jilin Provincial Science and Technology Development (20170414004GH).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, X., Tian, X., Zhang, Y. (2019). A New Monarch Butterfly Optimization Algorithm with SA Strategy. In: Douligeris, C., Karagiannis, D., Apostolou, D. (eds) Knowledge Science, Engineering and Management. KSEM 2019. Lecture Notes in Computer Science(), vol 11776. Springer, Cham. https://doi.org/10.1007/978-3-030-29563-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-29563-9_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-29562-2
Online ISBN: 978-3-030-29563-9
eBook Packages: Computer ScienceComputer Science (R0)