Maintaining diversity for genetic algorithm : a case of timetabling problem.
Over the last decade, variant of genetic algorithm (GA) approaches have been used to solve various type of optimization problems. Premature convergence is the main problem for GA performance. A common hyphothesis is that high diversity is important to avoid this problem. Failure to maintain GA popu...
Main Authors: | Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam |
---|---|
Format: | Article |
Language: | English English |
Published: |
Penerbit UTM Press
2006
|
Online Access: | http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf |
Similar Items
-
A genetic algorithm approach for timetabling problem: the time group strategy
by: Md Sultan, Abu Bakar, et al.
Published: (2004) -
Selecting quality initial random seed for metaheuristic pproaches: a case of timetabling problem
by: Md Sultan, Abu Bakar, et al.
Published: (2008) -
Exploiting fitness distance correlation (FDC) of timetabling instances
by: Md Sultan, Abu Bakar, et al.
Published: (2005) -
Hybrid Metaheuristic Algorithm and Metaheuristic Performance Measurement for Solving University Course Timetabling Problem
by: Md Sultan, Abu Bakar
Published: (2007) -
New partial evaluation function in constructive hypher-heuristic framework for examination timetabling problem.
by: Pour, Sh. Mohammad, et al.
Published: (2009)