• Smart Structures and Systems
• /
• 제26권4호
• /
• pp.451-468
• /
• 2020

Although model updating has been widely applied using a specific optimization algorithm with a single objective function using frequencies, mode shapes or frequency response functions, there are few studies that investigate hybrid optimization algorithms for real structures. Many of them did not take into account the sensitivity of the updating parameters to the model outputs. Therefore, in this paper, optimization algorithms and sensitivity analysis are applied for model updating of a real cable-stayed bridge, i.e., the Kien bridge in Vietnam, based on experimental data. First, a global sensitivity analysis using Morris method is employed to find out the most sensitive parameters among twenty surveyed parameters based on the outputs of a Finite Element (FE) model. Then, an objective function related to the differences between frequencies, and mode shapes by means of MAC, COMAC and eCOMAC indices, is introduced. Three metaheuristic algorithms, namely Gravitational Search Algorithm (GSA), Particle Swarm Optimization algorithm (PSO) and hybrid PSOGSA algorithm, are applied to minimize the difference between simulation and experimental results. A laboratory pipe and Kien bridge are used to validate the proposed approach. Efficiency and reliability of the proposed algorithms are investigated by comparing their convergence rate, computational time, errors in frequencies and mode shapes with experimental data. From the results, PSO and PSOGSA show good performance and are suitable for complex and time-consuming analysis such as model updating of a real cable-stayed bridge. Meanwhile, GSA shows a slow convergence for the same number of population and iterations as PSO and PSOGSA.

• 대한기계학회논문집A
• /
• 제28권10호
• /
• pp.1558-1565
• /
• 2004

It is important to determine supporting locations for structural stability when a structure is loaded with non-uniform load or supporting locations as well as the number of the supporting structures are restricted by the problem of space. Moreover, the supporting location optimization of complex structure in real world is frequently faced with discontinuous design space. Therefore, the traditional optimization methods based on derivative are not suitable Whereas, Genetic Algorithm (CA) based on stochastic search technique is a very robust and general method. The KSTAR in-vessel control coil installed in vacuum vessel is loaded with non- uniform electro-magnetic load and supporting locations are restricted by the problem of space. This paper shows the supporting location optimization for structural stability of the in-vessel control coil. Optimization has been performed by means of a developed program. It consists of a Finite Element Analysis interfaced with a Genetic Algorithm. In addition, this paper presents an algorithm to find an optimum solution in discontinuous space using continuous design variables.

• 전자공학회논문지S
• /
• 제34S권1호
• /
• pp.124-131
• /
• 1997

There have been many demands for th ereal-time image compression. The image compression systems have a wide range of applications. However, real-time encoding is hard to implement because it needs a large amount of computations. In particular, the discrete cosine transform (DCT) and motion estimatio require a large number of arithmetic oeprations compared to other algorithms in MPEG-2. The conventional fasdt DCT algorithms have focused on the reduction of the number of additions more cycles and more expense in realization. Because TMS320C80 has special structure, new approach for implementation of DCT is suggested. The selection of adaptive algorithm and optimization is requried TMS320C80 are analyzed an dsome adaptive DCT algorithms are selected. The DCT algorithms are optimized and implemented. Chens and lees DCT algorithms among various fast algorithms are selected because 1-D approach is effective in the view of th einternal structure of TMS320C80. According to the simulation result, Lees algorithm is more effective in speed and has little difference in precision. On the basis of the result, the possibility of DCT implementation for real-time MPEG-2 system is verified and the required number of the processor, called advanced DSP, is decided for real-time MPEG-2 encoding and decoding.

• 한국산업정보학회논문지
• /
• 제24권5호
• /
• pp.115-120
• /
• 2019

본 논문에서는 이동 구간 입자 군집 최적화 (Receding horizon particle swarm optimization; RHPSO) 알고리즘 기반 다개체 로봇 편대 제어 알고리즘의 통계적 성능 분석 결과를 제시한다. 다개체 로봇의 편대 제어 문제는 로봇 간 충돌 회피를 고려할 경우, 구속 조건이 있는 비선형 최적화 문제로 정의될 수 있다. 일반적으로 구속 조건이 있는 비선형 최적화 문제는 최적해를 찾는데 많은 시간이 걸리는 문제점이 있다. 이동 구간 입자 군집 최적화 알고리즘은 로봇 편대 제어의 최적화 문제에 대한 준최적해를 빠르게 찾기 위해 제안된 알고리즘이다. 이동 구간 입자 군집 최적화 알고리즘은 알고리즘에 사용되는 후보해의 개수와 세대 수가 증가함에 따라 계산 복잡도가 증가한다. 따라서 최소의 후보해와 세대 수만으로 실시간 제어에 사용될 수 있는 준최적해를 찾는 것이 중요하다. 본 논문에서는 이동 구간 입자 군집 최적화 알고리즘의 후보해의 수와 세대 수에 따른 제어 오차를 비교하였다. 다양한 조건의 시뮬레이션 실험을 통해서 통계적으로 결과를 분석하고, 허용 가능한 편대 오차 범위 내에서 이동 구간 입자 군집 최적화 알고리즘의 최소 후보해의 수와 세대 수를 도출한다.

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.841-850
• /
• 2004

This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.

• 한국군사과학기술학회지
• /
• 제20권3호
• /
• pp.441-453
• /
• 2017

In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

• 한국산업융합학회 논문집
• /
• 제22권2호
• /
• pp.87-93
• /
• 2019

This research deals with posture optimization for humanoid robot against external forces using genetic algorithm and neural network. When the robot takes a motion to push an object, the torque of each joint is generated by reaction force at the palm. This study aims to optimize the posture of the humanoid robot that will change this torque. This study finds an optimized posture using a genetic algorithm such that torques are evenly distributed over the all joints. Then, a number of different optimized postures are generated from various the reaction forces at the palm. The data is to be used as training data of MLP(Multi-Layer Perceptron) neural network with BP(Back Propagation) learning algorithm. Humanoid robot can find the optimal posture at different reaction forces in real time using the trained neural network include non-training data.

• 상하수도학회지
• /
• 제27권4호
• /
• pp.413-428
• /
• 2013

In this study, Ant Colony Algorithm(ACO) was used for optimal model. ACO which are metaheuristic algorithm for combinatorial optimization problem are inspired by the fact that ants are able to find the shortest route between their nest and food source. For applying the model to water distribution systems, pipes, tanks(reservoirs), pump construction and pump operation cost were considered as object function and pressure at each node and reservoir level were considered as constraints. Modified model from Ostfeld and Tubaltzev(2008) was verified by applying 2-Looped, Hanoi and Ostfeld's networks. And sensitivity analysis about ant number, number of ants in a best group and pheromone decrease rate was accomplished. After the verification, it was applied to real water network from S water treatment plant. As a result of the analysis, in the Two-looped network, the best design cost was found to $419,000 and in the Hanoi network, the best design cost was calculated to $6,164,384, and in the Ostfeld's network, the best design cost was found to $3,525,096. These are almost equal or better result compared with previous researches. Last, the cost of optimal design for real network, was found for 66 billion dollar that is 8.8 % lower than before. In addition, optimal diameter for aged pipes was found in this study and the 5 of 8 aged pipes were changed the diameter. Through this result, pipe construction cost reduction was found to 11 percent lower than before. And to conclusion, The least cost design model on water distribution system was developed and verified successfully in this study and it will be very useful not only optimal pipe change plan but optimization plan for whole water distribution system.

• 산업경영시스템학회지
• /
• 제36권2호
• /
• pp.8-16
• /
• 2013

In this paper, we proposed a new method for the determination of strategies that are required in a continuous optimization algorithm based on the fictitious play theory. In order to apply the fictitious play theory to continuous optimization problems, it is necessary to express continuous values of a variable in terms of discrete strategies. In this paper, we proposed a method in which all strategies contain an equal number of selected real values that are sorted in their magnitudes. For comparative analysis of the characteristics and performance of the proposed method of representing strategies with respect to the conventional method, we applied the method to the two types of benchmarking functions: separable and inseparable functions. From the experimental results, we can infer that, in the case of the separable functions, the proposed method not only outperforms but is more stable. In the case of inseparable functions, on the contrary, the performance of the optimization depends on the benchmarking functions. In particular, there is a rather strong correlation between the performance and stability regardless of the benchmarking functions.

• 산업경영시스템학회지
• /
• 제38권2호
• /
• pp.120-128
• /
• 2015

Quality function deployment (QFD) is a useful method in product design and development to maximize customer satisfaction. In the QFD, the technical attributes (TAs) affecting the product performance are identified, and product performance is improved to optimize customer requirements (CRs). For product development, determining the optimal levels of TAs is crucial during QFD optimization. Many optimization methods have been proposed to obtain the optimal levels of TAs in QFD. In these studies, the levels of TAs are assumed to be continuous while they are often taken as discrete in real world application. Another assumption in QFD optimization is that the requirements of the heterogeneous customers can be generalized and hence only one house of quality (HoQ) is used to connect with CRs. However, customers often have various requirements and preferences on a product. Therefore, a product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. To overcome these problems, this paper proposes an optimization approach to find the optimal set of TAs under multi-segment market. Dynamic Programming (DP) methodology is developed to maximize the overall customer satisfaction for the market considering the weights of importance of different segments. Finally, a case study is provided for illustrating the proposed optimization approach.