• Structural Engineering and Mechanics
• /
• v.75 no.4
• /
• pp.445-454
• /
• 2020

Structural damage identification (SDI) is a crucial step in structural health monitoring. However, some of the existing SDI methods cannot provide enough identification accuracy and efficiency in practice. A novel whale optimization algorithm (WOA) based method is proposed for SDI by weighting modal data and flexibility assurance criterion in this study. At first, the SDI problem is mathematically converted into a constrained optimization problem. Unlike traditional objective function defined using frequencies and mode shapes, a new objective function on the SDI problem is formulated by weighting both modal data and flexibility assurance criterion. Then, the WOA method, due to its good performance of fast convergence and global searching ability, is adopted to provide an accurate solution to the SDI problem, different predator mechanisms are formulated and their probability thresholds are selected. Finally, the performance of the proposed method is assessed by numerical simulations on a simply-supported beam and a 31-bar truss structures. For the given multiple structural damage conditions under environmental noises, the WOA-based SDI method can effectively locate structural damages and accurately estimate severities of damages. Compared with other optimization methods, such as particle swarm optimization and dragonfly algorithm, the proposed WOA-based method outperforms in accuracy and efficiency, which can provide a more effective and potential tool for the SDI problem.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.7 no.8
• /
• pp.224-232
• /
• 1999

Topology optimization has evolved into a very efficient concept design tool and has been incorporated into design engineering processes in many industrial sectors. In recent years, topology optimization has become the focus of structural design community and has been researched and applied widely both in academia and industry. There are mainly tow approaches for topology optimization of continuum structures ; homogenization and density methods. The homogenization method is to compute is to compute an optimal distribution of microstructures in a given design domain. The sizes of the micro-calvities are treated as design variables for the topology optimization problem. the density method is to compute an optimal distribution of an isotropic material, where the material densities are treated as design variables. In this paper, the density method is used to formulate the topology optimization problem. This optimization problem is solved by using an optimality criteria method. Several example problems are solved to show the usefulness of the present approach.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.283-290
• /
• 2008

This paper is motivated by the problem of fitting a group of cuboids into a simplified rotating vessel of the artificial satellite. Here we introduce a combinatorial optimization model which reduces the three-dimensional layout problem with behavioral constraints to a finite enumeration scheme. Moreover, a global combinatorial optimization algorithm is described in detail, which is an improved graph-theoretic heuristic.

• East Asian mathematical journal
• /
• v.33 no.3
• /
• pp.265-269
• /
• 2017

In this paper, we formulate a sufficient optimality theorem for the robust optimization problem (UP) under (V, ${\rho}$)-invexity assumption. Moreover, we formulate a Mond-Weir type dual problem for the robust optimization problem (UP) and show that the weak and strong duality hold between the primal problems and the dual problems.

• Journal of Mechanical Science and Technology
• /
• v.20 no.10
• /
• pp.1557-1566
• /
• 2006

We present a procedure for the application of global orthogonal polynomial into an atmospheric re-entry maneuvering problem. This trajectory optimization is imbedded in a family of canonically parameterized optimal control problem. The optimal control problem is transcribed to nonlinear programming via global orthogonal polynomial and is solved a sparse nonlinear optimization algorithm. We analyze the optimal trajectories with respect to the performance of re-entry maneuver.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• 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.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.65-76
• /
• 2009

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

• Management Science and Financial Engineering
• /
• v.21 no.1
• /
• pp.11-17
• /
• 2015

Min-max stochastic optimization is an approach to address the distribution ambiguity of the underlying random variable. We present a unified approach to the problem which utilizes the theory of convex order on the random variables. First, we consider a general framework for the problem and give a condition under which the convex order can be utilized to transform the min-max optimization problem into a simple minimization problem. Then extremal distributions are presented for some interesting classes of distributions. Finally, applications to the single-period inventory control problems are given.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.83-84
• /
• 2020

Sum Utility를 최적화하는 Convex Optimization Algorithm을 제안한다. 일반적으로, Sum Utility 최적화 문제는 Non Convex Optimization Problem이다. 하지만, '상대간섭'과 '간섭주요화'를 활용하여 Non Convex Optimization Problem이 간섭구간에 따라 Convex Optimization으로 해결할 수 있음을 확인하였다. 특히, 유틸리티 함수는 상대간섭 0.1 이하에서는 오목함수임을 확인하였다. 실험결과 상대간섭이 작아질수록 제안하는 알고리즘에 의한 Sum Utility는 증가함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2162-2176
• /
• 2018

Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.