• 한국통신학회논문지
• /
• 제32권11A호
• /
• pp.1079-1085
• /
• 2007

NSGA (Non-dominated Sorting Algorithm) 는 다목적 최적화 분야에서 널리 사용되고 있는 비지배 정렬 기반의 유전자 알고리즘으로 최적화를 요구하는 분야에서 널리 사용되고 있다. 하지만 연산의 복잡도, 사전 우수해 선별 조건의 미흡함과 공유 변수값 결정의 어려움등이 문제로 제기 되었고, 이러한 단점을 보완한 NSGA-II(Non-dominated Sorting Algorithm-B) 알고리즘이 제안되었다. 그러나 기존의 NSGA-II알고리즘은 다목적 최적화 알고리즘과 동일하게 목적치를 최대화 또는 최소화시키는 방향으로 최적화가 진행되어 선택적인 최적화 수행이 어렵다. 이러한 문제점을 보완하기 위하여 본 논문에서는 NSGA-II알고리즘이 가지는 장점을 바탕으로 설계자의 요구조건에 종속적으로 최적화 과정을 수행할 수 있는 GBNSGA-II (Goal-pareto Based NSGA-II)를 제안하고 기존의 NSGA-II알고리즘과 비교를 통해 성능의 우수성을 검증하였다.

• Steel and Composite Structures
• /
• 제14권4호
• /
• pp.397-408
• /
• 2013

This paper deals with multiobjective optimization of symmetrically laminated composite truncated circular conical shells subjected to external uniform pressure load and thermal load. The design objective is the maximization of the weighted sum of the critical buckling load and fundamental frequency. The design variable is the fibre orientations in the layers. The performance index is formulated as the weighted sum of individual objectives in order to obtain optimal solutions of the design problem. The first-order shear deformation theory (FSDT) is used in the mathematical formulation of laminated truncated conical shells. Finally, the effect of different weighting factors, length-to-radius ratio, semi-cone angle and boundary conditions on the optimal design is investigated and the results are compared.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• Steel and Composite Structures
• /
• 제51권6호
• /
• pp.647-659
• /
• 2024

Given the increased interest in enhancing structural sustainability, the current study sought to apply multiobjective optimization to a footbridge with a steel-concrete composite I-girder structure. It was considered as objectives minimizing the cost for building the structure, the environmental impact assessed by CO2 emissions, and the vertical accelerations created by human-induced vibrations, with the goal of ensuring pedestrian comfort. Spans ranging from 15 to 25 meters were investigated. The resistance of the slab's concrete, the thickness of the slab, the dimensions of the welded steel I-profile, and the composite beam interaction degree were all evaluated as design variables. The optimization problem was handled using the Multiobjective Harmony Search (MOHS) metaheuristic algorithm. The optimization results were used to generate a Pareto front for each span, allowing us to assess the correlations between different objectives. By evaluating the values of design variables in relation to different levels of pedestrian comfort, it was identified optimal values that can be employed as a starting point in predimensioning of the type of structure analyzed. Based on the findings analysis, it is possible to highlight the relationship between the structure's cost and CO2 emission objectives, indicating that cost-effective solutions are also environmentally efficient. Pedestrian comfort improvement is especially feasible in smaller spans and from a medium to a maximum level of comfort, but it becomes expensive for larger spans or for increasing comfort from minimum to medium level.

• 한국구조물진단유지관리공학회 논문집
• /
• 제24권3호
• /
• pp.26-38
• /
• 2020

자기 충전형 콘크리트의 배합물 설계는 전형적인 다기준의사결정의 과정이다. 본 연구에서는 실험설계법과 반응표면법을 이용하여 SCC 배합물 전산 설계가 가능하도록 재료성능 및 비용모델을 생성하고, 요구조건을 반영한 여러 성능 사이의 상대적 중요도를 산정하여 가중 다목적 설계문제로 정식화하여 수치최적해를 계산함으로써 비용효율을 고려한 SCC최적설계를 수행하였다. 실험비용과 시간을 고려하여 SCC의 수많은 요구성능 중 압축강도, 철근충전성, 재료분리저항성, 비용정보 등을 다목적 최적화의 목적함수로 설정하였다. 재료경제성을 최적재료설계프로세스에 합리적으로 반영함으로써 경제적 콘크리트배합설계를 수행할 수 있었으며, 본 연구 결과 실험점 계획에서부터 최적해 산출에 이르는 과정을 객관적인 프로세스로 구성함으로써 콘크리트 범용 최적재료설계기술 및 전산화를 기대할 수 있다.

• 대한기계학회논문집A
• /
• 제27권1호
• /
• pp.144-151
• /
• 2003

In this paper, an optimum design problem for endosseous implant in dentistry is studied to find best implant design. An optimum design problem is formulated to reduce stresses arising at the cortical as well as cancellous bones, in which sufficient design parameters are chosen fur design definition that encompasses major implants in popular use. Optimization at once (OAO) with the large number of design variables, however, causes too costly solution or even failure to converge. A concept of multilevel optimization (MLO) is employed to this end, which is to group the design variables of similar nature, solve the sub-problem of smaller size fur each group in sequence, and this is iterated until convergence. Each sub-problem is solved based on the response surface method (RSM) due to its efficiency for small sized problem. Favorable solution is obtained by the MLO, which is compared to both solutions made by RSM and sequential quadratic programming (SQP) in the OAO problem.

• International Journal of Control, Automation, and Systems
• /
• 제2권2호
• /
• pp.247-255
• /
• 2004

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

• 대한기계학회논문집A
• /
• 제21권1호
• /
• pp.112-123
• /
• 1997

The optimization techniques have been applied to versatile engineering problems for reducing manufacturing cost and for automatic design. The deterministic approaches or op5imization neglect the effects on uncertainties of design variables. The uncertainties include variation or perturbation such as tolerance band. The optimum may be useless when the constraints considering worst cases of design variables can not be satisfied, which results from constraint variation. The variation of design variables can also give rise to drastic change of performances. The two issues are related to constraint feasibility and insensitive performance. Robust design suggested in the present study is developed to gain an optimum insensitive to variation on design variables within feasible region. The multiobjective function is composed to the mean and the standard deviation of original objective function, while the constraints are supplemented by adding penalty term to original constraints. This method has a advantage that the second derivatives of the constraints are not required. A mathematical problem and several standard problems for structural optimization are solved to check out the usefulness of the suggested method.

• 전자공학회논문지CI
• /
• 제39권4호
• /
• pp.10-18
• /
• 2002

통신망 설계는 다양한 설계 인자들이 고려되는 다목적 함수 문제이다. 특히 망의 구성 비용, 메시지 지연 그리고 신뢰도는 망의 최대 효율을 얻는데 중요한 설계 인자이다. 최근 들어 유전자 알고리즘은 조합최적화 문제, 통신망 설계문제와 같은 현실적 문제를 위한 최적화 기법으로 널리 활용되어 지고 있다. 본 논문은 망의 구성비용과 메시지 지연시간을 최소화 하는 통신망 설계를 위한 다목적 유전 알고리즘을 제시한다. 본 알고리즘은 다목적 함수의 최적화에서 일반적으로 어려운 목적 함수간의 최적화를 위해 파레토를 이용하였다. 부호화 방법으로 프뤼퍼 숫자와 클러스터링 문자를 사용했고, 적합도 배분방법으로 파레토 순위할당 제거방법과 생태적 적소형태(niche-formation)방법을 사용하였으며, 조기수렴을 방지위해 변형된 엘리트 기법을 사용했다. 시뮬레이션을 통해 제안하는 알고리즘이 망구성의 후보해를 효과적으로 찾음을 보여준다.

• 대한기계학회논문집A
• /
• 제34권7호
• /
• pp.813-820
• /
• 2010

포틀랜드 시멘트용 분쇄기는 독일과 일본 등 선진국에서 도입된 고가의 대형 기계이다. 따라서 이에 대한 체계적 정비 및 보수가 원활히 진행되어야 포틀랜드 시멘트의 생산설비에 대한 안정성을 확보할 수 있다. 한편 국내에 도입된 수직형 롤러 분쇄기는 포틀랜드 시멘트의 원료인 석회석의 시간당 생산량이 5.5MN이나 되는 세계 최대 규모의 분쇄기로서 설계 수명이 $4{\times}10^{7%}$사이클 정도이나 대략 $4{\times}10^6\;{\sim}\;8{\times}10^6$ 사이클 정도에서 파괴되고 있어 계획 예방 정비에 대한 어려움이 있으며, 수직형 롤러 분쇄기의 보수비용을 절감하기 위하여 롤러 분쇄기에 대한 효과적인 재설계가 필요한 실정이다. 따라서 본 연구에서는 확률론적인 절차가 내재되어 있어 불확실성을 다룰 수 있고, 대량의 복잡한 비선형적인 관계도 단순화의 과정 없이 연관 관계를 자체 조직화할 수 있는 인간의 뇌와 가장 유사한 병렬연산모델인 신경회로망을 수직형 롤러 분쇄기에 적용하여 최적설계를 수행하였다.