Skip to main content

Advertisement

SpringerLink
Log in

MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Vortex search (VS) algorithm is a recently proposed swarm intelligence or evolutionary algorithm for solving continuous optimization problems inspired by the behavior of whirlpool. In this study, an approach based on VS algorithm is proposed to deal with uncapacitated facility location problem (UFLP) which is a pure problem in binary domain. The update mechanism of VS algorithm is not sufficiently useful for solving the binary optimization problems; therefore, a binary form of VS method called modified binary vortex search (for short MBVS) is proposed for solving UFLPs. Three important changes have been carried out on basic VS algorithm such as (1) converting continuous values to binary values; (2) using genetic mutation operators for enhancing the exploration ability and (3) a local search mechanism for extending the exploitation ability. Based on these changes, MBVS has been tested on fifteen different UFLP instances. The UFLPs dealt with in this study is one of the famous binary optimization problems. It is widely used for comparing the performance of superior algorithms. Once an analysis of 10 different transfer functions, a genetic mutation operator, a local search parameter and population size have been made on proposed method; then, it has been compared with some binary metaheuristic methods and their variants: genetic algorithm (GA)-based approaches such as GA-SP, GA-TP and GA-UP; binary particle swarm optimization algorithm (BPSO); binary versions of artificial bee colony (ABC) algorithm such as binABC, DisABC and ABCbin; binary versions of differential evolution (DE) algorithm such as DisDe/rand and binDE and binary variants of the artificial algae algorithm (AAA) such as AAA-Tanh, AAA-Sig and binAAA methods. The experimental results and comparisons reveal that MBVS algorithm is highly competitive and robust optimizer for the problem addressed in this study.

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

Similar content being viewed by others

Data availability

All data generated or analyzed during this study are included in this published article.

References

  1. Norton RD, Hazell PB (1986) Mathematical programming for economic analysis in agriculture. Macmillan New York, NY, USA

  2. Akan T, Agahian S, Dehkharghani R (2022) BinBRO: binary battle royale optimizer algorithm. Expert Syst Appl 116599

  3. Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24:1659–1669

    Article  Google Scholar 

  4. Gunduz M, Aslan M (2021) DJAYA: a discrete Jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275

    Article  Google Scholar 

  5. Li VC, Liang Y-C, Chang H-F (2012) Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method. Comput Oper Res 39:2111–2121

    Article  MathSciNet  Google Scholar 

  6. Aslan M, Gunduz M, Kiran MS (2019) JayaX: Jaya algorithm with xor operator for binary optimization. Appl Soft Comput 82:105576

    Article  Google Scholar 

  7. Holmberg K (1999) Exact solution methods for uncapacitated location problems with convex transportation costs. Eur J Oper Res 114:127–140

    Article  Google Scholar 

  8. Radharamanan R, Choi L (1986) A branch and bound algorithm for the travelling salesman and the transportation routing problems. Comput Ind Eng 11:236–240

    Article  Google Scholar 

  9. Fleischmann B (1985) A cutting plane procedure for the travelling salesman problem on road networks. Eur J Oper Res 21:307–317

    Article  MathSciNet  Google Scholar 

  10. Laporte G, Nobert Y (1980) A cutting planes algorithm for the m-salesmen problem. J Oper Res Soc 31:1017–1023

    Article  MathSciNet  Google Scholar 

  11. Bertsimas D, Demir R (2002) An approximate dynamic programming approach to multidimensional knapsack problems. Manag Sci 48:550–565

    Article  Google Scholar 

  12. Balev S, Yanev N, Fréville A, Andonov R (2008) A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem European. J Oper Res 186:63–76

    Article  MathSciNet  Google Scholar 

  13. Barcelo J, Hallefjord Å, Fernandez E, Jörnsten K (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. OR Spectrum 12:79–88

    Article  MathSciNet  Google Scholar 

  14. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MW, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316–329

    Article  MathSciNet  Google Scholar 

  15. Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6:1–7

    Article  MathSciNet  Google Scholar 

  16. Hernández-Pérez H, Salazar-González J-J (2004) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl Math 145:126–139

    Article  MathSciNet  Google Scholar 

  17. Banitalebi A, Aziz MIA, Aziz ZA (2016) A self-adaptive binary differential evolution algorithm for large scale binary optimization problems. Inf Sci 367:487–511

    Article  Google Scholar 

  18. Guha S, Khuller S (1999) Greedy strikes back: improved facility location algorithms. J Algorithms 31:228–248

    Article  MathSciNet  Google Scholar 

  19. Jones PC, Lowe TJ, Muller G, Xu N, Ye Y, Zydiak JL (1995) Specially structured uncapacitated facility location problems. Oper Res 43:661–669

    Article  MathSciNet  Google Scholar 

  20. Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (MCOA) to solve graph coloring problem. Appl Soft Comput 33:48–64

    Article  Google Scholar 

  21. Luo J, Chen M-R (2014) Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Syst Appl 41:2535–2545

    Article  Google Scholar 

  22. Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. Soft Comput 22:8167–8175

    Article  Google Scholar 

  23. Kiran MS (2015) TSA: tree-seed algorithm for continuous optimization. Expert Syst Appl 42:6686–6698

    Article  Google Scholar 

  24. Uymaz SA, Tezel G, Yel E (2015) Artificial algae algorithm (AAA) for nonlinear global optimization. Appl Soft Comput 31:153–171

    Article  Google Scholar 

  25. Kaur S, Awasthi LK, Sangal A, Dhiman G (2020) Tunicate Swarm Algorithm: a new bio-inspired based metaheuristic paradigm for global optimization. Eng Appl Artif Intell 90:103541

    Article  Google Scholar 

  26. Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7:19–34

    Google Scholar 

  27. Li S, Chen H, Wang M, Heidari AA, Mirjalili S (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst 111:300–323

    Article  Google Scholar 

  28. Cuevas E, Cienfuegos M, Zaldívar D, Pérez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40:6374–6384

    Article  Google Scholar 

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

    Article  Google Scholar 

  30. Doğan B, Ölmez T (2015) A new metaheuristic for numerical function optimization: vortex Search algorithm. Inf Sci 293:125–145

    Article  Google Scholar 

  31. Mirjalili S (2015) The ant lion optimizer. Adv Eng Softw 83:80–98

    Article  Google Scholar 

  32. Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp Swarm Algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191

    Article  Google Scholar 

  33. Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, pp 65–74

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

    Article  Google Scholar 

  35. Gould N (2006) An introduction to algorithms for continuous optimization. Oxford University Computing Laboratory Notes

  36. Aslan M, Baykan NA (2016) A performance comparison of graph coloring algorithms. Int J Intell Syst Appl Eng 1–7

  37. Consoli P, Pavone M (2013) O-BEE-COL: optimal BEEs for COLoring graphs. In: Artificial Evolution: 11th international conference, evolution artificielle, EA 2013, Bordeaux, France, October 21–23, 2013. Revised Selected Papers 11, 2014. Springer, pp 243–255

  38. Zhou X, Gao DY, Yang C, Gui W (2016) Discrete state transition algorithm for unconstrained integer optimization problems. Neurocomputing 173:864–874

    Article  Google Scholar 

  39. Mahi M, Baykan ÖK, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484–490

    Article  Google Scholar 

  40. Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0–1 knapsack problem. Appl Soft Comput 38:817–830

    Article  Google Scholar 

  41. Feng Y, Wang G-G, Gao X-Z (2016) A novel hybrid cuckoo search algorithm with global harmony search for 0–1 knapsack problems. Int J Comput Intell Syst 9:1174–1190

    Article  Google Scholar 

  42. Xiang W-l, An M-q, Li Y-z, He R-c, Zhang J-f (2014) A novel discrete global-best harmony search algorithm for solving 0–1 knapsack problems. Discrete Dyn Nat Soc 2014:1–12

    Article  Google Scholar 

  43. Abdel-Basset M, El-Shahat D, Sangaiah AK (2019) A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem. Int J Mach Learn Cybern 10:495–514

    Article  Google Scholar 

  44. Zhang X, Wu C, Li J, Wang X, Yang Z, Lee J-M, Jung K-H (2016) Binary artificial algae algorithm for multidimensional knapsack problems. Appl Soft Comput 43:583–595

    Article  Google Scholar 

  45. Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0–1 knapsack problems. Expert Syst Appl 42:5337–5355

    Article  Google Scholar 

  46. Festa P, Pardalos PM, Resende MG, Ribeiro CC (2002) Randomized heuristics for the MAX-CUT problem. Optim Methods Softw 17:1033–1058

    Article  MathSciNet  Google Scholar 

  47. Kochenberger GA, Hao J-K, Lü Z, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heurist 19:565–571

    Article  Google Scholar 

  48. Martí R, Duarte A, Laguna M (2009) Advanced scatter search for the max-cut problem. INFORMS J Comput 21:26–38

    Article  MathSciNet  Google Scholar 

  49. Beşkirli M, Koç İ, Haklı H, Kodaz H (2018) A new optimization algorithm for solving wind turbine placement problem: binary artificial algae algorithm. Renew Energy 121:301–308

    Article  Google Scholar 

  50. Aslan M, Gunduz M, Kiran MS (2020) A Jaya-based approach to wind turbine placement problem. Energy Sources Part A: Recov Util Enviro Effects 1–20

  51. Beşkirli M, Koc I, Kodaz H (2019) Optimal placement of wind turbines using novel binary invasive weed optimization. Tehnički vjesnik 26:56–63

    Google Scholar 

  52. Chen Y, Xie W, Zou X (2015) A binary differential evolution algorithm learning from explored solutions. Neurocomputing 149:1038–1047

    Article  Google Scholar 

  53. Baş E, Ülker E (2020) A binary social spider algorithm for uncapacitated facility location problem. Expert Syst Appl 161:113618

    Article  Google Scholar 

  54. Hakli H, Ortacay Z (2019) An improved scatter search algorithm for the uncapacitated facility location problem. Comput Ind Eng 135:855–867

    Article  Google Scholar 

  55. Korkmaz S, Babalik A, Kiran MS (2017) An artificial algae algorithm for solving binary optimization problems. Int J Mach Learn Cybern 1–15

  56. Cinar AC, Kiran MS (2017) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng

  57. Kiran MS (2015) The continuous artificial bee colony algorithm for binary optimization. Appl Soft Comput 33:15–23. https://doi.org/10.1016/j.asoc.2015.04.007

    Article  Google Scholar 

  58. Hancer E, Xue B, Karaboga D, Zhang M (2015) A binary ABC algorithm based on advanced similarity scheme for feature selection. Appl Soft Comput 36:334–348. https://doi.org/10.1016/j.asoc.2015.07.023

    Article  Google Scholar 

  59. Kiran MS, Gunduz M (2013) XOR-based artificial bee colony algorithm for binary optimization. Turk J Electr Eng Comput Sci 21:2307–2328

    Article  Google Scholar 

  60. Kashan MH, Kashan AH, Nahavandi N (2013) A novel differential evolution algorithm for binary optimization. Comput Optim Appl 55:481–513

    Article  MathSciNet  Google Scholar 

  61. Sevkli M, Guner A (2006) A continuous particle swarm optimization algorithm for uncapacitated facility location problem. Ant Colony Optim Swarm Intell 316–323

  62. Sonuc E (2021) Binary crow search algorithm for the uncapacitated facility location problem. Neural Comput Appl 33:14669–14685

    Article  Google Scholar 

  63. Emine B, Ülker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185

    Article  Google Scholar 

  64. Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371–381

    Article  Google Scholar 

  65. Qiao L-Y, Peng X-Y, Peng Y (2006) BPSO-SVM wrapper for feature subset selection. Acta Electonica Sin 34:496

    Google Scholar 

  66. Gao S, Yu Y, Wang Y, Wang J, Cheng J, Zhou M (2019) Chaotic local search-based differential evolution algorithms for optimization. MIEEE Trans Syst Man Cybern Syst 51:3954–3967

    Article  Google Scholar 

  67. Hristakeva M, Shrestha D (2004) Solving the 0–1 knapsack problem with genetic algorithms. In: Midwest instruction and computing symposium

  68. Holland J (1975) Adaption in natural and artificial systems. Ann Arbor MI: The University of Michigan Press

  69. Crawford B, Soto R, Astorga G, García J, Castro C, Paredes F (2017) Putting continuous metaheuristics to work in binary search spaces. Complexity

  70. Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization. Swarm Evol Comput 9:1–14. https://doi.org/10.1016/j.swevo.2012.09.002

    Article  Google Scholar 

  71. Kashan MH, Nahavandi N, Kashan AH (2011) DisABC: a new articial bee colony algorithm for binary optimization. Appl Soft Comput

  72. Cornuéjols G, Nemhauser G, Wolsey L (1983) The uncapicitated facility location problem. Cornell University Operations Research and Industrial Engineering

  73. Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33:1–25

    Article  MathSciNet  Google Scholar 

  74. Klose A (1998) A branch and bound algorithm for an uncapacitated facility location problem with a side constraint. Int Trans Oper Res 5:155–168

    Article  Google Scholar 

  75. Goldengorin B, Ghosh D, Sierksma G (2003) Branch and peg algorithms for the simple plant location problem. Comput Oper Res 30:967–981

    Article  MathSciNet  Google Scholar 

  76. Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem. Ann Oper Res 86:91–103

    Article  MathSciNet  Google Scholar 

  77. Aydin ME, Fogarty TC (2004) A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J Heuristics 10:269–292

    Article  Google Scholar 

  78. Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29:761–779

    Article  MathSciNet  Google Scholar 

  79. Topcuoglu H, Corut F, Ermis M, Yilmaz G (2005) Solving the uncapacitated hub location problem using genetic algorithms. Comput Oper Res 32:967–984

    Article  Google Scholar 

  80. Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man, and cybernetics, computational cybernetics and simulation. IEEE, pp 4104–4108

  81. Babaoğlu İ (2016) Utilization of bat algorithm for solving uncapacitated facility location problem. In: Intelligent and evolutionary systems. Springer, pp 199–208

  82. Karakoyun M, Ozkis A (2022) A binary tree seed algorithm with selection-based local search mechanism for huge-sized optimization problems. Appl Soft Comput 129:109590

    Article  Google Scholar 

  83. Azad M, Kalam A, Rocha AMA, Fernandes EMdG (2013) A simplified binary artificial fish swarm algorithm for uncapacitated facility location problems. In: World congress on engineering 2013, WCE 2013, 2013. Newswood Limited Publisher, pp 31–36

  84. Hakli H (2020) BinEHO: a new binary variant based on elephant herding optimization algorithm. Neural Comput Appl 32:16971–16991

  85. Gharehchopogh FS, Maleki I, Dizaji ZA (2021) Chaotic vortex search algorithm: metaheuristic algorithm for feature selection. Evol Intell 1–32

  86. Doğan B, Ölmez T (2015) Vortex search algorithm for the analog active filter component selection problem. AEU Int J Electron Commun 69:1243–1253

    Article  Google Scholar 

  87. Özkış A, Babalık A (2017) A novel metaheuristic for multi-objective optimization problems: the multi-objective vortex search algorithm. Inf Sci 402:124–148

    Article  Google Scholar 

  88. Montoya O, Garrido V, Grisales-Noreña L (2021) Optimal power dispatch of dispersed sources in direct-current networks with nonlinear loads. In: Journal of Physics: Conference Series, 2021. vol 1. IOP Publishing, p 012009

  89. Ramirez-Brewer D, Montoya OD, Useche Vivero J, García-Zapateiro L (2021) Characterization and modeling of the viscoelastic behavior of hydrocolloid-based films using classical and fractional rheological models. Fluids 6:418

    Article  Google Scholar 

  90. Fathy A, Abd Elaziz M, Alharbi AG (2020) A novel approach based on hybrid vortex search algorithm and differential evolution for identifying the optimal parameters of PEM fuel cell. Renew Energy 146:1833–1845

    Article  Google Scholar 

  91. Wang C, Liu P, Zhang T, Sun J (2018) The adaptive vortex search algorithm of optimal path planning for forest fire rescue UAV. In: 2018 IEEE 3rd advanced information technology, electronic and automation control conference (IAEAC). IEEE, pp 400–403

  92. Yadav S, Yadav R, Kumar A, Kumar M (2020) Design of optimal two-dimensional FIR filters with quadrantally symmetric properties using vortex search algorithm. J Circuits Syst Comput 29:2050155

    Article  Google Scholar 

  93. Zou D, Gao L, Li S, Wu J (2011) Solving 0–1 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11:1556–1564

    Article  Google Scholar 

  94. Beasley JE (1990) Or-library—distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072. https://doi.org/10.2307/2582903

    Article  Google Scholar 

  95. Monabbati E, Kakhki HT (2015) On a class of subadditive duals for the uncapacitated facility location problem. Appl Math Comput 251:118–131. https://doi.org/10.1016/j.amc.2014.10.072

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Engineering, Şırnak University, Şırnak, Turkey

    Murat Aslan

  2. Department of Mathematics and Computer Science, University of Catania, Catania, Italy

    Mario Pavone

Authors
  1. Murat Aslan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Pavone
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Murat Aslan.

Ethics declarations

Conflict of interest

There are no conflicts of interest declared by the authors.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aslan, M., Pavone, M. MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem. Neural Comput & Applic 36, 2573–2595 (2024). https://doi.org/10.1007/s00521-023-09190-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-023-09190-9

Keywords

Search

Navigation