Abstract
In 2005, Krishnanand and Ghose (Multimodal function optimization using a glowworm metaphor with applications to collective robotics, 2005a), presented the idea of glowworm metaphor to determine multiple minima in the optimization problem arising in robotics applications. That research paper highlights the glowworm swarm behavior for determining multiple local minima for multimodal functions with application to robotics. Since then, a number of research papers have appeared to improve the performance of glowworm swarm optimization (GSO). In this paper, two major contributions are made. Firstly, a mathematical result is proved which shows that the step size of GSO has a significant influence on the convergence of GSO. Secondly, three variants of GSO are proposed which depend on different step size. Based on the implementation of the proposed variants and the original GSO on 15 benchmark problems, it is concluded that one of the proposed variants is a definite improvement over the original GSO and the remaining variants.
Similar content being viewed by others
References
Gong Q, Zhou Y, Luo Q (2011a) Hybrid artificial glowworm swarm optimization algorithm for solving multi-dimensional knapsack problem. Proced Eng 15:2880–2884
Gong QQ, Zhou YQ, Yang Y (2011b) Artificial glowworm swarm optimization algorithm for solving 0–1 knapsack problem. Adv Mater Res 143:166–171
Huang Z, Zhou Y (2011) Using glowworm swarm optimization algorithm for clustering analysis. J Converg Inf Technol 6(2):78–85
Huang K, Zhou Y, Wang Y (2011) Niching glowworm swarm optimization algorithm with mating behavior. J Inf Comput Sci 8:4175–4184
Krishnanand KN, Ghose D (2005a) Multimodal function optimization using a glowworm metaphor with applications to collective robotics. Proceedings of the 2nd Indian international conference on artificial
Krishnanand KN, Ghose D (2005b) Detection of multiple source locations using a glowworm metaphor with applications to collective robotics. In swarm intelligence symposium
Krishnanand KN, Ghose D (2006) Glowworm swarm based optimization algorithm for multimodal functions with collective robotics applications. Multiagent Grid Syst 2(3):209–222
Krishnanand KN, Ghose D (2008a) Glowworm swarm optimization algorithm for hazard sensing in ubiquitous environments using heterogeneous agent swarms. In soft computing applications in industry. Springer, Berlin, pp 165–187
Krishnanand KN, Ghose D (2008b) Theoretical foundations for rendezvous of glowworm-inspired agent swarms at multiple locations. Robot Auton Syst 56(7):549–569
Krishnanand KN, Ghose D (2009) Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions. Swarm Intell 3(2):87–124
Liu X, Xuan S, Liu F (2013) Single-dimension perturbation glowworm swarm optimization algorithm for block motion estimation. Math Probl Eng 5:1–10
Liu H, Zhou Y, Yang Y, Gong Q, Huang Z (2010) A novel hybrid optimization algorithm based on glowworm swarm and fish school. J Comput Inf Syst 6(13):4533–4541
Liu J, Zhou Y, Huang K, Ouyang Z, Wang Y (2011) A glowworm swarm optimization algorithm based on definite updating search domains. J Comput Inf Syst 7(10):3698–3705
Oramus P (2010) Improvements to glowworm swarm optimization algorithm. Comput Sci 11:7–20
Ouyang A, Liu L, Yue G, Zhou X, Li K (2014) BFGS-GSO for global optimization problems. J Comput 9(4):966–973
Qu L, He D, Wu J (2011) Hybrid coevolutionary glowworm swarm optimization algorithm for fixed point equation. J Inf Comput Sci 8(9):1721–1728
Qua L, Hea D, Wua J (2011) Hybrid coevolutionary glowworm swarm optimization algorithm with simplex search method for system of nonlinear equations. J Inf Computat Sci 8(13):2693–2701
Senthilnath J, Omkar SN, Mani V, Tejovanth N, Diwakar PG, Archana BS (2011) Multi-spectral satellite image classification using glowworm swarm optimization. Geosci Remote Sens Symp 2011:47–50
Singh A, Deep K (2015) How improvements in glowworm swarm optimization can solve real life problems, In Proceedings of fourth international conference on soft computing for problem solving, Springer, New Delhi
Wu B, Qian C, Ni W, Fan S (2012) The improvement of glowworm swarm optimization for continuous optimization problems. Expert Syst Appl 39(7):6335–6342
Yang Y, Zhou Y (2011) Glowworm swarm optimization algorithm for solving numerical integral. In Intelligent computing and information science. Springer, Berlin, pp 389–394
Yang Y, Zhou Y, Gong Q (2010) Hybrid artificial glowworm swarm optimization algorithm for solving system of nonlinear equations. J Comput Inf Syst 6(10):3431–3438
Zeng Y, Zhang J (2012) Glowworm swarm optimization and heuristic algorithm for rectangle packing problem. In 2012 IEEE international conference on information science and technology
Zhao G, Zhou Y, Wang Y (2012) The glowworm swarm optimization algorithm with local search operator. J Inf Comput Sci 9(5):1299–1308
Zhou Y, Liu J, Zhao G (2012a) Leader glowworm swarm optimization algorithm for solving nonlinear equations systems. Prz Elektrotech 1:101–106
Zhou Y, Zhou G, Zhang J (2013a) A hybrid glowworm swarm optimization algorithm to solve constrained multimodal functions optimization. Optimization 64(4):1–24
Zhou Y, Ouyang Z, Liu J, Sang G (2012b) A novel K-means image clustering algorithm based on glowworm swarm optimization. Prz Elektrotech 52:266–270
Zhou Y, Luo Q, Liu J (2013b) Glowworm swarm optimization for optimization dispatching system of public transit vehicles. J Theor Appl Inf Technol 52(2):205–210
Zhou Y, Luo Q, Liu J (2013c) Glowworm swarm optimization for dispatching system of public transit vehicles. Neural Process Lett 40(1):1–9
Zhou Y, Zhou G, Wang Y, Zhao G (2013d) A Glowworm swarm optimization algorithm based tribes. Appli Math Inf Sci 7:537–541
Zhou Y, Zhou G, Zhang J (2013e) A Hybrid glowworm swarm optimization algorithm for constrained engineering design problems. Appl Math Inf Sci 7(1):379–388
Acknowledgments
One of the authors (Amarjeet Singh) would like to thank Council for Scientific and Industrial Research (CSIR), New Delhi, India, for providing him the financial support vide Grant No 9938-11-44.
Author information
Authors and Affiliations
Corresponding author
Appendix A: List of test problems
Appendix A: List of test problems
Problem 1: Easom 2D problem
Subject to \( - 10 \le x_{1} ,x_{2} \le 10 \). It has minimum value \( f(x^{*} ) = - 1 \) at \( x^{*} = (\pi ,\pi ).\)
Problem 2: Becker and Lago problem
Subject to \( - 10 \le x_{1} ,x_{2} \le 10. \) it has four minima located at \( x^{*} = \left( { \pm 5, \pm 5} \right) \) all with \( f(x^{*} ) = 0. \)
Problem 3: Aluffi-Pentini’s problem
Subject to \( - 10 \le x_{1} ,x_{2} \le 10. \) it has two local minima and global minima is located at \( x^{*} = \left( { - 1.0465,\,0} \right) \) with \( f(x^{*} ) \approx - 0.3523. \)
Problem 4: Wood’s problem
Subject to \( - 10 \le x_{1} ,x_{2} ,x_{3} ,x_{4} \le 10. \) minima is located at \( x^{*} = \left( {1,1,1,1} \right) \) with \( f(x^{*} ) = 0. \)
Problem 5: Miele and Cantrell’s problem\( Min\,\,f_{5} (x) = (\exp (x_{1} ) - x_{2} )^{4} + 100(x_{2} - x_{3} )^{6} + (\tan (x_{3} - x_{4} ))^{4} + x_{1}^{8} \) Subject to \( - 1 \le x_{1} ,x_{2} ,x_{3} ,x_{4} \le 1. \) minima is located at \( x^{*} = \left( {0,1,1,1} \right) \) with \( f(x^{*} ) = 0. \)
Problem 6: Bohachevsky 1 problem
Subject to \( - 50 \le x_{1} ,x_{2} \le 50. \) the number of local minima is unknown but it has global minima at \( x^{*} = \left( {0,\,0} \right) \) with \( f(x^{*} ) = 0. \)
Problem 7: Bohachevsky 2 problem
Subject to \( - 50 \le x_{1} ,x_{2} \le 50. \) the number of local minima is unknown but it has global minima at \( x^{*} = \left( {0,\,0} \right) \) with \( f(x^{*} ) = 0. \)
Problem 8: Branin problem
Subject to \( - 5 \le x_{1} \le 10,\,0 \le x_{1} \le 15. \) it have three minima located at \( x^{*} = \left( { - \pi ,\,\,12.275} \right),\,\left( {\pi ,\,2.275} \right),\,\,\left( {3\pi ,\,2.475} \right) \) all with \( f(x^{*} ) = {5 \mathord{\left/ {\vphantom {5 {(4\pi }}} \right. \kern-0pt} {(4\pi }}). \)
Problem 9: Eggcrate problem
Subject to \( - 2\pi \le x_{1} ,\,x_{2} \le 2\pi . \) it is highly nonlinear and has many local optima. The global minima is located at \( x^{*} = (0,0) \) with \( f(x^{*} ) = 0. \)
Problem 10: Modified Rosenbrock problem
Subject to \( - 5 \le x_{1} ,x_{2} \le 5. \) It has two global minima located at \( x^{*} \approx \left( {0.3412,\,0.1164} \right),\,(1,\,1) \) with \( f(x^{*} ) = 0. \)
Problem 11: Periodic problem
Subject to \( - 10 \le x_{1} ,x_{2} \le 10. \) it has a global minimum at \( x^{*} = (0,0) \) with \( f(x^{*} ) = 0.9 \) and also have 49 local minima all with minimum value 1.
Problem 12: Powell problem
Subject to \( - 10 \le x_{1} ,x_{2} ,x_{3} ,x_{4} \le 10. \) it has a global minimum at \( x^{*} = (0,0,0,0) \) with \( f(x^{*} ) = 0.\)
Problem 13: Camel Back-3 Hump problem
Subject to \( - 5 \le x_{1} ,x_{2} \le 5. \) It has three local minima, one of them is global at \( x^{*} = (0,0) \) with \( f(x^{*} ) = 0. \)
Problem 14: Camel Back-6 Hump problem
Subject to \( - 5 \le x_{1} ,x_{2} \le 5. \) It has three local minima with values \( f \approx - 1.0316,\, - 0.2154,\,2.1042, \) and two global minima at \( x^{*} \approx (0.089842, - 0.712656),\,( - 0.089846,0.712656) \) with \( f(x^{*} ) \approx - 1.0316. \)
Problem 15: McCormick problem
Subject to \( - 1.5 \le x_{1} \le 4 \) and \( - 3 \le x_{2} \le 3. \) It has local minima at \( (2.59,1.59) \) and a global minima at \( x^{*} = ( - 0.547, - 1.547) \) with \( f(x^{*} ) \approx - 1.9133. \)
Rights and permissions
About this article
Cite this article
Singh, A., Deep, K. New variants of glowworm swarm optimization based on step size. Int J Syst Assur Eng Manag 6, 286–296 (2015). https://doi.org/10.1007/s13198-015-0371-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-015-0371-5