Duck swarm algorithm: theory, numerical optimization, and applications Article Swipe
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2112.13508
A swarm intelligence-based optimization algorithm, named Duck Swarm Algorithm (DSA), is proposed in this study, which is inspired by the searching for food sources and foraging behaviors of the duck swarm. Two rules are modeled from the finding food and foraging of the duck, which corresponds to the exploration and exploitation phases of the proposed DSA, respectively. The performance of the DSA is verified by using multiple CEC benchmark functions, where its statistical (best, mean, standard deviation, and average running-time) results are compared with seven well-known algorithms like Particle swarm optimization (PSO), Firefly algorithm (FA), Chicken swarm optimization (CSO), Grey wolf optimizer (GWO), Sine cosine algorithm (SCA), and Marine-predators algorithm (MPA), and Archimedes optimization algorithm (AOA). Moreover, the Wilcoxon rank-sum test, Friedman test, and convergence curves of the comparison results are utilized to prove the superiority of the DSA against other algorithms. The results demonstrate that DSA is a high-performance optimization method in terms of convergence speed and exploration-exploitation balance for solving the numerical optimization problems. Also, DSA is applied for the optimal design of six engineering constrained optimization problems and the node optimization deployment task of the Wireless Sensor Network (WSN). Overall, the comparison results revealed that the DSA is a promising and very competitive algorithm for solving different optimization problems.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2112.13508
- https://arxiv.org/pdf/2112.13508
- OA Status
- green
- Cited By
- 6
- References
- 68
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4226307066
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4226307066Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2112.13508Digital Object Identifier
- Title
-
Duck swarm algorithm: theory, numerical optimization, and applicationsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-12-27Full publication date if available
- Authors
-
Mengjian Zhang, Guihua Wen, Jing YangList of authors in order
- Landing page
-
https://arxiv.org/abs/2112.13508Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2112.13508Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2112.13508Direct OA link when available
- Concepts
-
Firefly algorithm, Algorithm, Particle swarm optimization, Swarm behaviour, Swarm intelligence, Benchmark (surveying), Multi-swarm optimization, Computer science, Convergence (economics), Mathematical optimization, Optimization problem, Mathematics, Economics, Geography, Economic growth, GeodesyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
6Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1, 2023: 5Per-year citation counts (last 5 years)
- References (count)
-
68Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4226307066 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2112.13508 |
| ids.doi | https://doi.org/10.48550/arxiv.2112.13508 |
| ids.openalex | https://openalex.org/W4226307066 |
| fwci | 0.70551788 |
| type | preprint |
| title | Duck swarm algorithm: theory, numerical optimization, and applications |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10100 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9995999932289124 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Metaheuristic Optimization Algorithms Research |
| topics[1].id | https://openalex.org/T11975 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9872000217437744 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Evolutionary Algorithms and Applications |
| topics[2].id | https://openalex.org/T12101 |
| topics[2].field.id | https://openalex.org/fields/18 |
| topics[2].field.display_name | Decision Sciences |
| topics[2].score | 0.9151999950408936 |
| topics[2].domain.id | https://openalex.org/domains/2 |
| topics[2].domain.display_name | Social Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1803 |
| topics[2].subfield.display_name | Management Science and Operations Research |
| topics[2].display_name | Advanced Bandit Algorithms Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C154982244 |
| concepts[0].level | 3 |
| concepts[0].score | 0.7383856773376465 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5451844 |
| concepts[0].display_name | Firefly algorithm |
| concepts[1].id | https://openalex.org/C11413529 |
| concepts[1].level | 1 |
| concepts[1].score | 0.7045130133628845 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[1].display_name | Algorithm |
| concepts[2].id | https://openalex.org/C85617194 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6348364949226379 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2072794 |
| concepts[2].display_name | Particle swarm optimization |
| concepts[3].id | https://openalex.org/C181335050 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6226143836975098 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q14915018 |
| concepts[3].display_name | Swarm behaviour |
| concepts[4].id | https://openalex.org/C119487961 |
| concepts[4].level | 3 |
| concepts[4].score | 0.5893018841743469 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q863960 |
| concepts[4].display_name | Swarm intelligence |
| concepts[5].id | https://openalex.org/C185798385 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5224884152412415 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1161707 |
| concepts[5].display_name | Benchmark (surveying) |
| concepts[6].id | https://openalex.org/C122357587 |
| concepts[6].level | 3 |
| concepts[6].score | 0.5019702911376953 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q6934508 |
| concepts[6].display_name | Multi-swarm optimization |
| concepts[7].id | https://openalex.org/C41008148 |
| concepts[7].level | 0 |
| concepts[7].score | 0.499006986618042 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[7].display_name | Computer science |
| concepts[8].id | https://openalex.org/C2777303404 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4774254262447357 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[8].display_name | Convergence (economics) |
| concepts[9].id | https://openalex.org/C126255220 |
| concepts[9].level | 1 |
| concepts[9].score | 0.4592115879058838 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[9].display_name | Mathematical optimization |
| concepts[10].id | https://openalex.org/C137836250 |
| concepts[10].level | 2 |
| concepts[10].score | 0.44304993748664856 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[10].display_name | Optimization problem |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.3152375817298889 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C162324750 |
| concepts[12].level | 0 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[12].display_name | Economics |
| concepts[13].id | https://openalex.org/C205649164 |
| concepts[13].level | 0 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1071 |
| concepts[13].display_name | Geography |
| concepts[14].id | https://openalex.org/C50522688 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q189833 |
| concepts[14].display_name | Economic growth |
| concepts[15].id | https://openalex.org/C13280743 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q131089 |
| concepts[15].display_name | Geodesy |
| keywords[0].id | https://openalex.org/keywords/firefly-algorithm |
| keywords[0].score | 0.7383856773376465 |
| keywords[0].display_name | Firefly algorithm |
| keywords[1].id | https://openalex.org/keywords/algorithm |
| keywords[1].score | 0.7045130133628845 |
| keywords[1].display_name | Algorithm |
| keywords[2].id | https://openalex.org/keywords/particle-swarm-optimization |
| keywords[2].score | 0.6348364949226379 |
| keywords[2].display_name | Particle swarm optimization |
| keywords[3].id | https://openalex.org/keywords/swarm-behaviour |
| keywords[3].score | 0.6226143836975098 |
| keywords[3].display_name | Swarm behaviour |
| keywords[4].id | https://openalex.org/keywords/swarm-intelligence |
| keywords[4].score | 0.5893018841743469 |
| keywords[4].display_name | Swarm intelligence |
| keywords[5].id | https://openalex.org/keywords/benchmark |
| keywords[5].score | 0.5224884152412415 |
| keywords[5].display_name | Benchmark (surveying) |
| keywords[6].id | https://openalex.org/keywords/multi-swarm-optimization |
| keywords[6].score | 0.5019702911376953 |
| keywords[6].display_name | Multi-swarm optimization |
| keywords[7].id | https://openalex.org/keywords/computer-science |
| keywords[7].score | 0.499006986618042 |
| keywords[7].display_name | Computer science |
| keywords[8].id | https://openalex.org/keywords/convergence |
| keywords[8].score | 0.4774254262447357 |
| keywords[8].display_name | Convergence (economics) |
| keywords[9].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[9].score | 0.4592115879058838 |
| keywords[9].display_name | Mathematical optimization |
| keywords[10].id | https://openalex.org/keywords/optimization-problem |
| keywords[10].score | 0.44304993748664856 |
| keywords[10].display_name | Optimization problem |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.3152375817298889 |
| keywords[11].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2112.13508 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2112.13508 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2112.13508 |
| locations[1].id | doi:10.48550/arxiv.2112.13508 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article-journal |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2112.13508 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5071996087 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-8546-9972 |
| authorships[0].author.display_name | Mengjian Zhang |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I90610280 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China |
| authorships[0].institutions[0].id | https://openalex.org/I90610280 |
| authorships[0].institutions[0].ror | https://ror.org/0530pts50 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I90610280 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | South China University of Technology |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Mengjian Zhang |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China |
| authorships[1].author.id | https://openalex.org/A5101802990 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-9709-1126 |
| authorships[1].author.display_name | Guihua Wen |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I90610280 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China |
| authorships[1].institutions[0].id | https://openalex.org/I90610280 |
| authorships[1].institutions[0].ror | https://ror.org/0530pts50 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I90610280 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | South China University of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Guihua Wen |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China |
| authorships[2].author.id | https://openalex.org/A5100704230 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-6407-1276 |
| authorships[2].author.display_name | Jing Yang |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Jing Yang |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2112.13508 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2022-05-05T00:00:00 |
| display_name | Duck swarm algorithm: theory, numerical optimization, and applications |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10100 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9995999932289124 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Metaheuristic Optimization Algorithms Research |
| related_works | https://openalex.org/W4210824982, https://openalex.org/W2183555234, https://openalex.org/W3183905066, https://openalex.org/W4308079021, https://openalex.org/W2042389409, https://openalex.org/W4250494040, https://openalex.org/W2006324351, https://openalex.org/W2965421953, https://openalex.org/W4309047791, https://openalex.org/W2070977815 |
| cited_by_count | 6 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 5 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2112.13508 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2112.13508 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2112.13508 |
| primary_location.id | pmh:oai:arXiv.org:2112.13508 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2112.13508 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2112.13508 |
| publication_date | 2021-12-27 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W4298445208, https://openalex.org/W3011104345, https://openalex.org/W3163903840, https://openalex.org/W4386997170, https://openalex.org/W2096673585, https://openalex.org/W4308222718, https://openalex.org/W4297961863, https://openalex.org/W2096166399, https://openalex.org/W2985845430, https://openalex.org/W2072955302, https://openalex.org/W2137248938, https://openalex.org/W4381167899, https://openalex.org/W4281572388, https://openalex.org/W1999284878, https://openalex.org/W2232317135, https://openalex.org/W4297818472, https://openalex.org/W2998553334, https://openalex.org/W2306115793, https://openalex.org/W4387425779, https://openalex.org/W95170009, https://openalex.org/W3185076117, https://openalex.org/W4384819851, https://openalex.org/W2135879356, https://openalex.org/W3119051141, https://openalex.org/W1997600725, https://openalex.org/W2014162517, https://openalex.org/W3012087746, https://openalex.org/W2125452123, https://openalex.org/W2810255841, https://openalex.org/W4221064141, https://openalex.org/W2919979744, https://openalex.org/W2168081761, https://openalex.org/W237869302, https://openalex.org/W1726780665, https://openalex.org/W4361249171, https://openalex.org/W3196661916, https://openalex.org/W2134092727, https://openalex.org/W4381894841, https://openalex.org/W2951464652, https://openalex.org/W4360986215, https://openalex.org/W883434633, https://openalex.org/W2002713790, https://openalex.org/W2151554678, https://openalex.org/W2738900493, https://openalex.org/W3038102268, https://openalex.org/W2171211995, https://openalex.org/W1993885071, https://openalex.org/W1596914020, https://openalex.org/W3015290284, https://openalex.org/W4307911001, https://openalex.org/W2027393638, https://openalex.org/W4310188030, https://openalex.org/W4386223939, https://openalex.org/W3090396243, https://openalex.org/W2034988449, https://openalex.org/W4309185062, https://openalex.org/W4245163987, https://openalex.org/W4301346705, https://openalex.org/W2290883490, https://openalex.org/W2003890325, https://openalex.org/W2165299997, https://openalex.org/W2790662215, https://openalex.org/W2033011996, https://openalex.org/W2962182762, https://openalex.org/W4313402926, https://openalex.org/W3096595403, https://openalex.org/W2024060531, https://openalex.org/W4252684946 |
| referenced_works_count | 68 |
| abstract_inverted_index.A | 0 |
| abstract_inverted_index.a | 148, 201 |
| abstract_inverted_index.by | 18, 64 |
| abstract_inverted_index.in | 12, 152 |
| abstract_inverted_index.is | 10, 16, 62, 147, 168, 200 |
| abstract_inverted_index.of | 27, 41, 52, 59, 126, 136, 154, 174, 186 |
| abstract_inverted_index.to | 46, 132 |
| abstract_inverted_index.CEC | 67 |
| abstract_inverted_index.DSA | 61, 138, 146, 167, 199 |
| abstract_inverted_index.The | 57, 142 |
| abstract_inverted_index.Two | 31 |
| abstract_inverted_index.and | 24, 39, 49, 77, 107, 111, 123, 157, 180, 203 |
| abstract_inverted_index.are | 33, 81, 130 |
| abstract_inverted_index.for | 21, 160, 170, 207 |
| abstract_inverted_index.its | 71 |
| abstract_inverted_index.six | 175 |
| abstract_inverted_index.the | 19, 28, 36, 42, 47, 53, 60, 117, 127, 134, 137, 162, 171, 181, 187, 193, 198 |
| abstract_inverted_index.DSA, | 55 |
| abstract_inverted_index.Duck | 6 |
| abstract_inverted_index.Grey | 99 |
| abstract_inverted_index.Sine | 103 |
| abstract_inverted_index.duck | 29 |
| abstract_inverted_index.food | 22, 38 |
| abstract_inverted_index.from | 35 |
| abstract_inverted_index.like | 87 |
| abstract_inverted_index.node | 182 |
| abstract_inverted_index.task | 185 |
| abstract_inverted_index.that | 145, 197 |
| abstract_inverted_index.this | 13 |
| abstract_inverted_index.very | 204 |
| abstract_inverted_index.with | 83 |
| abstract_inverted_index.wolf | 100 |
| abstract_inverted_index.(FA), | 94 |
| abstract_inverted_index.Also, | 166 |
| abstract_inverted_index.Swarm | 7 |
| abstract_inverted_index.duck, | 43 |
| abstract_inverted_index.mean, | 74 |
| abstract_inverted_index.named | 5 |
| abstract_inverted_index.other | 140 |
| abstract_inverted_index.prove | 133 |
| abstract_inverted_index.rules | 32 |
| abstract_inverted_index.seven | 84 |
| abstract_inverted_index.speed | 156 |
| abstract_inverted_index.swarm | 1, 89, 96 |
| abstract_inverted_index.terms | 153 |
| abstract_inverted_index.test, | 120, 122 |
| abstract_inverted_index.using | 65 |
| abstract_inverted_index.where | 70 |
| abstract_inverted_index.which | 15, 44 |
| abstract_inverted_index.(AOA). | 115 |
| abstract_inverted_index.(CSO), | 98 |
| abstract_inverted_index.(DSA), | 9 |
| abstract_inverted_index.(GWO), | 102 |
| abstract_inverted_index.(MPA), | 110 |
| abstract_inverted_index.(PSO), | 91 |
| abstract_inverted_index.(SCA), | 106 |
| abstract_inverted_index.(WSN). | 191 |
| abstract_inverted_index.(best, | 73 |
| abstract_inverted_index.Sensor | 189 |
| abstract_inverted_index.cosine | 104 |
| abstract_inverted_index.curves | 125 |
| abstract_inverted_index.design | 173 |
| abstract_inverted_index.method | 151 |
| abstract_inverted_index.phases | 51 |
| abstract_inverted_index.study, | 14 |
| abstract_inverted_index.swarm. | 30 |
| abstract_inverted_index.Chicken | 95 |
| abstract_inverted_index.Firefly | 92 |
| abstract_inverted_index.Network | 190 |
| abstract_inverted_index.against | 139 |
| abstract_inverted_index.applied | 169 |
| abstract_inverted_index.average | 78 |
| abstract_inverted_index.balance | 159 |
| abstract_inverted_index.finding | 37 |
| abstract_inverted_index.modeled | 34 |
| abstract_inverted_index.optimal | 172 |
| abstract_inverted_index.results | 80, 129, 143, 195 |
| abstract_inverted_index.solving | 161, 208 |
| abstract_inverted_index.sources | 23 |
| abstract_inverted_index.Friedman | 121 |
| abstract_inverted_index.Overall, | 192 |
| abstract_inverted_index.Particle | 88 |
| abstract_inverted_index.Wilcoxon | 118 |
| abstract_inverted_index.Wireless | 188 |
| abstract_inverted_index.compared | 82 |
| abstract_inverted_index.foraging | 25, 40 |
| abstract_inverted_index.inspired | 17 |
| abstract_inverted_index.multiple | 66 |
| abstract_inverted_index.problems | 179 |
| abstract_inverted_index.proposed | 11, 54 |
| abstract_inverted_index.rank-sum | 119 |
| abstract_inverted_index.revealed | 196 |
| abstract_inverted_index.standard | 75 |
| abstract_inverted_index.utilized | 131 |
| abstract_inverted_index.verified | 63 |
| abstract_inverted_index.Algorithm | 8 |
| abstract_inverted_index.Moreover, | 116 |
| abstract_inverted_index.algorithm | 93, 105, 109, 114, 206 |
| abstract_inverted_index.behaviors | 26 |
| abstract_inverted_index.benchmark | 68 |
| abstract_inverted_index.different | 209 |
| abstract_inverted_index.numerical | 163 |
| abstract_inverted_index.optimizer | 101 |
| abstract_inverted_index.problems. | 165, 211 |
| abstract_inverted_index.promising | 202 |
| abstract_inverted_index.searching | 20 |
| abstract_inverted_index.Archimedes | 112 |
| abstract_inverted_index.algorithm, | 4 |
| abstract_inverted_index.algorithms | 86 |
| abstract_inverted_index.comparison | 128, 194 |
| abstract_inverted_index.deployment | 184 |
| abstract_inverted_index.deviation, | 76 |
| abstract_inverted_index.functions, | 69 |
| abstract_inverted_index.well-known | 85 |
| abstract_inverted_index.algorithms. | 141 |
| abstract_inverted_index.competitive | 205 |
| abstract_inverted_index.constrained | 177 |
| abstract_inverted_index.convergence | 124, 155 |
| abstract_inverted_index.corresponds | 45 |
| abstract_inverted_index.demonstrate | 144 |
| abstract_inverted_index.engineering | 176 |
| abstract_inverted_index.exploration | 48 |
| abstract_inverted_index.performance | 58 |
| abstract_inverted_index.statistical | 72 |
| abstract_inverted_index.superiority | 135 |
| abstract_inverted_index.exploitation | 50 |
| abstract_inverted_index.optimization | 3, 90, 97, 113, 150, 164, 178, 183, 210 |
| abstract_inverted_index.respectively. | 56 |
| abstract_inverted_index.running-time) | 79 |
| abstract_inverted_index.Marine-predators | 108 |
| abstract_inverted_index.high-performance | 149 |
| abstract_inverted_index.intelligence-based | 2 |
| abstract_inverted_index.exploration-exploitation | 158 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 91 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/14 |
| sustainable_development_goals[0].score | 0.7599999904632568 |
| sustainable_development_goals[0].display_name | Life below water |
| citation_normalized_percentile.value | 0.77551727 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |