- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
The Effect of Pseudo-Meiosis Genetic Algorithm on Bit-Coding Stationary Genetic Search | ||
| Iraqi Journal of Science | ||
| Article 1, Volume 47, Issue 1, 2006, Pages 160-165 | ||
| Authors | ||
| ; a Ali Attea | ||
| Abstract | ||
| Yoshida and Adachi’s diploid genetic algorithm- the so-called pseudo-Meiosis genetic Algorithm (psM GA)- was focused on preserving population diversity and adapting the population quickly to problem changes. The large population diversity provided by psM GA with good adaptation to the problem changes were effective and sufficient to tackle non-stationary traveling salesman problem. They did not apply this genetic algorithm to other problem domains, like bit-coding problems. Hence, in this paper we revisit the psM GA, apply it on bit-coding problems so as to see the effect and search power of this genetic search algorithm on this problem domain. | ||
|
Statistics Article View: 103 PDF Download: 3 |
||