• 조명전기설비학회논문지
• /
• 제21권1호
• /
• pp.111-117
• /
• 2007

This paper presents a new approach to evaluate reliability indices of electric distribution systems using genetic Algorithm (GA). The use of reliability evaluation is an important aspect of distribution system planning and operation to adjust the reliability level of each area. In this paper, the reliability model is based on the optimal load transforming problem to minimize load generated load point outage in each sub-section. This approach is one of the most difficult procedures and become combination problems. A new approach using GA was developed for this problem. GA is a general purpose optimization technique based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. Test results for the model system with 24 nodes 29 branches are reported in the paper.

• Journal of Communications and Networks
• /
• 제15권5호
• /
• pp.486-495
• /
• 2013

In this article, we suggest a two-dimensional genetic algorithm (GA) method that applies a cognitive radio (CR) decision engine which determines the optimal transmission parameters for multicarrier communication systems. Because a CR is capable of sensing the previous environmental communication information, CR decision engine plays the role of optimizing the individual transmission parameters. In order to obtain the allowable transmission power of multicarrier based CR system demands interference analysis a priori, for the sake of efficient optimization, a two-dimensionalGA structure is proposed in this paper which enhances the computational complexity. Combined with the fitness objective evaluation standard, we focus on two multi-objective optimization methods: The conventional GA applied with the multi-objective fitness approach and the non-dominated sorting GA with Pareto-optimal sorting fronts. After comparing the convergence performance of these algorithms, the transmission power of each subcarrier is proposed as non-interference emission with its optimal values in multicarrier based CR system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.106.4-106
• /
• 2001

The current research field to find near-optimum solutions explores in a small population, which is coined as Micro-Genetic Algorithms (${\mu}$GAs), with some genetic operators. Just as in the Simple-Genetic Algorithms (SGAs), the ${\mu}$GAs work with encoding population and are implemented serially. The major difference between SGAs and ${\mu}$GAs is how to make reproductive plan for more better searching strategy due to the population choice. This paper is conducted to implement ${\mu}$GAs in order to achieve fast searching for more better evolution and associated cost evaluation in global solution space. To achieve this implementation, the Air-Borne Selection (ABS) for a new reproductive plan is developed as new strategic conception for ${\mu}$GAs. In this paper, it is shown that the ${\mu}$GAs implementation reaches a near-optimal region much earlier than the SGAs implementation. The superior ...

• 대한기계학회논문집A
• /
• 제33권8호
• /
• pp.786-792
• /
• 2009

Topology optimization is to find the optimal material distribution of the specified design domain minimizing the objective function while satisfying the design constraints. Since the genetic algorithm (GA) has its advantage of locating global optimum with high probability, it has been applied to the topology optimization. To guarantee the structural connectivity, the concept of compliance pattern is proposed and to improve the convergence rate, small number of population size and variable probability in genetic operators are incorporated into GA. The rank sum weight method is applied to formulate the fitness function consisting of compliance, volume, connectivity and checkerboard pattern. To substantiate the proposed method design examples in the previous works are compared with respect to the number of function evaluation and objective function value. The comparative study shows that the compliance pattern based GA results in the reduction of computational cost to obtain the reasonable structural topology.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.783-786
• /
• 2008

외판원문제(Traveling Salesman problem: TSP)는 전형적인 조합최적화 문제로 위치하는 n개의 모든 지점을 오직 한번씩만 방문하는 순회경로를 결정하는 과정에서 순회비용 또는 순회거리를 최소화한다. 따라서 본 논문에서는 종래의 NP-hard문제로 널리 알려진 TSP를 해결하기 위해서 메타 휴리스틱기법 중에서 가장 널리 이용되고 있는 유전 알고리즘(Genetic Algorithm: GA)을 이용한다. 마지막으로, 유전 알고리즘을 이용해 외판원문제에 적합한 성능을 보이는 유전 연산자를 찾아내기 위해 수치 실험을 통해 그 성능에 대한 평가를 한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.267-270
• /
• 1997

In this paper, we proposed an optimazation method using Genetic Algorithm for nonlinear system modeling. Fuzzy Neural Network(FNNs) was used as basic model of nonlinear system. FNNs was fused of Fuzzy Inference which has linguistic property and Neural Network which has learning ability and high tolerence level. This paper, We used FNNs which was proposed by Yamakawa. The FNNs was composed Simple Inference and Error Back Propagation Algorithm. To obtain optimal model, parameter of membership function, learning rate and momentum coefficient of FNNs are tuned using genetic algorithm. And we used simplex algorithm additionaly to overcome limit of genetic algorithm. For the purpose of evaluation of proposed method, we applied proposed method to traffic choice process and waste water treatment process, and then obtained more precise model than other previous optimization methods and objective model.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2003년도 가을 학술발표회 논문집
• /
• pp.115-122
• /
• 2003

A Metropolis genetic algorithm(MGA) is developed and applied for the structural design optimization. In MGA favorable features of Metropolis algorithm in simulated annealing(SA) are incorporated in simple genetic algorithm(SGA), so that the MGA alleviates the disadvantage of finding imprecise solution in SGA and time-consuming computation in SA. Performances of MGA are compared with those of conventional algorithms such as Holland's SGA, Krishnakumar's micro genetic algorithm(μGA), and Kirkpatrick's SA. Typical numerical examples are used to evaluate the favorable features and applicability of MGA From the theoretical evaluation and numerical experience, it is concluded that the proposed MGA is a reliable and efficient tool for structural design optimization.

• 수산해양교육연구
• /
• 제29권2호
• /
• pp.544-551
• /
• 2017

Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

• 대한산업공학회지
• /
• 제29권1호
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• 한국정밀공학회지
• /
• 제13권11호
• /
• pp.73-81
• /
• 1996

This paper presents a general procedure for the selection of the machining parameters for a given machine which provides the maximum material removal rate using a Genetic Algorithms(GAs). Some constraints were given in order to achieve desired surface integrity and cutting tool life conditions as wel as to protect machine tool. Such a constrained problem can be transformaed to unconstrained problem by associating a penalty with all constraint violations and the penalties are included in the function evaluation. Genetic Algorithms can be used for finding global optimum cutting conditions with respect to the above cost function transformed by pennalty function method. From the demonstration of the numerical results, it was found that the near optimal conditions could be obtained regardless of complex solution space such as cutting environment.