• 제목/요약/키워드: Multi Objective Genetic Algorithm

검색결과 311건 처리시간 0.038초

멀티캐스트 라우팅을 위한 다목적 마이크로-유전자 알고리즘 (Multi-Objective Micro-Genetic Algorithm for Multicast Routing)

  • 전성화;한치근
    • 산업공학
    • /
    • 제20권4호
    • /
    • pp.504-514
    • /
    • 2007
  • The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

Optimal placement of piezoelectric actuators and sensors on a smart beam and a smart plate using multi-objective genetic algorithm

  • Nestorovic, Tamara;Trajkov, Miroslav;Garmabi, Seyedmehdi
    • Smart Structures and Systems
    • /
    • 제15권4호
    • /
    • pp.1041-1062
    • /
    • 2015
  • In this paper a method of finding optimal positions for piezoelectric actuators and sensors on different structures is presented. The genetic algorithm and multi-objective genetic algorithm are selected for optimization and $H_{\infty}$ norm is defined as a cost function for the optimization process. To optimize the placement concerning the selected modes simultaneously, the multi-objective genetic algorithm is used. The optimization is investigated for two different structures: a cantilever beam and a simply supported plate. Vibrating structures are controlled in a closed loop with feedback gains, which are obtained using optimal LQ control strategy. Finally, output of a structure with optimized placement is compared with the output of the structure with an arbitrary, non-optimal placement of piezoelectric patches.

다목적 유전자 알고리즘을 이용한문서 클러스터링 (The Document Clustering using Multi-Objective Genetic Algorithms)

  • 이정송;박순철
    • 한국산업정보학회논문지
    • /
    • 제17권2호
    • /
    • pp.57-64
    • /
    • 2012
  • 본 논문에서는 텍스트 마이닝 분야에서 중요한 부분을 차지하고 있는 문서 클러스터링을 위하여 다목적 유전자 알고리즘을 제안한다. 문서 클러스터링에 있어 중요한 요소 중 하나는 유사한 문서를 그룹화 하는 클러스터링 알고리즘이다. 지금까지 문서 클러스터링에는 k-means 클러스터링, 유전자 알고리즘 등을 사용한 연구가 많이 진행되고 있다. 하지만 k-means 클러스터링은 초기 클러스터 중심에 따라 성능 차이가 크며 유전자 알고리즘은 목적함수에 따라 지역 최적해에 쉽게 빠지는 단점을 갖고 있다. 본 논문에서는 이러한 단점을 보완하기 위하여 다목적 유전자 알고리즘을 문서 클러스터링에 적용해 보고, 기존의 알고리즘과 정확성을 비교 및 분석한다. 성능 시험을 통해 k-means 클러스터링(약 20%)과 기존의 유전자 알고리즘(약 17%)을 비교할 때 본 논문에서 제안한 다목적 유전자 알고리즘의 성능이 월등하게 향상됨을 보인다.

동적 공정계획에서의 기계선정을 위한 다목적 유전자 알고리즘 (Multi-Objective Genetic Algorithm for Machine Selection in Dynamic Process Planning)

  • 최회련;김재관;이홍철;노형민
    • 한국정밀공학회지
    • /
    • 제24권4호
    • /
    • pp.84-92
    • /
    • 2007
  • Dynamic process planning requires not only more flexible capabilities of a CAPP system but also higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations by calculating the machine loads. The developed algorithm is based on the multi-objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as the Pareto-optimal solutions). The objective is to satisfy both the minimization number of part movements and the maximization of machine utilization. The algorithm is characterized by a new and efficient method for nondominated sorting through K-means algorithm, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II and branch and bound algorithm.

스케줄링 문제를 위한 멀티로봇 위치 기반 다목적 유전 알고리즘 (Multi-Objective Genetic Algorithm based on Multi-Robot Positions for Scheduling Problems)

  • 최종훈;김제석;정진한;김정민;박장현
    • 한국정밀공학회지
    • /
    • 제31권8호
    • /
    • pp.689-696
    • /
    • 2014
  • This paper presents a scheduling problem for a high-density robotic workcell using multi-objective genetic algorithm. We propose a new algorithm based on NSGA-II(Non-dominated Sorting Algorithm-II) which is the most popular algorithm to solve multi-objective optimization problems. To solve the problem efficiently, the proposed algorithm divides the problem into two processes: clustering and scheduling. In clustering process, we focus on multi-robot positions because they are fixed in manufacturing system and have a great effect on task distribution. We test the algorithm by changing multi-robot positions and compare it to previous work. Test results shows that the proposed algorithm is effective under various conditions.

A comparison of three multi-objective evolutionary algorithms for optimal building design

  • Hong, Taehoon;Lee, Myeonghwi;Kim, Jimin;Koo, Choongwan;Jeong, Jaemin
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.656-657
    • /
    • 2015
  • Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

  • PDF

적응 유전자 알고리즘을 이용한 다수의 성능 사양을 만족하는 제어계의 설계 (A Design Of Control System Satisfying Multi-Performance Specifications Using Adaptive Genetic Algorithms)

  • 윤영진;원태현;이영진;이만형
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2002년도 춘계학술대회 논문집
    • /
    • pp.621-624
    • /
    • 2002
  • The purpose of this paper is a study on getting proper gain set of PID controller which satisfies multi-performance specifications of the control system. The multi-objective optimization method is introduced to evaluate specifications, and the genetic algorithm is used as an optimal problem solver. To enhance the performance of genetic algorithm itself, adaptive technique is included. According to the proposed method in this paper, finding suitable gain set can be more easily accomplishable than manual gain seeking and tuning.

  • PDF

Generalized evolutionary optimum design of fiber-reinforced tire belt structure

  • Cho, J.R.;Lee, J.H.;Kim, K.W.;Lee, S.B.
    • Steel and Composite Structures
    • /
    • 제15권4호
    • /
    • pp.451-466
    • /
    • 2013
  • This paper deals with the multi-objective optimization of tire reinforcement structures such as the tread belt and the carcass path. The multi-objective functions are defined in terms of the discrete-type design variables and approximated by artificial neutral network, and the sensitivity analyses of these functions are replaced with the iterative genetic evolution. The multi-objective optimization algorithm introduced in this paper is not only highly CPU-time-efficient but it can also be applicable to other multi-objective optimization problems in which the objective function, the design variables and the constraints are not continuous but discrete. Through the illustrative numerical experiments, the fiber-reinforced tire belt structure is optimally tailored. The proposed multi-objective optimization algorithm is not limited to the tire reinforcement structure, but it can be applicable to the generalized multi-objective structural optimization problems in various engineering applications.

Application of multi objective genetic algorithm in ship hull optimization

  • Guha, Amitava;Falzaranoa, Jeffrey
    • Ocean Systems Engineering
    • /
    • 제5권2호
    • /
    • pp.91-107
    • /
    • 2015
  • Ship hull optimization is categorized as a bound, multi variable, multi objective problem with nonlinear constraints. In such analysis, where the objective function representing the performance of the ship generally requires computationally involved hydrodynamic interaction evaluation methods, the objective functions are not smooth. Hence, the evolutionary techniques to attain the optimum hull forms is considered as the most practical strategy. In this study, a parametric ship hull form represented by B-Spline curves is optimized for multiple performance criteria using Genetic Algorithm. The methodology applied to automate the hull form generation, selection of optimization solvers and hydrodynamic parameter calculation for objective function and constraint definition are discussed here.