• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.134-137
• /
• 2000

Genetic algorithms(GAs) have been widely used as a method to solve optimization problems. This is because GAs have simple and elegant tools with reproduction, crossover, and mutation to rapidly discover good solutions for difficult high-dimensional problems. They, however, do not guarantee the convergence of global optima in GA-hard problems such as deceptive problems. Therefore we proposed a Schema Co-Evolutionary Algorithm(SCEA) and derived extended schema 76988theorem from it. Using co-evolution between the first population made up of the candidates of solution and the second population consisting of a set of schemata, the SCEA works better and converges on global optima more rapidly than GAs. In this paper, we show advantages and efficiency of the SCEA by applying it to some problems.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.111-114
• /
• 1997

Usually, Evolutionary Algorithms are considered more efficient for optimal system design, However, the performance of the system is determined by fitness function and system environment. In this paper, in order to overcome the limitation of the performance by this factor, we propose a co-evolutionary method that two populations constantly interact and coevolve. In this paper, we apply coevolution to neural network's evolving. So, one population is composed of the structure of neural networks and other population is composed of training patterns. The structure of neural networks evolve to optimal structure and, at the same time, training patterns coevolve to feature patterns. This method prevent the system from the limitation of the performance by random design of neural network structure and inadequate selection of training patterns. In this time neural networks are trained by evolution strategies that are able to apply to the unsupervised learning. And in the coding of neural networks, we propose the method to maintain nonredundancy and character preservingness that are essential factor of genetic coding. We show the validity and the effectiveness of the proposed scheme by applying it to the visual servoing of RV-M2 robot manipulators.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.169.4-169
• /
• 2001

Conventional methods to solve the nonlinear programming problem range from augmented Lagrangian methods to sequential quadratic programming (SQP) methods. NPSOL, which is a SQP code, has been widely used to solve various optimization problems but is still subject to many numerical problems such as convergence to local optima, difficulties in initialization and in handling non-smooth cost functions. Recently, many evolutionary methods have been developed for constrained optimization. Among them, CEALM (Co-Evolutionary Augmented Lagrangian Method) shows excellent performance in the following aspects: global optimization capability, low sensitivity to the initial parameter guessing, and excellent constraint handling capability due to the benefit of the augmented Lagrangian function. This algorithm is ...

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.93.3-93
• /
• 2002

$\textbullet$ Co-evolutionary algorithms $\textbullet$ Nash Genetic Algorithms $\textbullet$ Multi-objective Optimization $\textbullet$ Distance dependent mutation $\textbullet$ Pareto Optimality

• 한국미생물생명공학회:학술대회논문집
• /
• 한국미생물생명공학회 2005년도 2005 Annual Meeting & International Symposium
• /
• pp.137-138
• /
• 2005

• International Journal of Automotive Technology
• /
• 제7권7호
• /
• pp.795-801
• /
• 2006

A No Spin Differential (NSD) design has been improved from evaluation of two NSD models utilizing the axiomatic approach. New design parameters of the second level are developed to satisfy the independence axiom. The design matrices are determined to decouple the relationship between design parameters and process parameters. The values of process parameters are then determined to optimize and improve the NSD design. Consequently a unique and evolutionary NSD design is achieved with the aid of the axiomatic approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1998년도 제13차 학술회의논문집
• /
• pp.507-512
• /
• 1998

It is an interesting area in the field of artificial intelligence to and an analytic model of cooperative structure for multi-agent system accomplishing a given task. Usually it is difficult to design controllers for multi-agent systems without a comprehensive knowledge about the system. One of the way to overcome this limitation is to implement an evolutionary approach to design the controllers. This paper introduces the use of a genetic algorithm to discover a fuzzy logic controller with rules that govern emergent co-operative behavior: A modified genetic algorithm was applied to automating the discovery of a fuzzy logic controller jot multi-agents playing a pursuit game. Simulation results indicate that, given the complexity of the problem, an evolutionary approach to and the fuzzy logic controller seems to be promising.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.395-398
• /
• 2002

본 논문에서는 ‘다목적 함수 최적화 문제(Multi-objective Optimization Problem MOP)’를 풀기 위하여 유전자 알고리즘을 진화적 게임 이론 적용시킨 ‘내쉬 유전자 알고리즘(Nash GA)’과 본 논문에서 새로이 제안하는 공진화 알고리즘의 구조를 설명하고 이 두 알고리즘의 결과를 시뮬레이션을 통하여 비교 검토함으로써 ‘진화적 게임 이론(Evolutionary Game Theory : EGT)’의 두 가지 아이디어 -‘내쉬의 균형(Equilibrium)’과 ‘진화적 안정전략(Evolutionary Stable Strategy . ESS)’-에 기반한 최적화 알고리즘들이 다목적 함수 문제의 최적해를 탐색할 수 있음을 확인한다.

• Journal of Electrical Engineering and Technology
• /
• 제9권2호
• /
• pp.471-477
• /
• 2014

The novel permanent magnetic actuator (PMA) and its optimal design method were proposed in this paper. The proposed PMA is referred to as the separated permanent magnetic actuator (SPMA) and significantly superior in terms of its cost and performance level over a conventional PMA. The proposed optimal design method uses the evolutionary strategy algorithm (ESA), the kriging meta-model (KMM), and the multi-step optimization. The KMM can compensate the slow convergence of the ESA. The proposed multi-step optimization process, which separates the independent variables, can decrease time and increase the reliability for the optimal design result. Briefly, the optimization time and the poor reliability of the optimum are mitigated by the proposed optimization method.