• Title/Summary/Keyword: optimization algorithms

Search Result 1,697, Processing Time 0.032 seconds

Optimization of spatial truss towers based on Rao algorithms

  • Grzywinski, Maksym
    • Structural Engineering and Mechanics
    • /
    • v.81 no.3
    • /
    • pp.367-378
    • /
    • 2022
  • In this study, combined size and shape optimization of spatial truss tower structures are presented by using new optimization algorithms named Rao-1, and Rao-2. The nodal displacements, allowable stress and buckling for compressive members are taken into account as structural constraints for truss towers. The discrete and continuous design variables are used as design variables for size and shape optimization. To show the efficiency of the proposed optimization algorithm, 25-bar, and 39-bar 3D truss towers are solved for combined size and shape optimization. The 72-bar, and 160-bar 3D truss towers are solved only by size optimization. The optimal results obtained from this study are compared to those given in the literature to illustrate the efficiency and robustness of the proposed algorithm. The structural analysis and the optimization process are coded in MATLAB programming.

A Study on Adaptive Random Signal-Based Learning Employing Genetic Algorithms and Simulated Annealing (유전 알고리즘과 시뮬레이티드 어닐링이 적용된 적응 랜덤 신호 기반 학습에 관한 연구)

  • Han, Chang-Wook;Park, Jung-Il
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.10
    • /
    • pp.819-826
    • /
    • 2001
  • Genetic algorithms are becoming more popular because of their relative simplicity and robustness. Genetic algorithms are global search techniques for nonlinear optimization. However, traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain because they are poor at hill-climbing, whereas simulated annealing has the ability of probabilistic hill-climbing. Therefore, hybridizing a genetic algorithm with other algorithms can produce better performance than using the genetic algorithm or other algorithms independently. In this paper, we propose an efficient hybrid optimization algorithm named the adaptive random signal-based learning. Random signal-based learning is similar to the reinforcement learning of neural networks. This paper describes the application of genetic algorithms and simulated annealing to a random signal-based learning in order to generate the parameters and reinforcement signal of the random signal-based learning, respectively. The validity of the proposed algorithm is confirmed by applying it to two different examples.

  • PDF

Effective Task Scheduling and Dynamic Resource Optimization based on Heuristic Algorithms in Cloud Computing Environment

  • NZanywayingoma, Frederic;Yang, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5780-5802
    • /
    • 2017
  • Cloud computing system consists of distributed resources in a dynamic and decentralized environment. Therefore, using cloud computing resources efficiently and getting the maximum profits are still challenging problems to the cloud service providers and cloud service users. It is important to provide the efficient scheduling. To schedule cloud resources, numerous heuristic algorithms such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Ant Colony Optimization (ACO), Cuckoo Search (CS) algorithms have been adopted. The paper proposes a Modified Particle Swarm Optimization (MPSO) algorithm to solve the above mentioned issues. We first formulate an optimization problem and propose a Modified PSO optimization technique. The performance of MPSO was evaluated against PSO, and GA. Our experimental results show that the proposed MPSO minimizes the task execution time, and maximizes the resource utilization rate.

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

  • Hong, Taehoon;Lee, Myeonghwi;Kim, Jimin;Koo, Choongwan;Jeong, Jaemin
    • International conference on construction engineering and project management
    • /
    • 2015.10a
    • /
    • 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

Optimum Design of Trusses Using Genetic Algorithms (유전자 알고리즘을 이용한 트러스의 최적설계)

  • 김봉익;권중현
    • Journal of Ocean Engineering and Technology
    • /
    • v.17 no.6
    • /
    • pp.53-57
    • /
    • 2003
  • Optimum design of most structural system requires that design variables are regarded as discrete quantities. This paper presents the use of Genetic Algorithm for determining the optimum design for truss with discrete variables. Genetic Algorithm are know as heuristic search algorithms, and are effective global search methods for discrete optimization. In this paper, Elitism and the method of conferring penalty parameters in the design variables, in order to achieve improved fitness in the reproduction process, is used in the Genetic Algorithm. A 10-Bar plane truss and a 25-Bar space truss are used for discrete optimization. These structures are designed for stress and displacement constraints, but buckling is not considered. In particular, we obtain continuous solution using Genetic Algorithms for a 10-bar truss, compared with other results. The effectiveness of Genetic Algorithms for global optimization is demonstrated through two truss examples.

Adaptive Control of Strong Mutation Rate and Probability for Queen-bee Genetic Algorithms

  • Jung, Sung-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.29-35
    • /
    • 2012
  • This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence and used it as a control parameter of those. Experimental results with four function optimization problems showed that our method was similar to or sometimes superior to the best result of empirical selections. This indicates that our method is very useful to practical optimization problems because it does not need time consuming trials.

Sidelobe Level Optimization of Microstrip Patch Array using Genetic Algorithms (유전자 알고리즘을 이용한 마이크로스트립 패치 배열 안테나의 부엽레벨 최적화)

  • Kim, Dong-Hyun;Kim, Young-Sik
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2003.11a
    • /
    • pp.428-431
    • /
    • 2003
  • In this paper, distances between elements are optimized for low sidelobe level (SLL) microstrip patch array using Genetic Algorithms. Genetic Algorithms are "global" numerical-optimization methods, it's advantages are very simple coding and fast optimization. This paper show how to optimize the maximum SLL using Genetic Algorithms. In the results, although mutual coupling is neglected, it's maximum SLL is 3.5 dB lower than Uniformly Spaced Array(distance=$0.5{\lambda}$).

  • PDF

Implementation of Adaptive Hierarchical Fair Com pet ion-based Genetic Algorithms and Its Application to Nonlinear System Modeling (적응형 계층적 공정 경쟁 기반 병렬유전자 알고리즘의 구현 및 비선형 시스템 모델링으로의 적용)

  • Choi, Jeoung-Nae;Oh, Sung-Kwun;Kim, Hyun-Ki
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.120-122
    • /
    • 2006
  • The paper concerns the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA) and information data granulation. The granulation is realized with the aid of the Hard C-means clustering and HFCGA is a kind of multi-populations of Parallel Genetic Algorithms (PGA), and it is used for structure optimization and parameter identification of fuzzy model. It concerns the fuzzy model-related parameters such as the number of input variables to be used, a collection of specific subset of input variables, the number of membership functions, the order of polynomial, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. Thestructural optimization is realized via HFCGA and HCM method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods.

  • PDF

Applications of Micro Genetic Algorithms to Engineering Design Optimization (마이크로 유전알고리듬의 최적설계 응용에 관한 연구)

  • Kim, Jong-Hun;Lee, Jong-Soo;Lee, Hyung-Joo;Koo, Bon-Heung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.1
    • /
    • pp.158-166
    • /
    • 2003
  • The paper describes the development and application of advanced evolutionary computing techniques referred to as micro genetic algorithms ($\mu$GA) in the context of engineering design optimization. The basic concept behind $\mu$GA draws from the use of small size of population irrespective of the bit string length in the representation of design variable. Such strategies also demonstrate the faster convergence capability and more savings in computational resource requirements than simple genetic algorithms (SGA). The paper first explores ten-bar truss design problems to see the optimization performance between $\mu$GA and SGA. Subsequently, $\mu$GA is applied to a realistic engineering design problem in the injection molding process optimization.

Optimization of Frame Structures with Natural Frequency Constraints (고유진동수 제약조건을 고려한 프레임 구조물의 최적화)

  • Kim, Bong-Ik;Lee, Seong-Dae
    • Journal of Ocean Engineering and Technology
    • /
    • v.24 no.6
    • /
    • pp.109-113
    • /
    • 2010
  • We present the minimum weight optimum design of cross sectional for frame structures subject to natural frequency. The optimum design in this paper employ discrete and continuous design variables and Genetic Algorithms. In this paper, Genetic Algorithms is used in optimization process, and be used the method of Elitism and penalty parameters in order to improved fitness in the reproduction process. For 1-Bay 2-Story frame structure, in examples, continuous and discrete design variables are used, and W-section (No.1~No.64), from AISC, discrete data are used in discrete optimization. In this case, Exhaustive search are used for finding global optimum. Continuous variables are used for 1-Bay 7-Story frame structure. Two typical frame structure optimization examples are employed to demonstrate the availability of Genetic Algorithms for solving minimum weight optimum of frame structures with fundamental and multi frequency.