DocumentCode
2381616
Title
Finite persisting sphere Genetic Algorithm in solving multiobjectives problem
Author
Kamil, Karmila ; Hen, Chong Kok ; Kiong, Tiong Sieh ; Ho, Yeap Kim
Author_Institution
Coll. of Eng., Univ. Tanaga Nasional, Kajang, Malaysia
fYear
2010
fDate
13-14 Dec. 2010
Firstpage
183
Lastpage
186
Abstract
This paper analyzes the performance of Genetic Algorithm using a new concept, namely Finite Persisting Sphere Genetic Algorithm (FPSGA). This algorithm shows the unique method in achieving fast convergence and great diversity for the multiobjective problem. These special characteristics of FPSGA are very useful in order to improve Genetic Algorithm (GA) performance to have great individuals mingling in the area of solution. Besides can help a system to solve a GA problem in a short duration, it can also prevent the solutions from trapped in the local optimum.
Keywords
genetic algorithms; problem solving; finite persisting sphere genetic algorithm; local optimum; multiobjective problem solving; Genetic algorithm; fast convergence; great diversity;
fLanguage
English
Publisher
ieee
Conference_Titel
Research and Development (SCOReD), 2010 IEEE Student Conference on
Conference_Location
Putrajaya
Print_ISBN
978-1-4244-8647-2
Type
conf
DOI
10.1109/SCORED.2010.5703998
Filename
5703998
Link To Document