• Structural Engineering and Mechanics
• /
• 제45권2호
• /
• pp.211-232
• /
• 2013

In this study a multi-objective optimization problem is solved. The objectives used here include simultaneous minimum construction cost in term of sections weight, minimum structural damage using a damage index, and minimum non-structural damage in term of inter-story drift under the applied ground motions. A high-speed and low-error neural network is trained and employed in the process of optimization to estimate the results of non-linear time history analysis. This approach can be utilized for all steel or concrete frame structures. In this study, the optimal design of a planar eccentric braced steel frame is performed with great detail, using the presented multi-objective algorithm with a discrete population and then a moment resisting frame is solved as a supplementary example.

• 한국공간구조학회논문집
• /
• 제8권1호
• /
• pp.49-56
• /
• 2008

텐세그리티 구조물의 설계를 위한 다목적 최적화 기법이 제시되었다. 구조물의 기하가 먼저 주어지며, 설계변수는 부재력이다. 목적함수는 최대 강성매트릭스에 대한 최저 고유치와 찾고자 하는 목표값으로부터 가장 근접하게 일치하는 부재력이다. 복수의 목적함수 문제가 구속조건을 도입하여 일련의 단일 목적함수 문제로 전환되었다. 본 논문의 타당성을 알아보기 위해 텐세그리티 그리드에 대한 최적해를 구해 보았다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.513-524
• /
• 2006

The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.

• Nuclear Engineering and Technology
• /
• 제55권6호
• /
• pp.2125-2138
• /
• 2023

The printed circuit heat exchanger (PCHE) with airfoil fins has the benefits of high compactness, high efficiency and superior heat transfer performance. A novel multi-objective optimization approach is presented to design the airfoil fin PCHE in this paper. Three optimization design variables (the vertical number, the horizontal number and the staggered number) are obtained by means of dimensionless airfoil fin arrangement parameters. And the optimization objective is to maximize the Nusselt number (Nu) and minimize the Fanning friction factor (f). Firstly, in order to investigate the impact of design variables on the thermal-hydraulic performance, a parametric study via the design of experiments is proposed. Subsequently, the relationships between three optimization design variables and two objective functions (Nu and f) are characterized by an improved particle swarm optimization-backpropagation artificial neural network. Finally, a multi-objective optimization is used to construct the Pareto optimal front, in which the non-dominated sorting genetic algorithm II is used. The comprehensive performance is found to be the best when the airfoil fins are completely staggered arrangement. And the best compromise solution based on the TOPSIS method is identified as the optimal solution, which can achieve the requirement of high heat transfer performance and low flow resistance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.452-472
• /
• 2019

Most existing wavelet-based multiplicative watermarking methods are affected by geometric attacks to a certain extent. A serious limitation of wavelet-based multiplicative watermarking is its sensitivity to rotation, scaling, and translation. In this study, we propose an image watermarking method by using dual-tree complex wavelet transform with a multi-objective optimization approach. We embed the watermark information into an image region with a high entropy value via a multiplicative strategy. The major contribution of this work is that the trade-off between imperceptibility and robustness is simply solved by using the multi-objective optimization approach, which applies the watermark error probability and an image quality metric to establish a multi-objective optimization function. In this manner, the optimal embedding factor obtained by solving the multi-objective function effectively controls watermark strength. For watermark decoding, we adopt a maximum likelihood decision criterion. Finally, we evaluate the performance of the proposed method by conducting simulations on benchmark test images. Experiment results demonstrate the imperceptibility of the proposed method and its robustness against various attacks, including additive white Gaussian noise, JPEG compression, scaling, rotation, and combined attacks.

• Industrial Engineering and Management Systems
• /
• 제11권4호
• /
• pp.331-338
• /
• 2012

This research proposes a Pareto-based multi-objective optimization approach to class-based storage warehouse design, considering a two-block warehouse that operates under the class-based storage policy in a low-level, picker-to-part and narrow aisle warehousing system. A mathematical model is formulated to determine the number of aisles, the length of aisle and the partial length of each pick aisle to allocate to each product class that minimizes the travel distance and maximizes the usable storage space. A solution approach based on multiple objective particle swarm optimization is proposed to find the Pareto front of the problems. Numerical examples are given to show how to apply the proposed algorithm. The results from the examples show that the proposed algorithm can provide design alternatives to conflicting warehouse design decisions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3293-3311
• /
• 2015

Cloud services are required to be composed as a single service to fulfill the workflow applications. Service composition in Cloud raises new challenges caused by the diversity of users with different QoS requirements and vague preferences, as well as the development of cloud computing having geographically distributed characteristics. So the selection of the best service composition is a complex problem and it faces trade-off among various QoS criteria. In this paper, we propose a Cloud service composition approach based on evolutionary algorithms, i.e., NSGA-II and MOPSO. We utilize the combination of multi-objective evolutionary approaches and Decision-Making method (AHP) to solve Cloud service composition optimization problem. The weights generated from AHP are applied to the Crowding Distance calculations of the above two evolutionary algorithms. Our algorithm beats single-objective algorithms on the optimization ability. And compared with general multi-objective algorithms, it is able to precisely capture the users' preferences. The results of the simulation also show that our approach can achieve a better scalability.

• Geomechanics and Engineering
• /
• 제10권6호
• /
• pp.709-726
• /
• 2016

Corrugated-core sandwich panels are prevalent for many applications in industries. The researches performed with the aim of optimization of such structures in the literature have considered a deterministic approach. However, it is believed that deterministic optimum points may lead to high-risk designs instead of optimum ones. In this paper, an effort has been made to provide a reliable and robust design of corrugated-core sandwich structures through stochastic and probabilistic multi-objective optimization approach. The optimization is performed using a coupling between genetic algorithm (GA), Monte Carlo simulation (MCS) and finite element method (FEM). To this aim, Prob. Design module in ANSYS is employed and using a coupling between optimization codes in MATLAB and ANSYS, a connection has been made between numerical results and optimization process. Results in both cases of deterministic and probabilistic multi-objective optimizations are illustrated and compared together to gain a better understanding of the best sandwich panel design by taking into account reliability and robustness. Comparison of results with a similar deterministic optimization study demonstrated better reliability and robustness of optimum point of this study.

• 한국콘텐츠학회논문지
• /
• 제15권7호
• /
• pp.21-29
• /
• 2015

본 논문은 목적이 네 개 이상인 고도 다목적 문제(many-objective problem)에서의 의사 결정을 위한 새로운 이중(two-tier) 최적화 접근법을 제안한다. 목적의 개수가 증가할수록, 특히 네 개 이상부터는, 전체해(solution) 중에서 파레도 최적해(Parero-optimal solution)가 차지하는 비율이 기하급수적으로 증가한다. 그래서 일반 다목적 문제와는 달리, 의사 결정을 하는데 단순히 파레토 최적 해만을 찾는 것으로는 충분하지 않고, 찾은 파레토 최적 해들 중에서도 상대적으로 좀 더 선호하는 해들을 가려내는 것이 필요하다. 제안하는 접근법에서는 추가적인 최적화 단계를 추가함으로써 사용자의 선호도를 균형있게 반영하는 방향으로 파레토 최적해들을 찾는다. 이러한 2차 최적화는 관련된 2차 목적들을 수반하게 되는데, 2차 목적으로는 광역평가값과 혼잡 거리를 사용하였다. 광역평가값과 혼잡 거리는 각각 사용자의 선호도와 다양성을 대변하는 척도이다. 제안한 접근법의 우수성을 보이기 위해서는 잘 알려진 검증 함수들을 활용하는데, 같은 함수에 대해 제안한 접근법을 적용한 경우와 적용하지 않은 경우의 결과를 비교한다. 제안한 접근법을 적용함으로써 기존보다 사용자의 선호도를 잘 반영하면서 동시에 우수하고 다양한 의사 선택이 가능하다.

• 한국경영과학회지
• /
• 제40권3호
• /
• pp.49-61
• /
• 2015

We study the problem of multiple response optimization (MRO) and focus on the selection of input levels which will produce desirable output quality. We propose an interactive multiple objective optimization approach to the input design. The earlier interactive methods utilized for MRO communicate with the decision maker only using the response variable values, in order to improve the current response values, thereby resulting in the corresponding design solution automatically. In their interaction steps of preference articulation, no account is taken of any active changes in design variable values. On the contrary, our approach permits the decision maker to change the design variable values in its interaction stage, which makes possible the consideration of the preference or economics of the design variable side. Using some typical value functions, we also demonstrate that our method converges reasonably well to the known optimal solutions.