Akses terbuka
Jurnal
SINTA 1
A multiple mitosis genetic algorithm
IAES International Journal of Artificial Intelligence · Vol. 8 No. 3 (2019) · hlm. 252–258
ISSN 2252-8938, 2089-4872
Terbit 2019-09-01
Penerbit Institute of Advanced Engineering and Science
Bahasa eng
Abstrak
Genetic algorithm is a well-known metaheuristic method to solve optimization problem mimic the natural process of cell reproduction. Having great advantages on solving optimization problem makes this method popular among researchers to improve the performance of simple Genetic Algorithm and apply it in many areas. However, Genetic Algorithm has its own weakness of less diversity which cause premature convergence where the potential answer trapped in its local optimum. This paper proposed a method Multiple Mitosis Genetic Algorithm to improve the performance of simple Genetic Algorithm to promote high diversity of high-quality individuals by having 3 different steps which are set multiplying factor before the crossover process, conduct multiple mitosis crossover and introduce mini loop in each generation. Results shows that the percentage of great quality individuals improve until 90 percent of total population to find the global optimum.
Jaringan kolaborasi para penulis
16 penulis ·
41 tautan kepenulisan bersama
· 6 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Universiti Tenaga Nasional Universiti Teknologi MARA
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">A multiple mitosis genetic algorithm</dc:title>
<dc:creator>Kamil, K.</dc:creator>
<dc:creator>H Chong, K.</dc:creator>
<dc:creator>Hashim, H.</dc:creator>
<dc:creator>A. Shaaya, S.</dc:creator>
<dc:subject xml:lang="en-US"></dc:subject>
<dc:subject xml:lang="en-US">Crossover; De’jong function; Diversity; Fast convergence; Genetic algorithm</dc:subject>
<dc:description xml:lang="en-US">Genetic algorithm is a well-known metaheuristic method to solve optimization problem mimic the natural process of cell reproduction. Having great advantages on solving optimization problem makes this method popular among researchers to improve the performance of simple Genetic Algorithm and apply it in many areas. However, Genetic Algorithm has its own weakness of less diversity which cause premature convergence where the potential answer trapped in its local optimum. This paper proposed a method Multiple Mitosis Genetic Algorithm to improve the performance of simple Genetic Algorithm to promote high diversity of high-quality individuals by having 3 different steps which are set multiplying factor before the crossover process, conduct multiple mitosis crossover and introduce mini loop in each generation. Results shows that the percentage of great quality individuals improve until 90 percent of total population to find the global optimum.</dc:description>
<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
<dc:contributor xml:lang="en-US"></dc:contributor>
<dc:date>2019-09-01</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US"></dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/20268</dc:identifier>
<dc:identifier>10.11591/ijai.v8.i3.pp252-258</dc:identifier>
<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 8, No 3: September 2019; 252-258</dc:source>
<dc:source>2252-8938</dc:source>
<dc:source>2089-4872</dc:source>
<dc:source>10.11591/ijai.v8.i3</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/20268/12852</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2019 Institute of Advanced Engineering and Science</dc:rights>
<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref.
Sitasi artikel ini
APA 7
Kamil, K., H Chong, K., Hashim, H., & A. Shaaya, S. (2019). A multiple mitosis genetic algorithm. IAES International Journal of Artificial Intelligence, 8(3), 252–258. https://doi.org/10.11591/ijai.v8.i3.pp252-258
Salin
IEEE
K. Kamil, K. H Chong, H. Hashim, and S. A. Shaaya, “A multiple mitosis genetic algorithm,” IAES International Journal of Artificial Intelligence, vol. 8, no. 3, pp. 252–258, 2019, doi: 10.11591/ijai.v8.i3.pp252-258.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.