
		<paper>
			<loc>https://jjcit.org/paper/227</loc>
			<title>CSGA: A DUAL POPULATION GENETIC ALGORITHM BASED ON MEXICAN CAVEFISH GENETIC DIVERSITY</title>
			<doi>10.5455/jjcit.71-1707664207</doi>
			<authors>Esra’a Alkafaween,Ahmad Hassanat,Ehab Essa,Samir Elmougy</authors>
			<keywords>Cave-surface GA,Diversity,GAs,Premature convergence</keywords>
			<citation>1</citation>
			<views>2823</views>
			<downloads>556</downloads>
			<received_date>11-Feb.-2024</received_date>
			<revised_date>  5-Apr.-2024</revised_date>
			<accepted_date>  27-Apr.-2024</accepted_date>
			<abstract>Genetic  algorithms  (GAs)  are  search  algorithms  based  on population  genetics  and  natural-selection  concepts. 
Maintaining  population  variety  in  GAs  is  critical  for  ensuring  global  exploration  and  mitigating  the  risks  of 
premature  convergence. Rapid  convergence  to  local  optima  is  one  such  challenge  in  the  application  of  genetic 
algorithms.  To  address  this  issue,  we  provide  Cave-Surface  GA  (CSGA),  an  alternative  method  based  on  the 
Dual Population GA and inspired by the genetic variety observed in Mexican cavefish. Through inter-population 
cross-breeding,  CSGA  increases  diversity via a  secondary  population  (cave  population)  and  facilitates  the 
exchange  of  information  between  populations, effectively  counteracting  premature  convergence.  Several 
experiments  are  carried  out  utilizing  benchmark  instances  of  the  Traveling  Salesman  Problem  (TSP)  obtained 
from TSPLIB, a well-known TSP problem  library. Our experimental results over many  TSP instances show that 
CSGA  outperforms  both  classic  GAs  and  other  GAs  that  use  diversity-preservation  techniques,  such  as 
Multipopulation  GA  (MPGA).  CSGA  has  the  potential  to  give  promising  solutions  to  challenging  optimization 
issues like TSP.</abstract>
		</paper>


