• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.80-83
• /
• 2003

A Genetic algorithm is a searching algorithm that based on the law of the survival of the fittest. Multi-population Genetic Algorithms are a modified form of genetic algorithm. Therefore, experience with fuzzy logic and genetic algorithm has proven to be that a combination of them can efficiently make up for their own deficiency. The Multi-population Genetic Algorithms independently evolve subpopulations. In this paper, we suggest a new coding method that independently evolves subpopulations using the fuzzy logic controller. The fuzzy logic controller has applied two fuzzy logic controllers that are implemented to adaptively adjust the crossover rate and mutation rate during the optimization process. The migration scheme in the multi-population genetic algorithms using fuzzy logic controllers is tested for a function optimization problem, and compared with other group migration schemes, therefore the groups migration scheme is then performed. The results demonstrate that the migration scheme in the multi-population genetic algorithms using fuzzy logic controller has a much better performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5464-5488
• /
• 2019

The multi-population genetic algorithm in multi-target paths coverage has become a top choice for many test engineers. Also, information sharing strategy can improve the efficiency of multi-population genetic algorithm to generate multi-target test data; however, there is still space for some improvements in several aspects, which will affect the effectiveness of covering the target path set. Therefore, a multi-target paths coverage strategy is proposed by improving multi-population genetic algorithm based on individual information sharing among populations. It primarily contains three aspects. Firstly, the behavior of the sub-population covering corresponding target path is improved, so that it can continue to try to cover other sub-paths after covering the current target path, so as to take full advantage of population resources; Secondly, the populations initialized are prioritized according to the matching process, so that those sub-populations with better path coverage rate are executed firstly. Thirdly, for difficultly-covered paths, the individual chromosome features which can cover the difficultly-covered paths are extracted by utilizing the data generated, so as to screen those individuals who can cover the difficultly-covered paths. In the experiments, several benchmark programs were employed to verify the accuracy of the method from different aspects and also compare with similar methods. The experimental results show that it takes less time to cover target paths by our approach than the similar ones, and achieves more efficient test case generation process. Finally, a plug-in prototype is given to implement the approach proposed.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.9-12
• /
• 2000

Genetic algorithm is a searching method which based on the law of the survival of the fittest. Multi-population Genetic Algorithm is a modified form of Genetic Algorithm, which was devised for covering the defect of general genetic algorithm. The core of multi-population genetic algorithm is said to be the migration schemes. The fitness-based migration scheme and the random migration scheme are currently used. In this paper, a new migration scheme, ‘the migration scheme between groups’, is suggested, and compared to the general two migration schemes.

• Proceedings of the IEEK Conference
• /
• 2000.06e
• /
• pp.55-58
• /
• 2000

Previous works using a Multi-population Genetic Algorithm have divided chromosome into two components, rule sets and membership functions. However, in this case bad rule sets disturb optimization in good rule sets and membership functions. A new method for a Multi-population Genetic Algorithm suggests three components, good rule sets, bad rule sets, and membership functions. To show the effectiveness of this method, fuzzy controller is applied in a Truck Backing Problem. Results of the computer simulation show good adaptation of the proposed method for a Multi-population Genetic Algorithm.

• 대한예방의학회:학술대회논문집
• /
• 2003.04a
• /
• pp.30-37
• /
• 2003

o Cohort study became the major approach to study of chronic diseases such as CVD and cancer o Cohort can be population-based or volunteer-based o Types of be population-be categorized by source population and selection mechanism o More and more cohort studies involve biological specimens, such as blood, urine, toenail, cheek cells, etc. o Multi-center and multi-national collaboration is an effective way to increase sample size. o Current statistical method typically use time-to-event analysis by Cox proportional hazard model.

• Korea journal of population studies
• /
• v.14 no.2
• /
• pp.71-77
• /
• 1991

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.324-333
• /
• 2013

The purpose of this paper is to improve the efficiency of multi-objective topology optimization using a genetic algorithm (GA) with bar-system representation. We proposed a new GA using an elite initial population obtained from a Solid Isotropic Material with Penalization (SIMP) using a weighted sum method. SIMP with a weighted sum method is one of the most established methods using sensitivity analysis. Although the implementation of the SIMP method is straightforward and computationally effective, it may be difficult to find a complete Pareto-optimal set in a multi-objective optimization problem. In this study, to build a more convergent and diverse global Pareto-optimal set and reduce the GA computational cost, some individuals, with similar topology to the local optimum solution obtained from the SIMP using the weighted sum method, were introduced for the initial population of the GA. The proposed method was applied to a structural topology optimization example and the results of the proposed method were compared with those of the traditional method using standard random initialization for the initial population of the GA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.549-550
• /
• 2021

This paper, we propose a multi-population differential evolutionary algorithm using MUDE (Uniform Local Search) to recognize various mutation strategies. In MUDE, a population is divided into several subpopulations with different population sizes that perform different mutation strategies according to evolutionary ratios (DE/rand/1 and DE/current-to-rand/1). To improve population diversity, information is migrated between subpopulations by a soft island model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.335-352
• /
• 2023

When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

• Communications for Statistical Applications and Methods
• /
• v.16 no.1
• /
• pp.169-183
• /
• 2009

The simplicity and wide application of Greenberg et al. (1971) prompts to propose a set of alternative estimators of population total for multi-character surveys that elicit simultaneous information on many. sensitive study variables. The proposed estimators take into account the already known rough value of the correlation coefficient between Y(the characteristic under study) and p(the measure of size). These estimators are biased, but it is expected that the extent of bias will be smaller, since the proposed estimators are suitable for situations in between those optimum for the usual estimators and the estimators based on multi-characters for no correlation. The relative efficiency of the proposed estimators has been studied under a super population model through empirical study. It has been found through simulation study that a choice of an unrelated variable in the Greenberg et al. (1971) model could be made based on its correlation with the auxiliary variable used at estimation stage in multi-character surveys.