Skip to main content
SpringerLink
Log in

A new binary coati optimization algorithm for binary optimization problems

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

Abstract

The coati optimization algorithm (COA) is a recently proposed heuristic algorithm. The COA algorithm, which solved the continuous optimization problems in its original paper, has been converted to a binary optimization solution by using transfer functions in this paper. Thus, binary COA (BinCOA) is proposed for the first time in this study. In this study, twenty transfer functions are used (four S-shaped, four V-shaped, four Z-shaped, four U-shaped, and four taper-shaped transfer functions). Thus, twenty variations of BinCOA are obtained, and the effect of each transfer function on BinCOA is examined in detail. The knapsack problem (KP) and uncapacitated facility location problem (UFLP), which are popular binary optimization problems in the literature, are chosen to test the success of BinCOA. In this study, small-, middle-, and large-scale KP and UFLP datasets are selected. Real-world problems are not always low-dimensional. Although a binary algorithm sometimes shows superior success in low dimensions, it cannot maintain the same success in large dimensions. Therefore, the success of BinCOA has been tested and demonstrated not only in low-dimensional binary optimization problems, but also in large-scale optimization problems. The most successful transfer function is T3 for KPs and T20 for UFLPs. This showed that S-shaped and taper-shaped transfer functions obtained better results than others. After determining the most successful transfer function for each problem, the enhanced BinCOA (EBinCOA) is proposed to increase the success of BinCOA. Two methods are used in the development of BinCOA. These are the repair method and the XOR gate method. The repair method repairs unsuitable solutions in the population in a way that competes with other solutions. The XOR gate is one of the most preferred methods in the literature when producing binary solutions and supports diversity. In tests, EBinCOA has achieved better results than BinCOA. The added methods have proven successful on BinCOA. In recent years, the newly proposed evolutionary mating algorithm, fire hawk optimizer, honey badger algorithm, mountain gazelle optimizer, and aquila optimizer have been converted to binary using the most successful transfer function selected for KP and UFLP. BinCOA and EBinCOA have been compared with these binary heuristic algorithms and literature. In this way, their success has been demonstrated. According to the results, it has been seen that EBinCOA is a successful and preferable algorithm for binary optimization problems.

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

Similar content being viewed by others

Data availability

Data will be made available on request.

References

  1. Abdel-Basset M, El-Shahat D, El-Henawy I (2019) Solving 0–1 knapsack problem by binary flower pollination algorithm. Neural Comput Appl 31(9):5477–5495

    Google Scholar 

  2. Abdel-Basset M, Mohamed R, Chakrabortty RK, Ryan M, Mirjalili S (2021) New binary marine predators optimization algorithms for 0–1 knapsack problems. Comput Ind Eng 151:106949

    Google Scholar 

  3. Abdel-Basset M, Mohamed R, Mirjalili S (2021) A binary equilibrium optimization algorithm for 0–1 knapsack problems. Comput Ind Eng 151:106946

    Google Scholar 

  4. Abdel-Basset M, Mohamed R, Abouhawwash M, Alshamrani AM, Mohamed AW, Sallam K (2023) Binary light spectrum optimizer for knapsack problems: an improved model. Alex Eng J 67:609–632

    Google Scholar 

  5. Abdollahzadeh B, Gharehchopogh FS, Khodadadi N, Mirjalili S (2022) Mountain gazelle optimizer: a new nature-inspired metaheuristic algorithm for global optimization problems. Adv Eng Softw 174:103282

    Google Scholar 

  6. Abdollahzadeh B, Barshandeh S, Javadi H et al (2022) An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem. Eng Comput 38:3423–3444

    Google Scholar 

  7. Abualigah L, Yousri D, Elaziz MA, Ewees AA, Al-qaness MA, Gandomi AH (2021) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng. https://doi.org/10.1016/j.cie.2021.107250

    Article  Google Scholar 

  8. Abualigah L, Diabat A (2021) A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Cluster Comput 24(1):205–223

    Google Scholar 

  9. Agrawal P, Ganesh T, Mohamed AW (2021) Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex Intell Syst 8:43–63

    Google Scholar 

  10. Ahmed S, Ghosh KK, Mirjalili S, Sarkar R (2021) AIEOU: Automata-based improved equilibrium optimizer with U-shaped transfer function for feature selection. Knowl Based Syst 228:107283

    Google Scholar 

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

    Google Scholar 

  12. Azad M, Rocha AMA, Fernandes EM (2013) A simplified binary artificial fish swarm algorithm for uncapacitated facility location problems. Lecture Notes Eng Comput Sci 2204(1):31–36

    Google Scholar 

  13. Azizi M, Talatahari S, Gandomi AH (2022) Fire Hawk optimizer: a novel metaheuristic algorithm. Artif Intell Rev. https://doi.org/10.1007/s10462-022-10173-w

    Article  Google Scholar 

  14. Azizi M, Talatahari S, Gandomi AH (2023) Fire Hawk optimizer: a novel metaheuristic algorithm. Artif Intell Rev 56:287–363. https://doi.org/10.1007/s10462-022-10173-w

    Article  Google Scholar 

  15. Baş E, Ulker E (2020) An efficient binary social spider algorithm for feature selection problem. Expert Syst Appl 146:113185

    Google Scholar 

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

    Google Scholar 

  17. Baş E (2023) Binary aquila optimizer for 0–1 knapsack problems. Eng Appl Artif Intell 118:105592

    Google Scholar 

  18. Beasley JE (1990) OR-library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069–1072

    Google Scholar 

  19. Billionnet A, Soutif E (2004) An exact method based on Lagrangian decomposition for the 0–1 quadratic knapsack problem. Eur J Oper Res 157(3):565–575

    MathSciNet  Google Scholar 

  20. Bettinelli A, Cacchiani V, Malaguti E et al (2017) A branch-andbound algorithm for the knapsack problem with conflict graph. Informs J Comput 29(3):457–473

    MathSciNet  Google Scholar 

  21. Chen Y, Yan J, Feng J, Sareh P (2021) Particle swarm optimization-based metaheuristic design generation of non-trivial flat-foldable origami tessellations with degree-4 vertices. J Mech Des 143(1):011703

    Google Scholar 

  22. Chen Y, Lu C, Yan J, Feng J, Sareh P (2022) Intelligent computational design of scalene-faceted flat-foldable tessellations. J Comput Des Eng 9(5):1765–1774

    Google Scholar 

  23. Cinar AC, Kiran MS (2018) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng 115:631–646

    Google Scholar 

  24. Cura T (2010) A parallel local search approach to solving the uncapacitated warehouse location problem. Comput Ind Eng 59(4):1000–1009

    Google Scholar 

  25. Dang BT, Truong TK (2022) Binary salp swarm algorithm for discounted 0–1 knapsack problem. PLoS ONE 17(4):e0266537. https://doi.org/10.1371/journal.pone.0266537

    Article  Google Scholar 

  26. Daskin M, Snyder L, Berger R (2003) Facility location in supply chain design. In: Logistics systems: design and optimization, pp 39–65

  27. Dehghani M, Montazeri Z, Trojovská E, Trojovský P (2023) Coati optimization algorithm: a new bio-inspired metaheuristic algorithm for solving optimization problems. Knowl Based Syst 259:110011

    Google Scholar 

  28. Ervural B, Hakli H (2023) A binary reptile search algorithm based on transfer functions with a new stochastic repair method for 0–1 knapsack problems. Comput Ind Eng 178:109080

    Google Scholar 

  29. Ezugwu AE et al (2019) A comparative study of meta-heuristic optimization algorithms for 0–1 knapsack problem: some initial results. IEEE Access 7:43979–44001

    Google Scholar 

  30. Faris H, Mafarja MM, Heidari AA, Aljarah I, Al-Zoubi AM, Mirjalili S, Fujita H (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl Based Syst 154:43–67

    Google Scholar 

  31. García S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15:617–644

    Google Scholar 

  32. Geem ZW (2005). Harmony search in water pump switching problem. In: International conference on natural computation. Springer, pp 751–760

  33. Guo SS, Wang J, Guo M (2020) Z-shaped transfer functions for binary particle swarm optimization algorithm. Comput Intell Neurosci. https://doi.org/10.1155/2020/6502807

    Article  Google Scholar 

  34. Harifi SA (2022) Binary ancient-inspired giza pyramids construction metaheuristic algorithm for solving 0–1 knapsack problem. Soft Comput 26:12761–12778. https://doi.org/10.1007/s00500-022-07285-4

    Article  Google Scholar 

  35. Hashim FA, Houssein EH, Hussain K, Mabrouk MS, Al-Atabany W (2022) Honey Badger algorithm: new metaheuristic algorithm for solving optimization problems. Math Comput Simul 192:84–110. https://doi.org/10.1016/j.matcom.2021.08.013. ISSN 0378-4754

    Article  MathSciNet  Google Scholar 

  36. He Y, Zhang F, Mirjalili S, Zhang T (2022) Novel binary differential evolution algorithm based on Taper-shaped transfer functions for binary optimization problems. Swarm Evol Comput 69:101022

    Google Scholar 

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

    Google Scholar 

  38. Karakoyun M, Gülcü Ş, Kodaz H (2021) D-MOSG: Discrete multi-objective shuffled gray wolf optimizer for multi-level image thresholding. Eng Sci Technol Int J 24(6):1455–1466

    Google Scholar 

  39. 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

    Google Scholar 

  40. Kaveh A, Bakhshpoori T (2019) Metaheuristics: outlines, MATLAB codes and examples. Springer, New York. https://doi.org/10.1007/978-3-030-04067-3

    Book  Google Scholar 

  41. Kaya E (2022) BinGSO: galactic swarm optimization powered by binary artificial algae algorithm for solving uncapacitated facility location problems. Neural Comput Appl 34:11063–11082. https://doi.org/10.1007/s00521-022-07058-y

    Article  Google Scholar 

  42. Kiran MS (2021) A binary artificial bee colony algorithm and its performance assessment. Expert Syst Appl 175:114817

    Google Scholar 

  43. Klamroth K, Wiecek MM (2000) Dynamic programming approaches to the multiple criteria knapsack problem. Nav Res Logist 47(1):57–76

    MathSciNet  Google Scholar 

  44. Korkmaz S, Kiran MS (2018) An artificial algae algorithm with stigmergic behavior for binary optimization. Appl Soft Comput 64:627–640

    Google Scholar 

  45. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9(4):643–666

    Google Scholar 

  46. Li X, Liu T (2010) On exponential time lower bound of knapsack under backtracking. Theor Comput Sci 411(16–18):1883–1888

    MathSciNet  Google Scholar 

  47. Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525–530

    Google Scholar 

  48. Rao, Z., Tung, P. Y., Xie, R., Wei, Y., Zhang, H., Ferrari, A., ... & Raabe, D. (2022). Machine learning–enabled high-entropy alloy discovery. Science, 378(6615), 78–85.

  49. Saha S, Kole A, Dey K (2011) A modified continuous particle swarm optimization algorithm for uncapacitated facility location problem. In: Das VV, Thomas G, Lumban Gaol F (eds) Information technology and mobile communication. AIM 2011. Communications in computer and information science, vol 147. Springer, Berlin

    Google Scholar 

  50. Sedlar D, Lozina Z, Tomac I (2022) Discrete optimization of truss structures using variable neighborhood search. Iran J Sci Technol Trans Civ Eng 46:1249–1264. https://doi.org/10.1007/s40996-021-00704-w

    Article  Google Scholar 

  51. Shu Z, Ye Z, Zong X et al (2022) A modified hybrid rice optimization algorithm for solving 0–1 knapsack problem. Appl Intell 52:5751–5769. https://doi.org/10.1007/s10489-021-02717-4

    Article  Google Scholar 

  52. Skiena SS (1999) Who is interested in algorithms and why? Lessons from the Stony Brook Algorithm Repository. ACM SIGACT News 30(3):65–74

    Google Scholar 

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

    Google Scholar 

  54. Sonuc E, Ozcan E (2023) An adaptive parallel evolutionary algorithm for solving the uncapacitated facility location problem. Expert Syst Appl 224:119956

    Google Scholar 

  55. Sulaiman MH, Mustaffa Z, Saari MM et al (2022) Evolutionary mating algorithm. Neural Comput Appl. https://doi.org/10.1007/s00521-022-07761-w

    Article  Google Scholar 

  56. Tariq I et al (2020) MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems. Neural Comput Appl 32:3101–3115. https://doi.org/10.1007/s00521-018-3808-3

    Article  Google Scholar 

  57. Yang X-S (2011) Metaheuristic optimization: algorithm analysis and open problems. In: International symposium on experimental algorithms. Springer, pp 21–32

  58. Yildizdan G, Baş E (2023) A novel binary artificial jellyfish search algorithm for solving 0–1 knapsack problems. Neural Process Lett. https://doi.org/10.1007/s11063-023-11171-x

    Article  Google Scholar 

  59. Xi M, Song Q, Xu M et al (2022) Binary African vultures optimization algorithm for various optimization problems. Int J Mach Learn Cyber 15:15. https://doi.org/10.1007/s13042-022-01703-7

    Article  Google Scholar 

  60. Zhang F, He Y, Ouyang H, Li W (2023) A fast and efficient discrete evolutionary algorithm for the uncapacitated facility location problem. Expert Syst Appl 213(1):118978

    Google Scholar 

  61. Zhou Y, Zhao M, Fan M, Wang Y, Wang J (2021) An efficient local search for large-scale set-union knapsack problem. Data Technol Appl 55(2):233–250

    Google Scholar 

Download references

Funding

This study was not funded by any institution.

Author information

Authors and Affiliations

  1. Kulu Vocational School, Selcuk University, 42770, Konya, Turkey

    Gülnur Yildizdan

  2. Department of Software Engineering, Faculty of Engineering and Nature Sciences, Konya Technical University, 42075, Konya, Turkey

    Emine Bas

Authors
  1. Gülnur Yildizdan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emine Bas
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

GY involved in conceptualization, investigation, methodology, writing—review, software, original draft and editing. EB involved in conceptualization, investigation, methodology, software, writing—review, original draft and editing.

Corresponding author

Correspondence to Gülnur Yildizdan.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Additional information

Publisher’s Note

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

Appendix

Appendix

See Tables 38 and 39.

Table 38 Gap results of the BinCOA on middle-scaled KPs (Transfer function = T1, Maximum iteration = 5000, Run = 20)
Full size table
Table 39 Gap results of the BinCOA on low-scaled UFLPs (Transfer function = T1. Maximum iteration = 2000. Run = 20)
Full size table

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

Yildizdan, G., Bas, E. A new binary coati optimization algorithm for binary optimization problems. Neural Comput & Applic 36, 2797–2834 (2024). https://doi.org/10.1007/s00521-023-09200-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-023-09200-w

Keywords

Search

Navigation