• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• pp.699-704
• /
• 2000

The present paper deals with a multiobjective optimization method based on the co-evolutionary genetic strategy. The co-evolutionary strategy carries out the multiobjective optimization in such way that it optimizes individual objective function as compared with each generation's value while there are more than two genetic evolutions at the same time. In this study, the designs that are out of the given constraint map compared with other objective function value are excepted by the penalty. The proposed multiobjective genetic algorithms are distinguished from other optimization methods because it seeks for the optimized value through the simultaneous search without the help of the single-objective values which have to be obtained in advance of the multiobjective designs. The proposed strategy easily applied to well-developed genetic algorithms since it doesn't need any further formulation for the multiobjective optimization. The paper describes the co-evolutionary strategy and compares design results on the simple structural optimization problem.

• 대한수학회논문집
• /
• 제28권3호
• /
• pp.597-602
• /
• 2013

In this paper, Mond-Weir type duality results for a uncertain multiobjective robust optimization problem are given under generalized invexity assumptions. Also, weak vector saddle-point theorems are obtained under convexity assumptions.

• 대한기계학회논문집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.

• Structural Engineering and Mechanics
• /
• 제6권1호
• /
• pp.17-30
• /
• 1998

The method of pairwise comparison inherently contains information of ambiguity, fuzziness and conflict in design goals for a multiobjective structural design. This paper applies the principle of paired comparison so that the vaguely formulated problem can be modified and a set of numerically acceptable weight would reflect the relatively important degree of multiple objectives. This paper also presents a fuzzy global criterion method ($FGCM_{\lambda}$) included fuzzy constraints that coupled with the objective weighting rank obtained from the modified pairwise comparisons for fuzzy multiobjective optimization problems. Descriptions in sequence of this combined method and problem solving experiences are given in the current article. Multiobjective design examples of truss and mechanical spring structures illustrate this optimization process containing the revising judgement techniques.

• 한국가스학회지
• /
• 제1권1호
• /
• pp.33-40
• /
• 1997

다극 및 다목적함수 최적화 문제를 해결하기 위해서 유전 알고리듬을 이용한 일반적인 최적화 도구인 APROGA II가 개발되었다. 우선 다극 최적화를 위해서는 다중선택집합탐색 알고리듬을 이용하였다. 두 번째로 다목적함수의 최적화를 위해서는 파레토 우성 토너먼트와 공유개념을 이용한 선택방법과 선택집합을 이용한 연속적인 세대교체법을 이용하여 새로운 알고리듬을 제안하였다. 이들 알고리듬을 이용하여 3개의 탐색엔진(APROGA 탐색엔진, 다극 탐색엔진 그리고 다목적함수 탐색엔진)을 가지고, 이진 및 이산 변수를 다룰 수 있는 APROGA II 시스템이 개발되었다. 그리고 여러 가지 검토함수들과 사례연구들을 적용시켜서 다극 탐색엔진의 성공적인 적용성을 확인하였다.

• 충청수학회지
• /
• 제30권1호
• /
• pp.31-40
• /
• 2017

In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.1353-1355
• /
• 2003

Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

• 한국지능시스템학회논문지
• /
• 제17권7호
• /
• pp.869-874
• /
• 2007

다목적 함수의 최적화 문제(Multiobjective optimization problems)의 경우에는 하나의 최적해가 존재하는 것이 아니라 '파레토 최적해 집합(Pareto optimal set)'이라고 알려진 해들의 집합이 존재한다. 이러한 이상적 파레토 최적해 집합과 가까운 최적해를 찾기 위한 다양한 해탐색 능력은 진화 알고리즘의 성능을 결정한다. 본 논문에서는 게임 모델에 기반한 공진화 알고리즘(GCEA: Game model based Co-Evolutionary Algorithm)에서 해집단의 다양성을 유지하여, 다양한 비지배적 파레토 대안해(non-dominated alternatives)들을 찾기 위한 방법을 제안한다.

• 한국유체기계학회 논문집
• /
• 제7권2호
• /
• pp.7-13
• /
• 2004

In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution agree well to the designer's weighting values, we proposed new multiobjective function which was the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach is effective for the case that the quality of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.

• 유체기계공업학회:학술대회논문집
• /
• 유체기계공업학회 2003년도 유체기계 연구개발 발표회 논문집
• /
• pp.397-403
• /
• 2003

In an attempt to solve multiobjective optimization problems, weighted sum method is most widely used for the advantage that a designer can consider the relative significance of each object functions by weight values but it can be highly sensitive to weight vector and occasionally yield a deviated optimum from the relative weighting values designer designated because the multiobjective function has the form of simple sum of the product of the weighting values and the object functions in traditional approach. To search the design solution well agree to the designer's weighting values, we proposed new multiobjective function which is the functional of each normalized objective functions and considered to find the design solution comparing the distance between the characteristic line and the ideal optimum. In this study, proposed multiobjective function was applied to design high efficiency and low noise axial flow fan and the result shows this approach will be effective for the case that the qualify of the design can be highly affected by the designer's subjectiveness represented as weighting values in multiobjective design optimization process.