• 제어로봇시스템학회논문지
• /
• 제6권12호
• /
• pp.1061-1069
• /
• 2000

In this paper, a new genetic algorithm is proposed for solving multimodal function optimization problems that are not easily solved by conventional genetic algorithm(GA)s. This algorithm finds one of local optima first and another optima at the next iteration. By repeating this process, we can locate all the local solutions instead of one local solution as in conventional GAs. To avoid converging to the same optimum again, we devise a new genetic operator, called a Mendel operator which simulates the Mendels genetic law. The proposed algorithm remembers the optima obtained so far, compels individuals to move away from them, and finds a new optimum.

• 대한기계학회논문집A
• /
• 제25권4호
• /
• pp.671-684
• /
• 2001

Several design problems of composite structures are studied via a global optimizer based on attraction regions. MSC/NASTRAN is adopted for static and eigenvalue analysis. The method of modified feasible direction in DOT is used for local optimization. Through the review of global optimization algorithms, the triangular patch algorithm is selected because the algorithm is known to be efficient, robust and powerful for general nonlinear optimization problems. For general applicability, various mechanical properties are considered as design objectives; strain energy, eigenvalue, weight, displacement, and buckling load. In all cases considered, the triangular patch algorithm results in a lot of optimum points and useful design patterns, that are not easy by local algorithms or conventional global algorithms can be determined.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 1998년도 춘계학술대회논문집; 용평리조트 타워콘도, 21-22 May 1998
• /
• pp.273-279
• /
• 1998

An immune system has powerful abilities such as memory, recognition and learning to respond to invading antigens, and is applied to many engineering algorithm recently. In this paper, the combined optimization algorithm is proposed for multi-optimization problem by introducing the capability of the immune system that controls the proliferation of clones to the genetic algorithm. The optimizing ability of the proposed optimization algorithm is identified by using two multi-peak functions which have many local optimums and optimization of the unbalance response function for rotor model.

• Journal of Information Processing Systems
• /
• 제13권4호
• /
• pp.1000-1013
• /
• 2017

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new meta-heuristic algorithm that has been applied to solve various optimization problems and it provides better results in comparison to other similar types of algorithms. However, this algorithm suffers from diversity and local optima problems. To overcome these problems, we are proposing an improved version of the CSO algorithm by using opposition-based learning and the Cauchy mutation operator. We applied the opposition-based learning method to enhance the diversity of the CSO algorithm and we used the Cauchy mutation operator to prevent the CSO algorithm from trapping in local optima. The performance of our proposed algorithm was tested with several artificial and real datasets and compared with existing methods like K-means, particle swarm optimization, and CSO. The experimental results show the applicability of our proposed method.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2009년 춘계학술대회논문집
• /
• pp.57-65
• /
• 2009

An efficient and high-fidelity design approach for wing-body shape optimization is presented. Depending on the size of design space and the number of design of variable, aerodynamic shape optimization process is carried out via different optimization strategies at each design stage. In the first stage, global optimization techniques are applied to planform design with a few geometric design variables. In the second stage, local optimization techniques are used for wing surface design with a lot of design variables to maintain a sufficient design space with a high DOF (Degree of Freedom) geometric change. For global optimization, Kriging method in conjunction with Genetic Algorithm (GA) is used. Asearching algorithm of EI (Expected Improvement) points is introduced to enhance the quality of global optimization for the wing-planform design. For local optimization, a discrete adjoint method is adopted. By the successive combination of global and local optimization techniques, drag minimization is performed for a multi-body aircraft configuration while maintaining the baseline lift and the wing weight at the same time. Through the design process, performances of the test models are remarkably improved in comparison with the single stage design approach. The performance of the proposed design framework including wing planform design variables can be efficiently evaluated by the drag decomposition method, which can examine the improvement of various drag components, such as induced drag, wave drag, viscous drag and profile drag.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1283-1286
• /
• 2005

Multimodal optimization is one of the most interesting topics in evolutionary computational discipline. Simple genetic algorithm, a basic and good-performance genetic algorithm, shows bad performance on multimodal problems, taking long generation time to obtain the optimum, converging on the local extrema in early generation. In this paper, we propose a new genetic algorithm with two new genetic mutational operators, i.e. global and local mutation operators, and no genetic crossover. The proposed algorithm is similar to Simple GA and the two genetic operators are as simple as the conventional mutation. They just mutate the genes from left or right end of a chromosome till the randomly selected gene is replaced. In fact, two operators are identical with each other except for the direction where they are applied. Their roles of shaking the population (global searching) and fine tuning (local searching) make the diversity of the individuals being maintained through the entire generation. The proposed algorithm is, therefore, robust and powerful.

• 한국지능시스템학회논문지
• /
• 제8권3호
• /
• pp.71-79
• /
• 1998

본 논문은 유전알고리즘과 random tabu 탐색법을 조합한 새로운 최적화 알고리즘을 제안한다. 유전알고리즘과 전역적인 최적해에 대한 탐색능력이 우수하고, random tabu 탐색법은 최적해에의 수렴속도가 매우 빠른 알고리즘이다. 본 논문에서는 이 두 알고리즘의 장점을 이용해서 수렴정도와 수렴속도가 더욱 향상된 최적알고리즘을 제안하여 알고리즘의 수렴성능을 조사하고, 실제 최적화문제로서 지진응답을 최소로 하기위한 배관지지대의 최적배치문제에 적용하여 기존의 방법과 비교를 통하여 유용성을 검토하였다.

• Smart Structures and Systems
• /
• 제18권3호
• /
• pp.425-448
• /
• 2016

In this paper, a new Pigeon Colony Algorithm (PCA) based on the features of a pigeon colony flying is proposed for solving global numerical optimization problems. The algorithm mainly consists of the take-off process, flying process and homing process, in which the take-off process is employed to homogenize the initial values and look for the direction of the optimal solution; the flying process is designed to search for the local and global optimum and improve the global worst solution; and the homing process aims to avoid having the algorithm fall into a local optimum. The impact of parameters on the PCA solution quality is investigated in detail. There are low-dimensional functions, high-dimensional functions and systems of nonlinear equations that are used to test the global optimization ability of the PCA. Finally, comparative experiments between the PCA, standard genetic algorithm and particle swarm optimization were performed. The results showed that PCA has the best global convergence, smallest cycle indexes, and strongest stability when solving high-dimensional, multi-peak and complicated problems.

• Structural Engineering and Mechanics
• /
• 제42권6호
• /
• pp.783-797
• /
• 2012

A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

• 전기학회논문지
• /
• 제66권1호
• /
• pp.100-106
• /
• 2017

In this paper, we propose a parallel optimization method of Aho-Corasick (AC) algorithm and Parallel Failureless Aho-Corasick (PFAC) algorithm using Open Computing Language (OpenCL) on Field Programmable Gate Array (FPGA). The low throughput of string matching engine causes the performance degradation of network process. Recently, many researchers have studied the string matching engine using parallel computing. FPGA's vendors offer a parallel computing platform using OpenCL. In this paper, we apply the AC and PFAC algorithm on DE1-SoC board with Cyclone V FPGA, where the optimization that considers FPGA architecture is performed. Experiments are performed considering global id, local id, local memory, and loop unrolling optimizations using PFAC algorithm. The performance improvement using loop unrolling is 129 times greater than AC algorithm that not adopt loop unrolling. The performance improvements using loop unrolling are 1.1, 0.2, and 1.5 times greater than those using global id, local id, and local memory optimizations mentioned above.