• 제목/요약/키워드: Pareto solution

검색결과 128건 처리시간 0.02초

OPTIMIZATION OF THE TEST INTERVALS OF A NUCLEAR SAFETY SYSTEM BY GENETIC ALGORITHMS, SOLUTION CLUSTERING AND FUZZY PREFERENCE ASSIGNMENT

  • Zio, E.;Bazzo, R.
    • Nuclear Engineering and Technology
    • /
    • 제42권4호
    • /
    • pp.414-425
    • /
    • 2010
  • In this paper, a procedure is developed for identifying a number of representative solutions manageable for decision-making in a multiobjective optimization problem concerning the test intervals of the components of a safety system of a nuclear power plant. Pareto Front solutions are identified by a genetic algorithm and then clustered by subtractive clustering into "families". On the basis of the decision maker's preferences, each family is then synthetically represented by a "head of the family" solution. This is done by introducing a scoring system that ranks the solutions with respect to the different objectives: a fuzzy preference assignment is employed to this purpose. Level Diagrams are then used to represent, analyze and interpret the Pareto Fronts reduced to the head-of-the-family solutions.

Fuzzy Group Decision Making for Multiple Decision Maker-Multiple Objective Programming Problems

  • Yano, Hitoshi
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.380-383
    • /
    • 2003
  • In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

  • PDF

다목적함수 최적화를 위한 새로운 진화적 방법 연구 (A Study of New Evolutionary Approach for Multiobjective Optimization)

  • 심문보;서명원
    • 대한기계학회논문집A
    • /
    • 제26권6호
    • /
    • pp.987-992
    • /
    • 2002
  • In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.

지면효과를 고려한 WIG 선 익형의 공력특성 및 형상최적화 (Aerodynamic Characteristics and Shape Optimization of Airfoils in WIG Craft Considered Ground Effect)

  • 이주희;김병삼;박경우
    • 대한기계학회논문집B
    • /
    • 제30권11호
    • /
    • pp.1084-1092
    • /
    • 2006
  • Shape optimization of airfoil in WIG craft has been performed by considering the ground effect. The WIG craft should satisfy various aerodynamic characteristics such as lift, lift to drag ratio, and static height stability. However, they show a strong trade-off phenomenon so that it is difficult to satisfy aerodynamic properties simultaneously. Optimization is carried out through the multi-objective genetic algorithm. A multi-objective optimization means that each objective is considered separately instead of weighting. Due to the trade-off, pareto sets and non-dominated solutions can be obtained instead of the unique solution. NACA0015 airfoil is considered as a baseline model, shapes of airfoil are parameterized and rebuilt with four-Bezier curves. There are eighteen design variables and three objective functions. The range of design variables and their resolutions are two primary keys for the successful optimization. By two preliminary optimizations, the variation can be reduced effectively. After thirty evolutions, the non-dominated pareto individuals of twenty seven are obtained. Pareto sets are all the set of possible and excellent solution across the design space. At any selections of the pareto set, these are no better solutions in all design space.

Goal-Pareto 기반의 NSGA 최적화 알고리즘 (Goal-Pareto based NSGA Optimization Algorithm)

  • 박준수;박순규;신요안;유명식;이원철
    • 대한전자공학회논문지SP
    • /
    • 제44권2호
    • /
    • pp.108-115
    • /
    • 2007
  • 본 논문에서는 최적화 알고리즘의 속도를 향상시킬 수 있는 방안으로 설계자가 원하는 목적함수들의 수렴 범위를 Goal로 설정하여 최적화를 수행하는 GBNSGA(Goal-Pareto based Non-dominated Sorting Genetic Algorithm)를 제안한다. 많은 공학문제들은 하나의 목표치를 충족하는 해를 찾는 것이 아니라 다수 목적함수들을 충족하는 해를 찾는 것이 일반적이다 특히, 이러한 목적함수들은 서로 상충적인 관계를 갖는 경우가 대부분이기 때문에 모든 목적함수들을 만족하는 유일해를 찾는 것은 거의 불가능하다. 그 대안으로 일부 목적을 희생하며 설계에 부합되는 최적해를 찾는 파레토(Pareto) 방식의 최적화 알고리즘들에 대한 많은 연구가 진행되었다. 본 논문에서는 이러한 파레토 기반의 최적화 알고리즘들의 성능 향상을 도모하기 위하여 설계자의 목적을 파레토 할당에 반영하는 GBNSGA를 제안하고, 그 성능을 NSGA와 weighted-sum 접근 방식과의 비교를 통해 그 우수성을 검증하였다.

다층 중첩 및 매핑에 의한 구조적 설계 (A Structural Design of Multilevel Decomposition and Mapping)

  • 이정익
    • 한국생산제조학회지
    • /
    • 제22권1호
    • /
    • pp.100-106
    • /
    • 2013
  • This paper describes an integrated optimization design using multilevel decomposition technique on the base of the parametric distribution and independent axiom at the stages of lower level. Based on Pareto optimum solution, the detailed parameters at the lower level can be defined into the independent axiom. The suspension design is used as the simulation example.

DEA기반 순위결정 절차를 이용한 파레토 최적해의 우선순위 결정: 저수지군 연계 운영문제를 중심으로 (Ranking the Pareto-optimal Solutions using DEA-based Ranking Procedure: an Application to Multi-reservoir Operation Problem)

  • 전승목;김재희;김승권
    • 산업공학
    • /
    • 제21권1호
    • /
    • pp.75-84
    • /
    • 2008
  • It is a difficult task for decision makers(DMs) to choose an appropriate release plan which balances the conflicts between water storage and hydro-electric energy generation in a multi-reservoir operation problem. In this study, we proposed a DEA-based ranking procedure by which the DM can rank the potential alternatives and select the best solution among the Pareto-optimal solutions. The proposed procedure can resolve the problem of mix inefficiency that may cause errors in measuring the efficiency of alternatives. We applied the proposed procedure to the multi-reservoir operation problem for the Geum-River basin and could choose the best efficient solution from the Pareto-set which were generated by the Coordinated Multi-Reservoir Operating Model.

NSGA-II Technique for Multi-objective Generation Dispatch of Thermal Generators with Nonsmooth Fuel Cost Functions

  • Rajkumar, M.;Mahadevan, K.;Kannan, S.;Baskar, S.
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권2호
    • /
    • pp.423-432
    • /
    • 2014
  • Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

Clustering Parts Based on the Design and Manufacturing Similarities Using a Genetic Algorithm

  • Lee, Sung-Youl
    • 한국산업정보학회논문지
    • /
    • 제16권4호
    • /
    • pp.119-125
    • /
    • 2011
  • The part family (PF) formation in a cellular manufacturing has been a key issue for the successful implementation of Group Technology (GT). Basically, a part has two different attributes; i.e., design and manufacturing. The respective similarity in both attributes is often conflicting each other. However, the two attributes should be taken into account appropriately in order for the PF to maximize the benefits of the GT implementation. This paper proposes a clustering algorithm which considers the two attributes simultaneously based on pareto optimal theory. The similarity in each attribute can be represented as two individual objective functions. Then, the resulting two objective functions are properly combined into a pareto fitness function which assigns a single fitness value to each solution based on the two objective functions. A GA is used to find the pareto optimal set of solutions based on the fitness function. A set of hypothetical parts are grouped using the proposed system. The results show that the proposed system is very promising in clustering with multiple objectives.

Multi-Objective Optimal Design of a Single Phase AC Solenoid Actuator Used for Maximum Holding Force and Minimum Eddy Current Loss

  • Yoon, Hee-Sung;Eum, Young-Hwan;Zhang, Yanli;Koh, Chang-Seop
    • Journal of Electrical Engineering and Technology
    • /
    • 제3권2호
    • /
    • pp.218-223
    • /
    • 2008
  • A new Pareto-optimal design algorithm, requiring least computational work, is proposed for a single phase AC solenoid actuator with multi-design-objectives: maximizing holding force and minimizing eddy current loss simultaneously. In the algorithm, the design space is successively reduced by a suitable factor, as iteration repeats, with the center of pseudo-optimal point. At each iteration, the objective functions are approximated to a simple second-order response surface with the CCD sampling points generated within the reduced design space, and Pareto-optimal solutions are obtained by applying($1+{\lambda}$) evolution strategy with the fitness values of Pareto strength.