• Title/Summary/Keyword: multi-objective evolutionary algorithm

Search Result 73, Processing Time 0.04 seconds

Automated flight control system design using multi-objective optimization (다목적 최적화를 이용한 비행제어계 설계 자동화)

  • Ryu, Hyuk;Tak, Min-Je
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.1296-1299
    • /
    • 1996
  • This paper proposes a design automation method for the flight control system of an aircraft based on optimization. The control system design problem which has many specifications is formulated as multi-objective optimization problem. The solution of this optimization problem should be considered in terms of Pareto-optimality. In this paper, we use an evolutionary algorithm providing numerous Pareto-optimal solutions. These solutions are given to a control system designer and the most suitable solution is selected. This method decreases tasks required to determine the control parameters satisfying all specifications. The design automation of a flight control system is illustrated through an example.

  • PDF

Optimization of Multi-objective Function based on The Game Theory and Co-Evolutionary Algorithm (게임 이론과 공진화 알고리즘에 기반한 다목적 함수의 최적화)

  • 김지윤;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.395-398
    • /
    • 2002
  • 본 논문에서는 ‘다목적 함수 최적화 문제(Multi-objective Optimization Problem MOP)’를 풀기 위하여 유전자 알고리즘을 진화적 게임 이론 적용시킨 ‘내쉬 유전자 알고리즘(Nash GA)’과 본 논문에서 새로이 제안하는 공진화 알고리즘의 구조를 설명하고 이 두 알고리즘의 결과를 시뮬레이션을 통하여 비교 검토함으로써 ‘진화적 게임 이론(Evolutionary Game Theory : EGT)’의 두 가지 아이디어 -‘내쉬의 균형(Equilibrium)’과 ‘진화적 안정전략(Evolutionary Stable Strategy . ESS)’-에 기반한 최적화 알고리즘들이 다목적 함수 문제의 최적해를 탐색할 수 있음을 확인한다.

Knee-driven many-objective sine-cosine algorithm

  • Hongxia, Zhao;Yongjie, Wang;Maolin, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.335-352
    • /
    • 2023
  • When solving multi-objective optimization problems, the blindness of the evolution direction of the population gradually emerges with the increase in the number of objectives, and there are also problems of convergence and diversity that are difficult to balance. The many- objective optimization problem makes some classic multi-objective optimization algorithms face challenges due to the huge objective space. The sine cosine algorithm is a new type of natural simulation optimization algorithm, which uses the sine and cosine mathematical model to solve the optimization problem. In this paper, a knee-driven many-objective sine-cosine algorithm (MaSCA-KD) is proposed. First, the Latin hypercube population initialization strategy is used to generate the initial population, in order to ensure that the population is evenly distributed in the decision space. Secondly, special points in the population, such as nadir point and knee points, are adopted to increase selection pressure and guide population evolution. In the process of environmental selection, the diversity of the population is promoted through diversity criteria. Through the above strategies, the balance of population convergence and diversity is achieved. Experimental research on the WFG series of benchmark problems shows that the MaSCA-KD algorithm has a certain degree of competitiveness compared with the existing algorithms. The algorithm has good performance and can be used as an alternative tool for many-objective optimization problems.

Optimal seismic retrofit design method for asymmetric soft first-story structures

  • Dereje, Assefa Jonathan;Kim, Jinkoo
    • Structural Engineering and Mechanics
    • /
    • v.81 no.6
    • /
    • pp.677-689
    • /
    • 2022
  • Generally, the goal of seismic retrofit design of an existing structure using energy dissipation devices is to determine the optimum design parameters of a retrofit device to satisfy a specified limit state with minimum cost. However, the presence of multiple parameters to be optimized and the computational complexity of performing non-linear analysis make it difficult to find the optimal design parameters in the realistic 3D structure. In this study, genetic algorithm-based optimal seismic retrofit methods for determining the required number, yield strength, and location of steel slit dampers are proposed to retrofit an asymmetric soft first-story structure. These methods use a multi-objective and single-objective evolutionary algorithms, each of which varies in computational complexity and incorporates nonlinear time-history analysis to determine seismic performance. Pareto-optimal solutions of the multi-objective optimization are found using a non-dominated sorting genetic algorithm (NSGA-II). It is demonstrated that the developed multi-objective optimization methods can determine the optimum number, yield strength, and location of dampers that satisfy the given limit state of a three-dimensional asymmetric soft first-story structure. It is also shown that the single-objective distribution method based on minimizing plan-wise stiffness eccentricity turns out to produce similar number of dampers in optimum locations without time consuming nonlinear dynamic analysis.

Genetic algorithms for balancing multiple variables in design practice

  • Kim, Bomin;Lee, Youngjin
    • Advances in Computational Design
    • /
    • v.2 no.3
    • /
    • pp.241-256
    • /
    • 2017
  • This paper introduces the process for Multi-objective Optimization Framework (MOF) which mediates multiple conflicting design targets. Even though the extensive researches have shown the benefits of optimization in engineering and design disciplines, most optimizations have been limited to the performance-related targets or the single-objective optimization which seek optimum solution within one design parameter. In design practice, however, designers should consider the multiple parameters whose resultant purposes are conflicting. The MOF is a BIM-integrated and simulation-based parametric workflow capable of optimizing the configuration of building components by using performance and non-performance driven measure to satisfy requirements including build programs, climate-based daylighting, occupant's experience, construction cost and etc. The MOF will generate, evaluate all different possible configurations within the predefined each parameter, present the most optimized set of solution, and then feed BIM environment to minimize data loss across software platform. This paper illustrates how Multi-objective optimization methodology can be utilized in design practice by integrating advanced simulation, optimization algorithm and BIM.

An evolutionary algorithm for optimal damper placement to minimize interstorey-drift transfer function in shear building

  • Fujita, Kohei;Yamamoto, Kaoru;Takewaki, Izuru
    • Earthquakes and Structures
    • /
    • v.1 no.3
    • /
    • pp.289-306
    • /
    • 2010
  • A gradient-based evolutionary optimization methodology is presented for finding the optimal design of viscous dampers to minimize an objective function defined for a linear multi-storey structure. The maximum value along height of the transfer function amplitudes for the interstorey drifts is taken as the objective function. Since the ground motion includes various uncertainties, the optimal damper placement may be different depending on the ground motion used for design. Furthermore, the transfer function treated as the objective function depends on the properties of structural parameters and added dampers. This implies that a more robust damper design is desired. A reliable and robust damping design system against any unpredictable ground motions can be provided by minimizing the maximum transfer function. Such design system is proposed in this paper.

A Symbiotic Evolutionary Algorithm for Balancing and Sequencing Mixed Model Assembly Lines with Multiple Objectives (다목적을 갖는 혼합모델 조립라인의 밸런싱과 투입순서를 위한 공생 진화알고리즘)

  • Kim, Yeo-Keun;Lee, Sang-Seon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.35 no.3
    • /
    • pp.25-43
    • /
    • 2010
  • We consider a multi-objective balancing and sequencing problem in mixed model assembly lines, which is important for an efficient use of the assembly lines. In this paper, we present a neighborhood symbiotic evolutionary algorithm to simultaneously solve the two problems of balancing and model sequencing under multiple objectives. We aim to find a set of well-distributed solutions close to the true Pareto optimal solutions for decision makers. The proposed algorithm has a two-leveled structure. At Level 1, two populations are operated : One consists of individuals each of which represents a partial solution to the balancing problem and the other consists of individuals for the sequencing problem. Level 2, which is an upper level, works one population whose individuals represent the combined entire solutions to the two problems. The process of Level 1 imitates a neighborhood symbiotic evolution and that of Level 2 simulates an endosymbiotic evolution together with an elitist strategy to promote the capability of solution search. The performance of the proposed algorithm is compared with those of the existing algorithms in convergence, diversity and computation time of nondominated solutions. The experimental results show that the proposed algorithm is superior to the compared algorithms in all the three performance measures.

Adaptive Truncation technique for Constrained Multi-Objective Optimization

  • Zhang, Lei;Bi, Xiaojun;Wang, Yanjiao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5489-5511
    • /
    • 2019
  • The performance of evolutionary algorithms can be seriously weakened when constraints limit the feasible region of the search space. In this paper we present a constrained multi-objective optimization algorithm based on adaptive ε-truncation (ε-T-CMOA) to further improve distribution and convergence of the obtained solutions. First of all, as a novel constraint handling technique, ε-truncation technique keeps an effective balance between feasible solutions and infeasible solutions by permitting some excellent infeasible solutions with good objective value and low constraint violation to take part in the evolution, so diversity is improved, and convergence is also coordinated. Next, an exponential variation is introduced after differential mutation and crossover to boost the local exploitation ability. At last, the improved crowding density method only selects some Pareto solutions and near solutions to join in calculation, thus it can evaluate the distribution more accurately. The comparative results with other state-of-the-art algorithms show that ε-T-CMOA is more diverse than the other algorithms and it gains better in terms of convergence in some extent.

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

Optimization of Stacking Strategies Considering Yard Occupancy Rate in an Automated Container Terminal (장치장 점유율을 고려한 자동화 컨테이너 터미널의 장치 위치 결정 전략 최적화)

  • Sohn, Min-Je;Park, Tae-Jin;Ryu, Kwang-Ryel
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1106-1110
    • /
    • 2010
  • This paper proposes a method of optimizing a stacking strategy for an automated container terminal using multi-objective evolutionary algorithms (MOEAs). Since the yard productivities of seaside and landside are conflicting objectives to be optimized, it is impossible to maximize them simultaneously. Therefore, we derive a Pareto optimal set instead of a single best solution using an MOEA. Preliminary experiments showed that the population is frequently stuck in local optima because of the difficulty of the given problem depending on the yard occupancy rate. To cope with this problem, we propose another method of simultaneously optimizing two problems with different difficulties so that diverse solutions can be preserved in the population. Experimental results showed the proposed method can derive better stacking policies than the compared method solving a single problem given the same computational costs.