Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Swarm flip-crossover algorithm: a new swarm-based metaheuristic enriched with a crossover strategy

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 14 No. 2 (2024)

DOI
10.11591/ijece.v14i2.pp2145-2155
ISSN
2722-2578, 2088-8708
Published
2024-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

A new swarm-based metaheuristic that is also enriched with the crossover technique called swarm flip-crossover algorithm (SFCA) is introduced in this work. SFCA uses swarm intelligence as its primary technique and the crossover as its secondary one. It consists of three searches in every iteration. The swarm member walks toward the best member as the first search. The central point of the swarm becomes the target in the second search. There are two walks in the second search. The first walk is getting closer to the target, while the second is avoiding the target. The better result between these two walks becomes the candidate for the replacement. In the third search, the swarm member performs balance arithmetic crossover with the central point of the space or jumps to the opposite location within the area (flipping). The assessment is taken by confronting SFCA with five new metaheuristics: slime mold algorithm (SMA), golden search optimization (GSO), osprey optimization algorithm (OOA), coati optimization algorithm (COA), and walrus optimization algorithm (WaOA) in handling the set of 23 functions. The result shows that SFCA performs consecutively better than SMA, GSO, OOA, COA, and WaOA in 20, 23, 17, 17, and 17 functions.

Collaboration network of the authors

16 authors · 37 co-authorship links · 4 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Telkom University
  • Institut Teknologi Telkom Surabaya
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Helmy WidyantaraInstitut Teknologi Telkom Surabaya3
Meta KallistaTelkom University2
Axel DavidTelkom University2
Panji Christoper SilalahiTelkom University2
Yohanes Yogas HerlambangTelkom University2
Muhammad Dwi HariyantoTelkom University1
Seno Adi PutraTelkom University1
Andrew Brian OsmondTelkom University1
Budhi IrawanTelkom University1
Rifqi Muhammad FikriTelkom University1
Muhammad Riyadhul Jinan NasutionTelkom University1
Faiq HaqqaniTelkom University1
Raenaldi Ardiansyah SidikTelkom University1
Ratna Astuti NugrahaeniTelkom University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Swarm flip-crossover algorithm: a new swarm-based metaheuristic enriched with a crossover strategy</dc:title><dc:creator>Kusuma, Purba Daru</dc:creator><dc:creator>Hasibuan, Faisal Candrasyah</dc:creator><dc:description>&lt;jats:p&gt;A new swarm-based metaheuristic that is also enriched with the crossover technique called swarm flip-crossover algorithm (SFCA) is introduced in this work. SFCA uses swarm intelligence as its primary technique and the crossover as its secondary one. It consists of three searches in every iteration. The swarm member walks toward the best member as the first search. The central point of the swarm becomes the target in the second search. There are two walks in the second search. The first walk is getting closer to the target, while the second is avoiding the target. The better result between these two walks becomes the candidate for the replacement. In the third search, the swarm member performs balance arithmetic crossover with the central point of the space or jumps to the opposite location within the area (flipping). The assessment is taken by confronting SFCA with five new metaheuristics: slime mold algorithm (SMA), golden search optimization (GSO), osprey optimization algorithm (OOA), coati optimization algorithm (COA), and walrus optimization algorithm (WaOA) in handling the set of 23 functions. The result shows that SFCA performs consecutively better than SMA, GSO, OOA, COA, and WaOA in 20, 23, 17, 17, and 17 functions.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2024-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v14i2.pp2145-2155</dc:identifier><dc:identifier>10.11591/ijece.v14i2.pp2145-2155</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 14 No 2 (2024); 2145</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/33950/17292</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>