Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

A multiple mitosis genetic algorithm

IAES International Journal of Artificial Intelligence · Vol. 8 No. 3 (2019) · pp. 252–258

DOI
10.11591/ijai.v8.i3.pp252-258
ISSN
2252-8938, 2089-4872
Published
2019-09-01
Publisher
Institute of Advanced Engineering and Science
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Keywords

Collaboration network of the authors

16 authors · 41 co-authorship links · 6 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universiti Tenaga Nasional
  • Universiti Teknologi MARA
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Mohd Helmi MansorUniversiti Tenaga Nasional2
Jian Ding TanUniversiti Tenaga Nasional1
Sieh Kiong TiongUniversiti Tenaga Nasional1
Ying Ying KoayUniversiti Tenaga Nasional1
Siaw Paw KohUniversiti Tenaga Nasional1
Janaka Bandara EkanayakeUniversiti Tenaga Nasional1
Ismail MusirinUniversiti Teknologi MARA1
Shahril Irwan SulaimanUniversiti Teknologi MARA1
Sharifah Azma Syed MustaffaUniversiti Tenaga Nasional1
Karmila Binti KamilUniversiti Tenaga Nasional1
Muhammad Amirul Ashraf Ab RahmanUniversiti Tenaga Nasional1
Halimatun HashimUniversiti Tenaga Nasional1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, first harvested 8 Nov 2026, last seen 16 Nov 2026.
Original metadata (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>