Skip to main content
Log in

SVSA: a Semi-Vortex Search Algorithm for solving optimization problems

  • Regular Paper
  • Published:
International Journal of Data Science and Analytics Aims and scope Submit manuscript

Abstract

The Vortex Search Algorithm (VSA) is a single-based meta-heuristic algorithm inspired by the vortices created by stirred fluids. A VSA search creates nested vortices starting from an initial center (the middle of the boundaries), and the vortices are gradually scaled down. In each iteration, the center of a new vortex is created by searching around the previous center and creating a set of candidate solutions with a Gaussian distribution, selecting best of them and comparing it with previous center, in order to replace it. However, this strategy can become trapped in a local optimum, since the search space may not be explored properly by time passing and according to the structure of the many objective functions. Therefore, in this paper an improved version of the VSA is introduced. Actually, the proposed method is not necessarily limited to creating nested vortices; after employing the VSA, the search space is explored by a uniform distribution in each iteration, then the center of the vortex moves toward the best random solution. In this situation, if the shifted center is better than the previous center, then the center is transferred to the new point; in this way, the VSA runs at the shifted center in the next iteration. Therefore, the proposed method is Semi-VSA (SVSA) and its vortices are animated, not necessarily nested. Experiments on 50 benchmark optimization functions indicate that the SVSA is able to improve the VSA, especially when the VSA has been trapped in a local optimum.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Boussaid, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Inf. Sci. 237(1), 82–117 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Sajedi, H., Razavi, S.F.: DGSA: discrete gravitational search algorithm for solving knapsack problem. Oper. Res. 17(2), 563–591 (2017)

    Google Scholar 

  3. Mohammadi, F.G., Sajedi, H.: Region based Image Steganalysis using Artificial Bee Colony. J. Vis. Commun. Image Represent. 44, 214–226 (2017)

    Article  Google Scholar 

  4. Dogan, B., Olmez, T.: A new metaheuristic for numerical function optimization: Vortex Search Algorithm. Inf. Sci. 293(1), 125–145 (2015)

    Article  Google Scholar 

  5. Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, Berlin (2006)

    Google Scholar 

  6. Han, S., Qin, H.: A greedy algorithm to construct sparse graph by using ranked dictionary. Int. J. Data Sci. Anal. 2(3), 131–143 (2016)

    Article  Google Scholar 

  7. Han, S., Qin, H.: A greedy algorithm to construct sparse graph by using ranked dictionary. Int. J. Data Sci. Anal. 2(3–4), 131–143 (2016)

    Article  Google Scholar 

  8. Giacometti, A., Soulet, A.: Anytime algorithm for frequent pattern outlier detection. Int. J. Data Sci. Anal. 2(3), 119–130 (2016)

    Article  Google Scholar 

  9. Sajedi, H., Razavi, S.F.: MVSA: multiple Vortex Search Algorithm. In: 17th International Symposium on Computational Intelligence and Informatics (CINTI), pp. 169–174 (2016)

  10. Dogan, B.: A modified Vortex Search Algorithm for numerical function optimization. Int. J. Artif. Intell. Appl. (IJAIA) 7(3), 37–54 (2016)

    Google Scholar 

  11. Wang, Z., Wu, G., Wan, Z.: A novel hybrid vortex search and Artificial Bee Colony algorithm for numerical optimization problems. Wuhan Univ. J. Nat. Sci. 22(4), 295–306 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dogan, B., Olmez, T.: Vortex Search Algorithm for the analog active filter component selection problem. AEU-Int. J. Electron. Commun. 69(9), 1243–1253 (2015)

    Article  Google Scholar 

  13. Dogan, B., Yuksel, A.: Analog filter group delay optimization using the Vortex Search Algorithm. In: 23nd Signal Processing and Communications Applications Conference (SIU), pp. 288–291 (2015)

  14. Dogan, B., Olmez, T.: Modified off-lattice AB model for protein folding problem using the Vortex Search Algorithm. Int. J. Mach. Learn. Comput. 5(4), 329–333 (2015)

    Article  Google Scholar 

  15. Ozkis, A., Babalik, A.: A novel metaheuristic for multi-objective optimization problems: the multi-objective Vortex Search Algorithm. Inf. Sci. 402(1), 124–148 (2017)

    Article  Google Scholar 

  16. Saka, M., Tezcan, S.S., Eke, I., Taplamacioglu, M.C.: Economic load dispatch using Vortex Search Algorithm. In: 4th International Conference on Electrical and Electronic Engineering (ICEEE), pp. 77–81 (2017)

  17. Kuyu, Y.C., Erdem, N.: Solving economic load dispatch problem using Vortex Search Algorithm. In: 10th International Conference on Electrical and Electronics Engineering, pp. 1–5 (2017)

  18. Ali, W., Qyyum, M.A., Qadeer, K., Lee, M.: Energy optimization for single mixed refrigerant natural gas liquefaction process using the metaheuristics Vortex Search Algorithm. Appl. Therm. Eng. 129(1), 782–791 (2018)

    Article  Google Scholar 

  19. Saka, M., Eke, I., Tezcan, S.S., Taplamacioglu, M.C.: Analysis of economic load dispatch with a lot of constraints using Vortex Search Algorithm. Adv. Sci. Technol. Eng. Syst. J. 2(6), 151–156 (2017)

    Article  Google Scholar 

  20. Aydin, O., Tezcan, S.S., Eke, I., Taplamacioglu, M.C.: Solving the optimal power flow quadratic cost functions using Vortex Search Algorithm. IFAC-PapersOnLine 50(1), 239–244 (2017)

    Article  Google Scholar 

  21. Huang, Y., Hou, G., Cheng, X., Feng, B., Gao, L., Xiao, M.: A new Vortex Search Algorithm with gradient-based approximation for optimization of the fore part of KCS container ship. J. Mar. Sci. Technol. 22(3), 403–413 (2017)

    Article  Google Scholar 

  22. http://web.itu.edu.tr/~bdogan/VortexSearch/VS.htm. Access date: 7/24/2017

  23. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  24. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of the IEEE International Joint Conference on Neural Networks, pp. 1942–1948 (1995)

  25. Steinbuss, G., Böhm, K.: Hiding outliers in high-dimensional data spaces. Int. J. Data Sci. Anal. 4(3), 173–189 (2017)

    Article  Google Scholar 

  26. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hedieh Sajedi.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Razavi, S.F., Sajedi, H. SVSA: a Semi-Vortex Search Algorithm for solving optimization problems. Int J Data Sci Anal 8, 15–32 (2019). https://doi.org/10.1007/s41060-018-0154-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41060-018-0154-6

Keywords

Navigation