• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.203-211
• /
• 2022

Multi-objective optimization problems (MOPs) arise in many real-world applications. MOPs involve two or more objectives with the aim to be optimized. With these problems improvement of one objective may led to deterioration of another. The primary goal of most multi-objective evolutionary algorithms (MOEA) is to generate a set of solutions for approximating the whole or part of the Pareto optimal front, which could provide decision makers a good insight to the problem. Over the last decades or so, several different and remarkable multi-objective evolutionary algorithms, have been developed with successful applications. However, MOEAs are still in their infancy. The objective of this research is to study how to use and apply machine learning (ML) to improve evolutionary multi-objective optimization (EMO). The EMO method is the multi-objective evolutionary algorithm based on decomposition (MOEA/D). The MOEA/D has become one of the most widely used algorithmic frameworks in the area of multi-objective evolutionary computation and won has won an international algorithm contest.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.1-9
• /
• 2011

This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.20-27
• /
• 2004

A flexible assembly system (FAS) is a production system that assembles various parts with many constraints and manufacturing flexibilities. This paper presents a new method for efficiently solving the integrated process planning and scheduling in FAS. The two problems of FAS process planning and scheduling are tightly related with each other. However, in almost all the existing researches on FAS, the two problems have been considered separately. In this research, an endosymbiotic evolutionary algorithm is adopted as methodology in order to solve the two problems simultaneously. This paper shows how to apply an endosymbiotic evolutionary algorithm to solving the integrated problem. Some evolutionary schemes are used in the algorithm to promote population diversity and search efficiency. The experimental results are reported.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.930-935
• /
• 2002

This paper presents a new method that can efficiently solve the integrated problem of line balancing and model sequencing in mixed-model U-lines (MMULs). Balancing and sequencing problem are important for an efficient use of MMULs and are tightly related with each other. However, in almost all the existing researches on mixed­model production lines, the two problems have been considered separately. In 1his research, an endosymbiotic evolutionary algorithm, which is a kind of evolutionary algorithm, is adopted as a methodology in order to solve the two problems simultaneously. Some evolutionary search capability, rapidity of convergence and population diversity. The proposed algorithm is compared with the existing evolutionary algorithm in terms of solution quality. The experimental results confirm the effectiveness of our approach.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.1
• /
• pp.95-110
• /
• 1998

Evolutionary Algorithms (EAs) are population-based optimization methods based on the principle of Darwinian natural selection. The representative methodology in EAs is genetic algorithm (GA) proposed by J. H. Holland, and the theoretical foundations of GA are the Schema Theorem and the Building Block Hypothesis. In the meaning of these foundational concepts, simple genetic algorithm (SGA) allocate more trials to the schemata whose average fitness remains above average. Although SGA does well in many applications as an optimization method, still it does not guarantee the convergence of a global optimum in GA-hard problems and deceptive problems. Therefore as an alternative scheme, there is a growing interest in a co-evolutionary system, where two populations constantly interact and co-evolve in contrast with traditional single population evolutionary algorithm. In this paper we show why the co-evolutionary algorithm works better than SGA in terms of an extended schema theorem. And predator-prey co-evolution and symbiotic co-evolution, typical approaching methods to co-evolution, are reviewed, and dynamic fitness landscape associated with co-evolution is explained. And the experimental results show a co-evolutionary algorithm works well in optimization problems even though in deceptive functions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.110.2-110
• /
• 2002

Evolutionary Algorithm is the general method that can search the optimum value for the various problems. Evolutionary method consists of random selection, crossover, mutation, etc. Since the next generation is selected based on the fitness values, the crossover between chromosomes does not have any restrictions. Not only normal marriage but also consanguineous marriage will take place. In human world, consanguineous marriage was reported to cause various genetic defects, such as poor immunity about new diseases and new environment disaster, These problems translate into searching for the local optimum, not the global optimum. So, a new evolutionary algorithm is needed that prevents traps to...

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.656-657
• /
• 2015

Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.9
• /
• pp.365-375
• /
• 2006

This paper is presented by the application of parallel adaptive evolutionary algorithm(PAEA) to search an optimal solution of a thermal unit commitment problem. The adaptive evolutionary algorithm(AEA) takes the merits of both a genetic algorithm(GA) and an evolution strategy(ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. To reduce the execution time of AEA, the developed algorithm is implemented on an parallel computer which is composed of 16 processors. To handle the constraints efficiently and to apply to Parallel adaptive evolutionary algorithm(PAEA), the states of thermal unit are represented by means of real-valued strings that display continuous terms of on/off state of generating units and are involved in their minimum up and down time constraints. And the violation of other constraints are handled by repairing operator. The procedure is applied to the $10{\sim}100$ thermal unit systems, and the results show capabilities of the PAEA.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.9
• /
• pp.755-762
• /
• 2004

In this research, EOG(Electrooculogram) signal was analyzed to predict the subject's intention using a fuzzy classifier. The fuzzy classifier is built automatically using the EOG data and evolutionary algorithms. An assistant robot manipulator in redundant configuration has been developed, which operates according to the EOG signal classification results. For automatic fuzzy model construction without any experts' knowledge, an evolutionary algorithm with the new representation scheme, design of adequate fitness function and evolutionary operators, is proposed. The proposed evolutionary algorithm can optimize the number of fuzzy rules, the number of fuzzy membership functions, parameter values for the each membership functions, and parameter values for the consequent parts. It is shown that the fuzzy classifier built by the proposed algorithm can classify the EOG data efficiently. Intelligent motion planner that consists of several neural networks are used for control of robot manipulator based upon EOG classification results.