• Proceedings of the KSMRM Conference
• /
• 1999.11a
• /
• pp.87-87
• /
• 1999

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.6
• /
• pp.1023-1030
• /
• 2007

This paper presents a new and efficient approach for solving the economic dispatch (ED) problems with nonconvex cost functions using particle swarm optimization (PSO). Although the PSO is easy to implement and has been empirically shown to perform well on many optimization problems, it may easily get trapped in a local optimum when solving problems with multiple local optima and heavily constrained. This paper proposes an improved PSO, which combines the conventional PSO with chaotic sequences (CPSO). The chaotic sequences combined with the linearly decreasing inertia weights in PSO are devised to improve the global searching capability and escaping from local minimum. To verify the feasibility of the proposed method, numerical studies have been performed for two different nonconvex ED test systems and its results are compared with those of previous works. The proposed CPSO algorithm outperforms other state-of-the-art algorithms in solving ED problems, which consider valve-point and multi-fuels with valve-point effects.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.6 s.183
• /
• pp.136-142
• /
• 2006

Optimization of the aircraft panel assembly constructed by skin and stringers is investigated. For the design of panel assembly of the aircraft structure, it is necessary to determine the best shape of the stringer which accomplishes lowest weight under the condition of no instability. A panel assembly can fail in a variety of instability modes under compression. Overall modes of flexure or torsion can occur and these can interact in a combined flexural/torsion mode. Flexure and torsion can occur symmetrically or anti-symmetrically. Local instabilities can also occur. The local instabilities considered in this paper are buckling of the free and attached flanges, the stiffener web and the inter-rivet buckling. A program is developed to find out critical load for each instability mode at the specific stringer shape. Based on the developed program, optimization is performed to find optimum stringer shape. The developed instability analysis program is not adequate for sensitivity analysis, therefore RSM (Response Surface Method) is utilized instead to model weight and instability constraints. Since the problem has many local minimum, Genetic algorithm is utilized to find global optimum.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1581-1584
• /
• 1997

This paper poropsed an efficient optimization technuque to resolve redundancy and a trajectory planning for a high precision control using proposed optimization technique. The proposed techniqus is the joint disturbance torque optimizatioin considering redundancy in the joing servo control. Joint disturbance torque is not unknown it is described dynamic equation ignored friction and viscosity. The proposed technique is used the dynamic equatiion included the joint disturbance torque characteristics. Numerical example of 3 joint planar redundant robot manipulator is simulated. In the 2-norm minimization of joint disturbance torque we compared pseudoinverse local optimization with proposed technique, and the results showed better the proposed technique. So the proposed technique can be highly precision controlled redundant robot manipulators in the joint servo control.

• Journal of the Korean Society of Safety
• /
• v.12 no.3
• /
• pp.120-131
• /
• 1997

This paper presents an approximate reanalysis methods of structures based on substructuring for an effective optimization of large-scale structural systems. In most optimal design procedures the analysis of the structure must be repeated many times. In particular, one of the main obstacles in the optimization of structural systems are involved high computational cost and expended long time in the optimization of large-scale structures. The purpose of this paper is to evaluate efficiently the structural behavior of new designs using information from previous ones, without solving basic equations for successive modification in the optimal design. The proposed reanalysis procedure is combined Taylor series expansions which is a local approximation and reduced basis method which is a global approximation based on substructuring. This technique is to choose each of the terms of Taylor series expansions as the basis vector of reduced basis method in substructuring system which is one of the most effective analysis of large -scale structures. Several numerical examples illustrate the effectiveness of the solution process.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.8
• /
• pp.790-797
• /
• 2007

This paper proposes a new measure of cost function ruggedness in local optimization with DEAS. DEAS is a computational optimization method developed since 2002 and has been applied to various engineering fields with success. Since DEAS is a recent optimization method which is rarely introduced in Korean, this paper first provides a brief overview and description of DEAS. In minimizing cost function with this non-gradient method, information on function shape measured automatically will enhance search capability. Considering the search strategies of DEAS are well designed with binary matrix structures, analysis of search behaviors will produce beneficial shape information. This paper deals with a simple quadratic function contained with various magnitudes of noise, and DEAS finds local minimum yielding ruggedness measure of given cost function. The proposed shape information will be directly used in improving DEAS performance in future work.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.278-278
• /
• 2000

In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve optimization problems such as the Traveling Salesman Problem(TSP) and maximizing or minimizing functions. In particular, because TSP is a well-known combinational optimization problem andbelongs to a NP-complete problem, there is huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. Additionally, the non-schema part is applied to inversion for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.944-946
• /
• 2004

In this paper, a new technique for electromagnetic topology optimization is proposed. The proposed technique is based on the large-step Markov chain (LSMC) method with novel local optimization algorithm. Because the proposed algorithm keeps a good convergence characteristic of LSMC, fast convergence is assured. The proposed LSMC is verified by an application to an inverse reconstruction problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.324-329
• /
• 2005

Dynamic Encoding Algorithm for Searches (DEAS) which is known as a fast and reliable non-gradient optimization method, was proposed [1]. DEAS reaches local or global optimum with binary strings (or binary matrices for multi-dimensional problem) by iterating the two operations; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., 0 or 1), while UDS performs increment or decrement of binary strings in the BSS' result direction with no change of string length. Because the interval of UDS exponentially decreases with increment of bit string length (BSL), DEAS is difficult to escape from local optimum when DEAS falls into local optimum. Therefore, this paper proposes hopping UDS (HUDS) which performs UDS by hopping as many as BSL in the final point of UDS process. HUDS helps to escape from local optimum and enhances a probability searching global optimization. The excellent performance of HUDS will be validated through the well-known benchmark functions.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• 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.