Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel
This paper proposes an optimization algorithm based on how human fight and learn from each duelist. Since this algorithm is based on population, 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 w...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Biyanto, Totok Ruki Fibrianto, Henokh Yernias Nugroho, Gunawan Listijorini, Erny Budiati, Titik Huda, Hairul |
| description | This paper proposes an optimization algorithm based on how human fight and
learn from each duelist. Since this algorithm is based on population, 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 duelists 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. Two optimization problem is
applied for the proposed algorithm, together with genetic algorithm, particle
swarm optimization and imperialist competitive algorithm. The results show that
the proposed algorithm is able to find the better global optimum and faster
iteration. |
| doi_str_mv | 10.48550/arxiv.1512.00708 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1512_00708</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1512_00708</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-bf3628d509db610c5e33967769e3569006f6b025869a7fb76540d0b8df60a9193</originalsourceid><addsrcrecordid>eNpFj8tKxDAYRrNxIaMP4Mq8QOufZvIncVfqZQoDbroUSmISJ9AbaR2dtxerMquPDw4HDiE3DPKtEgLuTPqKx5wJVuQAEtQleX348F2cF1p272OKy6G_p-VwfrQe5ikm76g90d34Sf_5up_SePS0OfiYaGUmY2MXl-hnGgdqVu6KXATTzf76bzekeXpsql22f3muq3KfGZQqs4FjoZwA7SwyeBOec41SovZcoAbAgBYKoVAbGaxEsQUHVrmAYDTTfENuf7VrXjul2Jt0an8y2zWTfwOYTUwQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel</title><source>arXiv.org</source><creator>Biyanto, Totok Ruki ; Fibrianto, Henokh Yernias ; Nugroho, Gunawan ; Listijorini, Erny ; Budiati, Titik ; Huda, Hairul</creator><creatorcontrib>Biyanto, Totok Ruki ; Fibrianto, Henokh Yernias ; Nugroho, Gunawan ; Listijorini, Erny ; Budiati, Titik ; Huda, Hairul</creatorcontrib><description>This paper proposes an optimization algorithm based on how human fight and
learn from each duelist. Since this algorithm is based on population, 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 duelists 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. Two optimization problem is
applied for the proposed algorithm, together with genetic algorithm, particle
swarm optimization and imperialist competitive algorithm. The results show that
the proposed algorithm is able to find the better global optimum and faster
iteration.</description><identifier>DOI: 10.48550/arxiv.1512.00708</identifier><language>eng</language><subject>Computer Science - Neural and Evolutionary Computing</subject><creationdate>2015-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1512.00708$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1512.00708$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Biyanto, Totok Ruki</creatorcontrib><creatorcontrib>Fibrianto, Henokh Yernias</creatorcontrib><creatorcontrib>Nugroho, Gunawan</creatorcontrib><creatorcontrib>Listijorini, Erny</creatorcontrib><creatorcontrib>Budiati, Titik</creatorcontrib><creatorcontrib>Huda, Hairul</creatorcontrib><title>Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel</title><description>This paper proposes an optimization algorithm based on how human fight and
learn from each duelist. Since this algorithm is based on population, 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 duelists 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. Two optimization problem is
applied for the proposed algorithm, together with genetic algorithm, particle
swarm optimization and imperialist competitive algorithm. The results show that
the proposed algorithm is able to find the better global optimum and faster
iteration.</description><subject>Computer Science - Neural and Evolutionary Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpFj8tKxDAYRrNxIaMP4Mq8QOufZvIncVfqZQoDbroUSmISJ9AbaR2dtxerMquPDw4HDiE3DPKtEgLuTPqKx5wJVuQAEtQleX348F2cF1p272OKy6G_p-VwfrQe5ikm76g90d34Sf_5up_SePS0OfiYaGUmY2MXl-hnGgdqVu6KXATTzf76bzekeXpsql22f3muq3KfGZQqs4FjoZwA7SwyeBOec41SovZcoAbAgBYKoVAbGaxEsQUHVrmAYDTTfENuf7VrXjul2Jt0an8y2zWTfwOYTUwQ</recordid><startdate>20151202</startdate><enddate>20151202</enddate><creator>Biyanto, Totok Ruki</creator><creator>Fibrianto, Henokh Yernias</creator><creator>Nugroho, Gunawan</creator><creator>Listijorini, Erny</creator><creator>Budiati, Titik</creator><creator>Huda, Hairul</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20151202</creationdate><title>Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel</title><author>Biyanto, Totok Ruki ; Fibrianto, Henokh Yernias ; Nugroho, Gunawan ; Listijorini, Erny ; Budiati, Titik ; Huda, Hairul</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-bf3628d509db610c5e33967769e3569006f6b025869a7fb76540d0b8df60a9193</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Neural and Evolutionary Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Biyanto, Totok Ruki</creatorcontrib><creatorcontrib>Fibrianto, Henokh Yernias</creatorcontrib><creatorcontrib>Nugroho, Gunawan</creatorcontrib><creatorcontrib>Listijorini, Erny</creatorcontrib><creatorcontrib>Budiati, Titik</creatorcontrib><creatorcontrib>Huda, Hairul</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Biyanto, Totok Ruki</au><au>Fibrianto, Henokh Yernias</au><au>Nugroho, Gunawan</au><au>Listijorini, Erny</au><au>Budiati, Titik</au><au>Huda, Hairul</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel</atitle><date>2015-12-02</date><risdate>2015</risdate><abstract>This paper proposes an optimization algorithm based on how human fight and
learn from each duelist. Since this algorithm is based on population, 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 duelists 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. Two optimization problem is
applied for the proposed algorithm, together with genetic algorithm, particle
swarm optimization and imperialist competitive algorithm. The results show that
the proposed algorithm is able to find the better global optimum and faster
iteration.</abstract><doi>10.48550/arxiv.1512.00708</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1512.00708 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1512_00708 |
| source | arXiv.org |
| subjects | Computer Science - Neural and Evolutionary Computing |
| title | Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T16%3A08%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Duelist%20Algorithm:%20An%20Algorithm%20Inspired%20by%20How%20Duelist%20Improve%20Their%20Capabilities%20in%20a%20Duel&rft.au=Biyanto,%20Totok%20Ruki&rft.date=2015-12-02&rft_id=info:doi/10.48550/arxiv.1512.00708&rft_dat=%3Carxiv_GOX%3E1512_00708%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |