Abstract

This paper proposes an optimization algorithm based on human fight and learn from each duelist. The proposed algorithm starts with an initial set of duelists. The duel is to determine the winner and loser. The loser learns from the winner, while the winner try their new skill or technique that may improve their fighting capabilities. A few duelists with highest fighting capabilities are called as champion. The champion train a new duelist such as their capabilities. The new duelist will join the tournament as a representative of each champion. All duelist are re-evaluated, and the duelists with worst fighting capabilities is eliminated to maintain the amount of duelists. Several benchmark functions is used in this work. The results shows that Duelist Algorithm outperform other algorithms in several functions.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages39-47
Number of pages9
DOIs
Publication statusPublished - 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9712 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Algorithm
  • Duelist
  • Fighting
  • Optimization

Fingerprint

Dive into the research topics of 'Duelist algorithm: An algorithm inspired by how duelist improve their capabilities in a duel'. Together they form a unique fingerprint.

Cite this