Scouting strategy for biasing fireworks algorithm search to promising directions

Jun Yu, Ying Tan, Hideyuki Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

We propose a scouting strategy to find better searching directions in fireworks algorithm (FWA) to enhance its exploitation capability. It generates spark individuals from a firework individual one by one by checking if the generated spark climbs up to a better direction, and this process continues until spark individual climbing down is generated, while canonical FWA generates spark individuals around a firework individual at once. We can know potential search directions from the number of consciously climbing up sparks. Besides this strategy, we use a filtering strategy for a random selection of FWA, where worse sparks are eliminated when their fitness is worse than their parents, i.e. fireworks, and become unable to survive in the next generation. We combined these strategies with the enhanced FWA (EFWA) and evaluated using 28 CEC2013 benchmark functions. Experimental results confirm that the proposed strategies are effective and show better performance in terms of convergence speed and accuracy. Finally, we analyze their applicability and provide some open topics.

Original languageEnglish
Title of host publicationGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
PublisherAssociation for Computing Machinery, Inc
Pages99-100
Number of pages2
ISBN (Electronic)9781450357647
DOIs
Publication statusPublished - Jul 6 2018
Event2018 Genetic and Evolutionary Computation Conference, GECCO 2018 - Kyoto, Japan
Duration: Jul 15 2018Jul 19 2018

Publication series

NameGECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

Other

Other2018 Genetic and Evolutionary Computation Conference, GECCO 2018
CountryJapan
CityKyoto
Period7/15/187/19/18

Fingerprint

Electric sparks
Search Algorithm
Speed of Convergence
Exploitation
Fitness
Continue
Filtering
Strategy
Benchmark
Experimental Results

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Yu, J., Tan, Y., & Takagi, H. (2018). Scouting strategy for biasing fireworks algorithm search to promising directions. In GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion (pp. 99-100). (GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion). Association for Computing Machinery, Inc. https://doi.org/10.1145/3205651.3205740

Scouting strategy for biasing fireworks algorithm search to promising directions. / Yu, Jun; Tan, Ying; Takagi, Hideyuki.

GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, 2018. p. 99-100 (GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, J, Tan, Y & Takagi, H 2018, Scouting strategy for biasing fireworks algorithm search to promising directions. in GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, Inc, pp. 99-100, 2018 Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, 7/15/18. https://doi.org/10.1145/3205651.3205740
Yu J, Tan Y, Takagi H. Scouting strategy for biasing fireworks algorithm search to promising directions. In GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc. 2018. p. 99-100. (GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion). https://doi.org/10.1145/3205651.3205740
Yu, Jun ; Tan, Ying ; Takagi, Hideyuki. / Scouting strategy for biasing fireworks algorithm search to promising directions. GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion. Association for Computing Machinery, Inc, 2018. pp. 99-100 (GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion).
@inproceedings{912da9a4d84d4b228949c0dd6ea6fbee,
title = "Scouting strategy for biasing fireworks algorithm search to promising directions",
abstract = "We propose a scouting strategy to find better searching directions in fireworks algorithm (FWA) to enhance its exploitation capability. It generates spark individuals from a firework individual one by one by checking if the generated spark climbs up to a better direction, and this process continues until spark individual climbing down is generated, while canonical FWA generates spark individuals around a firework individual at once. We can know potential search directions from the number of consciously climbing up sparks. Besides this strategy, we use a filtering strategy for a random selection of FWA, where worse sparks are eliminated when their fitness is worse than their parents, i.e. fireworks, and become unable to survive in the next generation. We combined these strategies with the enhanced FWA (EFWA) and evaluated using 28 CEC2013 benchmark functions. Experimental results confirm that the proposed strategies are effective and show better performance in terms of convergence speed and accuracy. Finally, we analyze their applicability and provide some open topics.",
author = "Jun Yu and Ying Tan and Hideyuki Takagi",
year = "2018",
month = "7",
day = "6",
doi = "10.1145/3205651.3205740",
language = "English",
series = "GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion",
publisher = "Association for Computing Machinery, Inc",
pages = "99--100",
booktitle = "GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion",

}

TY - GEN

T1 - Scouting strategy for biasing fireworks algorithm search to promising directions

AU - Yu, Jun

AU - Tan, Ying

AU - Takagi, Hideyuki

PY - 2018/7/6

Y1 - 2018/7/6

N2 - We propose a scouting strategy to find better searching directions in fireworks algorithm (FWA) to enhance its exploitation capability. It generates spark individuals from a firework individual one by one by checking if the generated spark climbs up to a better direction, and this process continues until spark individual climbing down is generated, while canonical FWA generates spark individuals around a firework individual at once. We can know potential search directions from the number of consciously climbing up sparks. Besides this strategy, we use a filtering strategy for a random selection of FWA, where worse sparks are eliminated when their fitness is worse than their parents, i.e. fireworks, and become unable to survive in the next generation. We combined these strategies with the enhanced FWA (EFWA) and evaluated using 28 CEC2013 benchmark functions. Experimental results confirm that the proposed strategies are effective and show better performance in terms of convergence speed and accuracy. Finally, we analyze their applicability and provide some open topics.

AB - We propose a scouting strategy to find better searching directions in fireworks algorithm (FWA) to enhance its exploitation capability. It generates spark individuals from a firework individual one by one by checking if the generated spark climbs up to a better direction, and this process continues until spark individual climbing down is generated, while canonical FWA generates spark individuals around a firework individual at once. We can know potential search directions from the number of consciously climbing up sparks. Besides this strategy, we use a filtering strategy for a random selection of FWA, where worse sparks are eliminated when their fitness is worse than their parents, i.e. fireworks, and become unable to survive in the next generation. We combined these strategies with the enhanced FWA (EFWA) and evaluated using 28 CEC2013 benchmark functions. Experimental results confirm that the proposed strategies are effective and show better performance in terms of convergence speed and accuracy. Finally, we analyze their applicability and provide some open topics.

UR - http://www.scopus.com/inward/record.url?scp=85051487081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85051487081&partnerID=8YFLogxK

U2 - 10.1145/3205651.3205740

DO - 10.1145/3205651.3205740

M3 - Conference contribution

AN - SCOPUS:85051487081

T3 - GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

SP - 99

EP - 100

BT - GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

PB - Association for Computing Machinery, Inc

ER -