• Title/Summary/Keyword: Pareto genetic Algorithm

Search Result 131, Processing Time 0.024 seconds

Optimization of Multi-objective Function based on The Game Theory and Co-Evolutionary Algorithm (게임 이론과 공진화 알고리즘에 기반한 다목적 함수의 최적화)

  • Sim, Kwee-Bo;Kim, Ji-Yoon;Lee, Dong-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.6
    • /
    • pp.491-496
    • /
    • 2002
  • Multi-objective Optimization Problems(MOPs) are occur more frequently than generally thought when we try to solve engineering problems. In the real world, the majority cases of optimization problems are the problems composed of several competitive objective functions. In this paper, we introduce the definition of MOPs and several approaches to solve these problems. In the introduction, established optimization algorithms based on the concept of Pareto optimal solution are introduced. And contrary these algorithms, we introduce theoretical backgrounds of Nash Genetic Algorithm(Nash GA) and Evolutionary Stable Strategy(ESS), which is the basis of Co-evolutionary algorithm proposed in this paper. In the next chapter, we introduce the definitions of MOPs and Pareto optimal solution. And the architecture of Nash GA and Co-evolutionary algorithm for solving MOPs are following. Finally from the experimental results we confirm that two algorithms based on Evolutionary Game Theory(EGT) which are Nash GA and Co-evolutionary algorithm can search optimal solutions of MOPs.

Pareto RBF network ensemble using multi-objective evolutionary computation

  • Kondo, Nobuhiko;Hatanaka, Toshiharu;Uosaki, Katsuji
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.925-930
    • /
    • 2005
  • In this paper, evolutionary multi-objective selection method of RBF networks structure is considered. The candidates of RBF network structure are encoded into the chromosomes in GAs. Then, they evolve toward Pareto-optimal front defined by several objective functions concerning with model accuracy and model complexity. An ensemble network constructed by such Pareto-optimal models is also considered in this paper. Some numerical simulation results indicate that the ensemble network is much robust for the case of existence of outliers or lack of data, than one selected in the sense of information criteria.

  • PDF

A NOVEL METHOD FOR REFINING A META-MODEL BY PARETO FRONTIER (파레토 프론티어를 이용한 메타모델 정예화 기법 개발)

  • Jo, S.J.;Chae, S.H.;Yee, K.J.
    • Journal of computational fluids engineering
    • /
    • v.14 no.4
    • /
    • pp.31-40
    • /
    • 2009
  • Although optimization by sequentially refining metamodels is known to be computationally very efficient, the metamodel that can be used for this purpose is limited to Kriging method due to the difficulties related with sample points selections. The present study suggests a novel method for sequentially refining metamodels using Pareto Frontiers, which can be used independent of the type of metamodels. It is shown from the examples that the present method yields more accurate metamodels compared with full-factorial optimization and also guarantees global optimum irrespective of the initial conditions. Finally, in order to prove the generality of the present method, it is applied to a 2D transonic airfoil optimization problem, and the successful design results are obtained.

Machine load prediction for selecting machines in machining (절삭가공에서의 기계선정을 위한 기계부하 예측)

  • Choi H.R.;Kim J.K.;Rho H.M.;Lee H.C.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.997-1000
    • /
    • 2005
  • Dynamic job shop environment requires not only more flexible capabilities of a CAPP system but higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations to be performed by predicting the machine loads. The developed algorithm is based on the multiple objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as Pareto-optimal solutions). The objective shows a combination of the minimization of part movement and the maximization of machine utility balance. The algorithm is characterized by a new and efficient method for nondominated sorting, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II.

  • PDF

Co-Evolution Algorithm for Solving Multi-Objective Optimization Problem

  • Kim, Ji-Youn;Lee, Dong-Wook;Sim, Kwee-Bo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.93.3-93
    • /
    • 2002
  • $\textbullet$ Co-evolutionary algorithms $\textbullet$ Nash Genetic Algorithms $\textbullet$ Multi-objective Optimization $\textbullet$ Distance dependent mutation $\textbullet$ Pareto Optimality

  • PDF

Layout Optimization of FPSO Topside High Pressure Equipment Considering Fire Accidents with Wind Direction (풍향에 따른 화재영향을 고려한 FPSO 상부구조물 고압가스 모듈내부의 장비 최적배치 연구)

  • Bae, Jeong-Hoon;Jeong, Yeon-Uk;Shin, Sung-Chul;Kim, Soo-Young
    • Journal of Ocean Engineering and Technology
    • /
    • v.28 no.5
    • /
    • pp.404-410
    • /
    • 2014
  • The purpose of this study was to find the optimal arrangement of FPSO equipment in a module while considering the economic value and fire risk. We estimated the economic value using the pipe connections and pump installation cost in an HP (high pressure) gas compression module. The equipment risks were also analyzed using fire scenarios based on historical data. To consider the wind effect during a fire accident, fuzzy modeling was applied to improve the accuracy of the analysis. The objective functions consisted of the economic value and fire risk, and the constraints were the equipment maintenance and weight balance of the module. We generated a Pareto-optimal front group using a multi-objective GA (genetic algorithm) and suggested an equipment arrangement method that included the opinions of the designer.

Design Parameter Optimization of Liquid Rocket Engine Using Generic Algorithms (유전알고리즘을 이용한 액체로켓엔진 설계변수 최적화)

  • Lee, Sang-Bok;Kim, Young-Ho;Roh, Tae-Seoung
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2011.11a
    • /
    • pp.127-134
    • /
    • 2011
  • A genetic algorithm (GA) has been employed to optimize the major design variables of the liquid rocket engine. Pressure of the main combustion chamber, nozzle expansion ratio and O/F ratio have been selected as design variables. The target engine has the open gas generator cycle using the LO2/RP-1 propellant. The gas properties of the combustion chamber have been obtained from CEA2 and the mass has been estimated using reference data. The objective function has been set as multi-objective function with the specific impulse and thrust to weight ratio using the weight method. The result shows about 4% improvement of the specific impulse and 23% increase of the thrust to weight ratio. The Pareto frontier line has been also obtained for various thrust requirements.

  • PDF

Managing Approximation Models in Multidisciplinary Optimization (다분야 최적화에서의 근사모델 관리기법의 활용)

  • 양영순;정현승;연윤석
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.10a
    • /
    • pp.141-148
    • /
    • 2000
  • In system design, it is not always possible that all decision makers can cooperate fully and thus avoid conflict. They each control a specified subset of design variables and seek to minimize their own cost functions subject to their individual constraints. However, a system management team makes every effort to coordinate multiple disciplines and overcome such noncooperative environment. Although full cooperation is difficult to achieve, noncooperation also should be avoided as possible. Our approach is to predict the results of their cooperation and generate approximate Pareto set for their multiple objectives. The Pareto set can be obtained according to the degree of one's conceding coupling variables in the other's favor. We employ approximation concept for modelling this coordination and the mutiobjective genetic algorithm for exploring the coupling variable space for obtaining an approximate Pareto set. The approximation management concept is also used for improving the accuracy of the Pareto set. The exploration for the coupling variable space is more efficient because of its smaller dimension than the design variable space. Also, our approach doesn't force the disciplines to change their own way of running analysis and synthesis tools. Since the decision making process is not sequential, the required time can be reduced comparing to the existing multidisciplinary optimization techniques. This approach is applied to some mathematical examples and structural optimization problems.

  • PDF

Design of RFID Passive Tag Antennas in UHF Band (UHF 대역 수동형 RFID 태그 안테나 설계)

  • Cho Chihyun;Choo Hosung;Park Ikmo;Kim Youngkil
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.9 s.100
    • /
    • pp.872-882
    • /
    • 2005
  • In this paper, we examined the operating principle of a passive tag antenna for RFID system in UHF band. Based on the study, we proposed a novel RFID tag antenna which adopts the inductively coupled feeding structure to match antenna impedance to a capacitively loaded commercial tag chip. The proposed tag antenna consists of microstrip lines on a thin PET substrate for low-cost fabrication. The detail structure of the tag antenna were optimized using a full electromagnetic wave simulator of IE3D in conjunction with a Pareto genetic algorithm and the size of the tag antenna can be reduced up to kr=0.27($2 cm^2$). We built some sample antennas and measured the antenna characteristics such as a return loss, an efficiency, and radiation patterns. The readable range of the tag antenna with a commercial RFID system showed about 1 to 3 m.

Automatic Calibration of Rainfall-runoff Model Using Multi-objective Function (다중목적함수를 이용한 강우-유출 모형의 자동보정)

  • Lee, Kil-Seong;Kim, Sang-Ug;Hong, Il-Pyo
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.10 s.159
    • /
    • pp.861-869
    • /
    • 2005
  • A rainfall-runoff model should be calibrated so that the model simulates the hydrological behavior of the basin as accurately as possible. In this study, to calibrate the five parameters of the SSARR model, a multi-objective function and the genetic algorithm were used. The solution of the multi-objective function will not, in general, be a single unique set of parameters but will consist of the so-called Pareto solution according to various trade-offs between the different objectives. The calibration strategy using multi-objective function could decrease calibrating time and effort. From the Pareto solution, a single solution could be selected to simulate a specific flow condition.