IFA-EO: An Improved Firefly Algorithm Hybridized With Extremal Optimization for Continuous Unconstrained Optimization Problems Article Swipe
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.21203/rs.3.rs-190790/v1
As one of the evolutionary algorithms, firefly algorithm (FA) has been widely used to solve various complex optimization problems. However, FA has significant drawbacks in slow convergence rate and is easily trapped into local optimum. To tackle these defects, this paper proposes an improved FA combined with extremal optimization (EO), named IFA-EO, where three strategies are incorporated. First, to balance the tradeoff between exploration ability and exploitation ability, we adopt a new attraction model for FA operation, which combines the full attraction model and the single attraction model through the probability choice strategy. In the single attraction model, small probability accepts the worse solution to improve the diversity of the offspring. Second, the adaptive step size is proposed based on the number of iterations to dynamically adjust the attention to the exploration model or exploitation model. Third, we combine an EO algorithm with powerful ability in local-search into FA. Experiments are tested on two group popular benchmarks including complex unimodal and multimodal functions. Our experimental results demonstrate that the proposed IFA-EO algorithm can deal with various complex optimization problems and has similar or better performance than the other eight FA variants, three EO-based algorithms, and one advanced differential evolution variant in terms of accuracy and statistical results.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.21203/rs.3.rs-190790/v1
- https://www.researchsquare.com/article/rs-190790/latest.pdf
- OA Status
- green
- Cited By
- 2
- References
- 62
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4200195442
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4200195442Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.21203/rs.3.rs-190790/v1Digital Object Identifier
- Title
-
IFA-EO: An Improved Firefly Algorithm Hybridized With Extremal Optimization for Continuous Unconstrained Optimization ProblemsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-11-29Full publication date if available
- Authors
-
Min-Rong Chen, Liuqing Yang, Guo‐Qiang Zeng, Kang‐Di Lu, Yi-Yuan HuangList of authors in order
- Landing page
-
https://doi.org/10.21203/rs.3.rs-190790/v1Publisher landing page
- PDF URL
-
https://www.researchsquare.com/article/rs-190790/latest.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://www.researchsquare.com/article/rs-190790/latest.pdfDirect OA link when available
- Concepts
-
Firefly algorithm, Optimization algorithm, Firefly protocol, Mathematical optimization, Algorithm, Computer science, Optimization problem, Mathematics, Biology, Zoology, Particle swarm optimizationTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1, 2023: 1Per-year citation counts (last 5 years)
- References (count)
-
62Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4200195442 |
|---|---|
| doi | https://doi.org/10.21203/rs.3.rs-190790/v1 |
| ids.doi | https://doi.org/10.21203/rs.3.rs-190790/v1 |
| ids.openalex | https://openalex.org/W4200195442 |
| fwci | 0.28220715 |
| type | preprint |
| title | IFA-EO: An Improved Firefly Algorithm Hybridized With Extremal Optimization for Continuous Unconstrained Optimization Problems |
| 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.9977999925613403 |
| 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/T11697 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9965999722480774 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Numerical Methods and Algorithms |
| topics[2].id | https://openalex.org/T10963 |
| topics[2].field.id | https://openalex.org/fields/26 |
| topics[2].field.display_name | Mathematics |
| topics[2].score | 0.9926999807357788 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2612 |
| topics[2].subfield.display_name | Numerical Analysis |
| topics[2].display_name | Advanced Optimization Algorithms Research |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C154982244 |
| concepts[0].level | 3 |
| concepts[0].score | 0.9235807657241821 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5451844 |
| concepts[0].display_name | Firefly algorithm |
| concepts[1].id | https://openalex.org/C2987595161 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6248250603675842 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[1].display_name | Optimization algorithm |
| concepts[2].id | https://openalex.org/C107477482 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5564687848091125 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q22570039 |
| concepts[2].display_name | Firefly protocol |
| concepts[3].id | https://openalex.org/C126255220 |
| concepts[3].level | 1 |
| concepts[3].score | 0.4961276948451996 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[3].display_name | Mathematical optimization |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.4937981069087982 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.48734888434410095 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C137836250 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4351264238357544 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[6].display_name | Optimization problem |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.32271647453308105 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C86803240 |
| concepts[8].level | 0 |
| concepts[8].score | 0.14913520216941833 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[8].display_name | Biology |
| concepts[9].id | https://openalex.org/C90856448 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q431 |
| concepts[9].display_name | Zoology |
| concepts[10].id | https://openalex.org/C85617194 |
| concepts[10].level | 2 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2072794 |
| concepts[10].display_name | Particle swarm optimization |
| keywords[0].id | https://openalex.org/keywords/firefly-algorithm |
| keywords[0].score | 0.9235807657241821 |
| keywords[0].display_name | Firefly algorithm |
| keywords[1].id | https://openalex.org/keywords/optimization-algorithm |
| keywords[1].score | 0.6248250603675842 |
| keywords[1].display_name | Optimization algorithm |
| keywords[2].id | https://openalex.org/keywords/firefly-protocol |
| keywords[2].score | 0.5564687848091125 |
| keywords[2].display_name | Firefly protocol |
| keywords[3].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[3].score | 0.4961276948451996 |
| keywords[3].display_name | Mathematical optimization |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.4937981069087982 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.48734888434410095 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/optimization-problem |
| keywords[6].score | 0.4351264238357544 |
| keywords[6].display_name | Optimization problem |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.32271647453308105 |
| keywords[7].display_name | Mathematics |
| keywords[8].id | https://openalex.org/keywords/biology |
| keywords[8].score | 0.14913520216941833 |
| keywords[8].display_name | Biology |
| language | en |
| locations[0].id | doi:10.21203/rs.3.rs-190790/v1 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402450 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Research Square (Research Square) |
| locations[0].source.host_organization | https://openalex.org/I4210096694 |
| locations[0].source.host_organization_name | Research Square (United States) |
| locations[0].source.host_organization_lineage | https://openalex.org/I4210096694 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.researchsquare.com/article/rs-190790/latest.pdf |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | posted-content |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.21203/rs.3.rs-190790/v1 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5079910881 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9817-0267 |
| authorships[0].author.display_name | Min-Rong Chen |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I187400657 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| authorships[0].institutions[0].id | https://openalex.org/I187400657 |
| authorships[0].institutions[0].ror | https://ror.org/01kq0pv72 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I187400657 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | South China Normal University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Min-Rong Chen |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| authorships[1].author.id | https://openalex.org/A5086250883 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-4064-501X |
| authorships[1].author.display_name | Liuqing Yang |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I187400657 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| authorships[1].institutions[0].id | https://openalex.org/I187400657 |
| authorships[1].institutions[0].ror | https://ror.org/01kq0pv72 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I187400657 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | South China Normal University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Liu-Qing Yang |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| authorships[2].author.id | https://openalex.org/A5046775963 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-7453-7420 |
| authorships[2].author.display_name | Guo‐Qiang Zeng |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I159948400 |
| authorships[2].affiliations[0].raw_affiliation_string | College of Cyber Security, Jinan University, Guangzhou 510632, China |
| authorships[2].affiliations[1].institution_ids | https://openalex.org/I146620803 |
| authorships[2].affiliations[1].raw_affiliation_string | National-Local Joint Engineering Laboratory of Digitalize Electrical Design Technology, Wenzhou University, Wenzhou 325035, China |
| authorships[2].institutions[0].id | https://openalex.org/I159948400 |
| authorships[2].institutions[0].ror | https://ror.org/02xe5ns62 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I159948400 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Jinan University |
| authorships[2].institutions[1].id | https://openalex.org/I146620803 |
| authorships[2].institutions[1].ror | https://ror.org/020hxh324 |
| authorships[2].institutions[1].type | education |
| authorships[2].institutions[1].lineage | https://openalex.org/I146620803 |
| authorships[2].institutions[1].country_code | CN |
| authorships[2].institutions[1].display_name | Wenzhou University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Guo-Qiang Zeng |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | College of Cyber Security, Jinan University, Guangzhou 510632, China, National-Local Joint Engineering Laboratory of Digitalize Electrical Design Technology, Wenzhou University, Wenzhou 325035, China |
| authorships[3].author.id | https://openalex.org/A5072829479 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0131-5085 |
| authorships[3].author.display_name | Kang‐Di Lu |
| authorships[3].countries | CN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I76130692 |
| authorships[3].affiliations[0].raw_affiliation_string | Institute of Cyber Systems and Control, Zhejiang University, Hangzhou 310018, China |
| authorships[3].institutions[0].id | https://openalex.org/I76130692 |
| authorships[3].institutions[0].ror | https://ror.org/00a2xv884 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I76130692 |
| authorships[3].institutions[0].country_code | CN |
| authorships[3].institutions[0].display_name | Zhejiang University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Kang-Di Lu |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Institute of Cyber Systems and Control, Zhejiang University, Hangzhou 310018, China |
| authorships[4].author.id | https://openalex.org/A5045089699 |
| authorships[4].author.orcid | |
| authorships[4].author.display_name | Yi-Yuan Huang |
| authorships[4].countries | CN |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I187400657 |
| authorships[4].affiliations[0].raw_affiliation_string | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| authorships[4].institutions[0].id | https://openalex.org/I187400657 |
| authorships[4].institutions[0].ror | https://ror.org/01kq0pv72 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I187400657 |
| authorships[4].institutions[0].country_code | CN |
| authorships[4].institutions[0].display_name | South China Normal University |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Yi-Yuan Huang |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | School of Computer Science, South China Normal University, Guangzhou 510631, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.researchsquare.com/article/rs-190790/latest.pdf |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | IFA-EO: An Improved Firefly Algorithm Hybridized With Extremal Optimization for Continuous Unconstrained Optimization Problems |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| 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.9977999925613403 |
| 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/W2222304693, https://openalex.org/W1599691202, https://openalex.org/W4200439108, https://openalex.org/W2940563633, https://openalex.org/W2490269892, https://openalex.org/W2757862489, https://openalex.org/W2810756170, https://openalex.org/W2411884393, https://openalex.org/W2984874436, https://openalex.org/W2912808862 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.21203/rs.3.rs-190790/v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402450 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| 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 | Research Square (Research Square) |
| best_oa_location.source.host_organization | https://openalex.org/I4210096694 |
| best_oa_location.source.host_organization_name | Research Square (United States) |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I4210096694 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.researchsquare.com/article/rs-190790/latest.pdf |
| best_oa_location.version | acceptedVersion |
| best_oa_location.raw_type | posted-content |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-190790/v1 |
| primary_location.id | doi:10.21203/rs.3.rs-190790/v1 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402450 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Research Square (Research Square) |
| primary_location.source.host_organization | https://openalex.org/I4210096694 |
| primary_location.source.host_organization_name | Research Square (United States) |
| primary_location.source.host_organization_lineage | https://openalex.org/I4210096694 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.researchsquare.com/article/rs-190790/latest.pdf |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | posted-content |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.21203/rs.3.rs-190790/v1 |
| publication_date | 2021-11-29 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W6603424559, https://openalex.org/W7062417688, https://openalex.org/W6682642761, https://openalex.org/W2126105956, https://openalex.org/W6779893750, https://openalex.org/W6674854391, https://openalex.org/W2966560442, https://openalex.org/W3003465801, https://openalex.org/W2829538282, https://openalex.org/W6635924533, https://openalex.org/W6696205611, https://openalex.org/W2792040770, https://openalex.org/W2808295444, https://openalex.org/W806862238, https://openalex.org/W2087345335, https://openalex.org/W2005424446, https://openalex.org/W2885253746, https://openalex.org/W2589586594, https://openalex.org/W6731526204, https://openalex.org/W6697480414, https://openalex.org/W2891834780, https://openalex.org/W2078551005, https://openalex.org/W287415077, https://openalex.org/W6662332855, https://openalex.org/W6643647404, https://openalex.org/W1566557213, https://openalex.org/W1752423028, https://openalex.org/W2802292836, https://openalex.org/W2081873429, https://openalex.org/W2889538283, https://openalex.org/W1966977714, https://openalex.org/W2954335066, https://openalex.org/W3007317032, https://openalex.org/W1481602796, https://openalex.org/W2889493157, https://openalex.org/W1993122005, https://openalex.org/W2167485812, https://openalex.org/W2085919864, https://openalex.org/W2042389409, https://openalex.org/W1985627555, https://openalex.org/W2606601052, https://openalex.org/W2108288996, https://openalex.org/W2096166399, https://openalex.org/W2955808224, https://openalex.org/W2910132802, https://openalex.org/W2295939830, https://openalex.org/W4300106150, https://openalex.org/W84428182, https://openalex.org/W2951367323, https://openalex.org/W1973997930, https://openalex.org/W3037523627, https://openalex.org/W2146713522, https://openalex.org/W2567500619, https://openalex.org/W2963103847, https://openalex.org/W2170123469, https://openalex.org/W4232937450, https://openalex.org/W2131235969, https://openalex.org/W2048632712, https://openalex.org/W4410109186, https://openalex.org/W2289333180, https://openalex.org/W2151554678, https://openalex.org/W4297917482 |
| referenced_works_count | 62 |
| abstract_inverted_index.a | 71 |
| abstract_inverted_index.As | 1 |
| abstract_inverted_index.EO | 141 |
| abstract_inverted_index.FA | 21, 45, 76, 190 |
| abstract_inverted_index.In | 94 |
| abstract_inverted_index.To | 36 |
| abstract_inverted_index.an | 43, 140 |
| abstract_inverted_index.in | 25, 146, 201 |
| abstract_inverted_index.is | 30, 117 |
| abstract_inverted_index.of | 3, 109, 123, 203 |
| abstract_inverted_index.on | 120, 153 |
| abstract_inverted_index.or | 134, 183 |
| abstract_inverted_index.to | 14, 59, 105, 125, 130 |
| abstract_inverted_index.we | 69, 138 |
| abstract_inverted_index.FA. | 149 |
| abstract_inverted_index.Our | 164 |
| abstract_inverted_index.and | 29, 66, 84, 161, 180, 195, 205 |
| abstract_inverted_index.are | 56, 151 |
| abstract_inverted_index.can | 173 |
| abstract_inverted_index.for | 75 |
| abstract_inverted_index.has | 10, 22, 181 |
| abstract_inverted_index.new | 72 |
| abstract_inverted_index.one | 2, 196 |
| abstract_inverted_index.the | 4, 61, 80, 85, 90, 95, 102, 107, 110, 113, 121, 128, 131, 169, 187 |
| abstract_inverted_index.two | 154 |
| abstract_inverted_index.(FA) | 9 |
| abstract_inverted_index.been | 11 |
| abstract_inverted_index.deal | 174 |
| abstract_inverted_index.full | 81 |
| abstract_inverted_index.into | 33, 148 |
| abstract_inverted_index.rate | 28 |
| abstract_inverted_index.size | 116 |
| abstract_inverted_index.slow | 26 |
| abstract_inverted_index.step | 115 |
| abstract_inverted_index.than | 186 |
| abstract_inverted_index.that | 168 |
| abstract_inverted_index.this | 40 |
| abstract_inverted_index.used | 13 |
| abstract_inverted_index.with | 47, 143, 175 |
| abstract_inverted_index.(EO), | 50 |
| abstract_inverted_index.adopt | 70 |
| abstract_inverted_index.based | 119 |
| abstract_inverted_index.eight | 189 |
| abstract_inverted_index.group | 155 |
| abstract_inverted_index.local | 34 |
| abstract_inverted_index.model | 74, 83, 88, 133 |
| abstract_inverted_index.named | 51 |
| abstract_inverted_index.other | 188 |
| abstract_inverted_index.paper | 41 |
| abstract_inverted_index.small | 99 |
| abstract_inverted_index.solve | 15 |
| abstract_inverted_index.terms | 202 |
| abstract_inverted_index.these | 38 |
| abstract_inverted_index.three | 54, 192 |
| abstract_inverted_index.where | 53 |
| abstract_inverted_index.which | 78 |
| abstract_inverted_index.worse | 103 |
| abstract_inverted_index.First, | 58 |
| abstract_inverted_index.IFA-EO | 171 |
| abstract_inverted_index.Third, | 137 |
| abstract_inverted_index.adjust | 127 |
| abstract_inverted_index.better | 184 |
| abstract_inverted_index.choice | 92 |
| abstract_inverted_index.easily | 31 |
| abstract_inverted_index.model, | 98 |
| abstract_inverted_index.model. | 136 |
| abstract_inverted_index.number | 122 |
| abstract_inverted_index.single | 86, 96 |
| abstract_inverted_index.tackle | 37 |
| abstract_inverted_index.tested | 152 |
| abstract_inverted_index.widely | 12 |
| abstract_inverted_index.IFA-EO, | 52 |
| abstract_inverted_index.Second, | 112 |
| abstract_inverted_index.ability | 65, 145 |
| abstract_inverted_index.accepts | 101 |
| abstract_inverted_index.balance | 60 |
| abstract_inverted_index.between | 63 |
| abstract_inverted_index.combine | 139 |
| abstract_inverted_index.complex | 17, 159, 177 |
| abstract_inverted_index.firefly | 7 |
| abstract_inverted_index.improve | 106 |
| abstract_inverted_index.popular | 156 |
| abstract_inverted_index.results | 166 |
| abstract_inverted_index.similar | 182 |
| abstract_inverted_index.through | 89 |
| abstract_inverted_index.trapped | 32 |
| abstract_inverted_index.variant | 200 |
| abstract_inverted_index.various | 16, 176 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.EO-based | 193 |
| abstract_inverted_index.However, | 20 |
| abstract_inverted_index.ability, | 68 |
| abstract_inverted_index.accuracy | 204 |
| abstract_inverted_index.adaptive | 114 |
| abstract_inverted_index.advanced | 197 |
| abstract_inverted_index.combined | 46 |
| abstract_inverted_index.combines | 79 |
| abstract_inverted_index.defects, | 39 |
| abstract_inverted_index.extremal | 48 |
| abstract_inverted_index.improved | 44 |
| abstract_inverted_index.optimum. | 35 |
| abstract_inverted_index.powerful | 144 |
| abstract_inverted_index.problems | 179 |
| abstract_inverted_index.proposed | 118, 170 |
| abstract_inverted_index.proposes | 42 |
| abstract_inverted_index.results. | 207 |
| abstract_inverted_index.solution | 104 |
| abstract_inverted_index.tradeoff | 62 |
| abstract_inverted_index.unimodal | 160 |
| abstract_inverted_index.algorithm | 8, 142, 172 |
| abstract_inverted_index.attention | 129 |
| abstract_inverted_index.diversity | 108 |
| abstract_inverted_index.drawbacks | 24 |
| abstract_inverted_index.evolution | 199 |
| abstract_inverted_index.including | 158 |
| abstract_inverted_index.problems. | 19 |
| abstract_inverted_index.strategy. | 93 |
| abstract_inverted_index.variants, | 191 |
| abstract_inverted_index.attraction | 73, 82, 87, 97 |
| abstract_inverted_index.benchmarks | 157 |
| abstract_inverted_index.functions. | 163 |
| abstract_inverted_index.iterations | 124 |
| abstract_inverted_index.multimodal | 162 |
| abstract_inverted_index.offspring. | 111 |
| abstract_inverted_index.operation, | 77 |
| abstract_inverted_index.strategies | 55 |
| abstract_inverted_index.Experiments | 150 |
| abstract_inverted_index.algorithms, | 6, 194 |
| abstract_inverted_index.convergence | 27 |
| abstract_inverted_index.demonstrate | 167 |
| abstract_inverted_index.dynamically | 126 |
| abstract_inverted_index.exploration | 64, 132 |
| abstract_inverted_index.performance | 185 |
| abstract_inverted_index.probability | 91, 100 |
| abstract_inverted_index.significant | 23 |
| abstract_inverted_index.statistical | 206 |
| abstract_inverted_index.differential | 198 |
| abstract_inverted_index.evolutionary | 5 |
| abstract_inverted_index.experimental | 165 |
| abstract_inverted_index.exploitation | 67, 135 |
| abstract_inverted_index.local-search | 147 |
| abstract_inverted_index.optimization | 18, 49, 178 |
| abstract_inverted_index.incorporated. | 57 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| corresponding_author_ids | https://openalex.org/A5046775963 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 5 |
| corresponding_institution_ids | https://openalex.org/I146620803, https://openalex.org/I159948400 |
| citation_normalized_percentile.value | 0.65722952 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |