Finite persisting sphere Genetic Algorithm in solving multiobjectives problem

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.