• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.417-422
• /
• 2007

A new evolution method termed queen-bee and mutant-bee evolution is based on the previous queen-bee evolution [1]. Even though the queen-bee evolution has shown very good performances, two parameters for strong mutation are added to the genetic algorithms. This makes the application of genetic algorithms with queen-bee evolution difficult because the values of the two parameters are empirically decided by a trial-and-error method without a systematic method. The queen- bee and mutant-bee evolution has no this problem because it does not need additional parameters for strong mutation. Experimental results with typical problems showed that the queen-bee and mutant-bee evolution produced nearly similar results to the best ones of queen-bee evolution even though it didn't need to select proper values of additional parameters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.233-236
• /
• 2007

A new evolution method for strong exploration and strong exploitation termed queen-bee and mutant-bee evolution is proposed based on the previous queen-bee evolution [1]. Even though the queen-bee evolution has shown very good performances, two parameters for strong mutation are added to the genetic algorithms. This makes the application of genetic algorithms with queen-bee evolution difficult because the values of the two parameters are empirically decided by a trial-and-error method without a systematic method. The queen-bee and mutant-bee evolution has no this problem because it does not need additional parameters for strong mutation. Experimental results with typical problems showed that the queen-bee and mutant-bee evolution produced nearly similar results to the best ones of queen-bee evolution even though it didn't need to select proper values of additional parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.4
• /
• pp.129-137
• /
• 2012

The queen-bee genetic algorithm that we made by mimicking of the reproduction of queen-bee has considerably improved the performances of genetic algorithm. However, since we used only one queen-bee in the queen-bee genetic algorithm, a problem that individuals of genetic algorithm were driven to one place where the queen-bee existed occurred. This made the performances of the queen-bee genetic algorithm degrade. In order to solve this problem, we introduce a multiple queen-bee evolution method by employing another queen-bee whose fitness is the most significantly increased than its parents as well as the original queen-bee that is the best individual in a generation. This multiple queen-bee evolution makes the probability of falling into local optimum areas decrease and allows the individuals to easily get out of the local optimum areas even if the individuals fall into a local optimum area. This results in increasing the performances of the genetic algorithm. Experimental results with four function optimization problems showed that the performances of the proposed method were better than those of the existing method in the most cases.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.310-315
• /
• 2005

This paper proposes a fast optimization method by combining queen-bee evolution and derivative evaluation in genetic algorithms. These two operations make it possible for genetic algorithms to focus on highly fitted individuals and rapidly evolved individuals, respectively. Even though the two operations can also increase the probability that genetic algorithms fall into premature convergence phenomenon, that can be controlled by strong mutation rates. That is, the two operations and the strong mutation strengthen exploitation and exploration of the genetic algorithms, respectively. As a result, the genetic algorithm employing queen-bee evolution and derivative evaluation finds optimum solutions more quickly than those employing one of them. This was proved by experiments with one pattern matching problem and two function optimization problems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.29-35
• /
• 2012

This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence and used it as a control parameter of those. Experimental results with four function optimization problems showed that our method was similar to or sometimes superior to the best result of empirical selections. This indicates that our method is very useful to practical optimization problems because it does not need time consuming trials.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.54-61
• /
• 2012

This paper proposes a fusion method of the queen-bee evolution into the rank-based control of mutation probability for improving the performances of genetic algorithms. The rank-based control of mutation probability which showed some performance improvements than the original method was a method that prevented individuals of genetic algorithms from falling into local optimum areas and also made it possible for the individuals to get out of the local optimum areas if they fell into there. This method, however, showed not good performances at the optimization problems that had a global optimum located in a small area regardless of the number of local optimum areas. We think that this is because the method is insufficient in the convergence into the global optimum, so propose a fusion method of the queen-bee evolution into this method in this paper. The queen-bee evolution inspired by reproduction process of queen-bee is a method that can strengthen the convergency of genetic algorithms. From the extensive experiments with four function optimization problems in order to measure the performances of proposed method we could find that the performances of proposed method was considerably good at the optimization problems whose global optimum is located in a small area as we expected. Our method, however, showed not good performances at the problems whose global optima were distributed in broad ranges and even showed bad performances at the problems whose global optima were located far away. These results indicate that our method can be effectively used at the problems whose global optimum is located in a small area.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.4
• /
• pp.263-268
• /
• 2010

The premature convergence of genetic algorithms (GAs) is the most major factor of slow evolution of GAs. In this paper we propose a novel method to solve this problem through competition of multiple offspring of in dividuals. Unlike existing methods, each parents in our method generates multiple offspring and then generated multiple offspring compete each other, finally winner offspring become to real offspring. From this multiple offspring competition, our GA rarel falls into the premature convergence and easily gets out of the local optimum areas without negative effects. This makes our GA fast evolve to the global optimum. Experimental results with four function optimization problems showed that our method was superior to the original GA and had similar performances to the best ones of queen-bee GA with best parameters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.245-248
• /
• 2011

본 논문에서는 여왕벌 진화를 모방하여 개발한 유전자알고리즘에서 강돌연변이 수행비율 및 강돌연변이 확률을 자체적으로 조정하는 방법을 제안한다. 이렇게 함으로서 적절한 강돌연변이 수행비율 및 강돌연변이 확률을 여러 번의 실험을 통하여 경험적으로 선택하는 문제를 완화하여 여왕벌 진화의 적용을 보다 쉽게 할 수 있다. 3개의 최적화문제에 제안한 방법을 적용해 본 결과 비교적 우수한 성능을 보였다. 하지만 다수의 실험을 통하여 얻은 최고의 성능보다는 우수하지는 못했는데 추후 성능을 보다 더 개선하여 이에 근접한 성능을 얻을 수 있는 알고리즘의 개발이 필요하다.