@inbook{4cf2b781871c440cb6a7e5b3b2d7bf86,
title = "Duelist algorithm: An algorithm inspired by how duelist improve their capabilities in a duel",
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.",
keywords = "Algorithm, Duelist, Fighting, Optimization",
author = "Biyanto, {Totok Ruki} and Fibrianto, {Henokh Yernias} and Gunawan Nugroho and Hatta, {Agus Muhamad} and Erny Listijorini and Titik Budiati and Hairul Huda",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.",
year = "2016",
doi = "10.1007/978-3-319-41000-5_4",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "39--47",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}