• Title/Summary/Keyword: Optimization Algorithm

Search Result 5,689, Processing Time 0.03 seconds

Size Optimization of Space Trusses Based on the Harmony Search Heuristic Algorithm (Harmony Search 알고리즘을 이용한 입체트러스의 단면최적화)

  • Lee Kang-Seok;Kim Jeong-Hee;Choi Chang-Sik;Lee Li-Hyung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2005.04a
    • /
    • pp.359-366
    • /
    • 2005
  • Most engineering optimization are based on numerical linear and nonlinear programming methods that require substantial gradient information and usually seek to improve the solution in the neighborhood of a starting point. These algorithm, however, reveal a limited approach to complicated real-world optimization problems. If there is more than one local optimum in the problem, the result may depend on the selection of an initial point, and the obtained optimal solution may not necessarily be the global optimum. This paper describes a new harmony search(HS) meta-heuristic algorithm-based approach for structural size optimization problems with continuous design variables. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. Two classical space truss optimization problems are presented to demonstrate the effectiveness and robustness of the HS algorithm. The results indicate that the proposed approach is a powerful search and optimization technique that may yield better solutions to structural engineering problems than those obtained using current algorithms.

  • PDF

Quantum Bacterial Foraging Optimization for Cognitive Radio Spectrum Allocation

  • Li, Fei;Wu, Jiulong;Ge, Wenxue;Ji, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.564-582
    • /
    • 2015
  • This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step for the sake of driving the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. Numerical results show that the proposed QBFO has more powerful properties in terms of convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. Furthermore, we examine the employment of our proposed QBFO for cognitive radio spectrum allocation. The results indicate that the proposed QBFO based spectrum allocation scheme achieves high efficiency of spectrum usage and improves the transmission performance of secondary users, as compared to color sensitive graph coloring algorithm and quantum genetic algorithm.

A Study on the Supporting Location Optimization a Structure Under Non-Uniform Load Using Genetic Algorithm (유전알고리듬을 이용한 비균일 하중을 받는 구조물의 지지위치 최적화 연구)

  • Lee Young-Shin;Bak Joo-Shik;Kim Geun-Hong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.10
    • /
    • pp.1558-1565
    • /
    • 2004
  • It is important to determine supporting locations for structural stability when a structure is loaded with non-uniform load or supporting locations as well as the number of the supporting structures are restricted by the problem of space. Moreover, the supporting location optimization of complex structure in real world is frequently faced with discontinuous design space. Therefore, the traditional optimization methods based on derivative are not suitable Whereas, Genetic Algorithm (CA) based on stochastic search technique is a very robust and general method. The KSTAR in-vessel control coil installed in vacuum vessel is loaded with non- uniform electro-magnetic load and supporting locations are restricted by the problem of space. This paper shows the supporting location optimization for structural stability of the in-vessel control coil. Optimization has been performed by means of a developed program. It consists of a Finite Element Analysis interfaced with a Genetic Algorithm. In addition, this paper presents an algorithm to find an optimum solution in discontinuous space using continuous design variables.

Application of Stochastic Optimization Method to (s, S) Inventory System ((s, S) 재고관리 시스템에 대한 확률최적화 기법의 응용)

  • Chimyung Kwon
    • Journal of the Korea Society for Simulation
    • /
    • v.12 no.2
    • /
    • pp.1-11
    • /
    • 2003
  • In this paper, we focus an optimal policy focus optimal class of (s, S) inventory control systems. To this end, we use the perturbation analysis and apply a stochastic optimization algorithm to minimize the average cost over a period. We obtain the gradients of objective function with respect to ordering amount S and reorder point s via a combined perturbation method. This method uses the infinitesimal perturbation analysis and the smoothed perturbation analysis alternatively according to occurrences of ordering event changes. Our simulation results indicate that the optimal estimates of s and S obtained from a stochastic optimization algorithm are quite accurate. We consider that this may be due to the estimated gradients of little noise from the regenerative system simulation, and their effect on search procedure when we apply the stochastic optimization algorithm. The directions for future study stemming from this research pertain to extension to the more general inventory system with regard to demand distribution, backlogging policy, lead time, and review period. Another directions involves the efficiency of stochastic optimization algorithm related to searching procedure for an improving point of (s, S).

  • PDF

Hybrid Optimization Algorithm based on the Interface of a Sequential Linear Approximation Method and a Genetic Algorithm (순차적 선형화 기법과 유전자 알고리즘을 접속한 하이브리드형 최적화 알고리즘)

  • Lee, Kyung-Ho;Lee, Kyu-Yeul
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.34 no.1
    • /
    • pp.93-101
    • /
    • 1997
  • Generally the traditional optimization methods have possibilities not only to give a different optimum value according to their starting point, but also to get to local optima. On the other hand, Genetic Algorithm (GA) has an ability of robust global search. In this paper, a new optimization method - the combination of traditional optimization method and genetic algorithm - is presented so as to overcome the above disadvantage of traditional methods. In order to increase the efficiency of the hybrid optimization method, a knowledge-based reasoning is adopted in the part of mathematical modeling, algorithm selection, and process control. The validation of the developed knowledge-based hybrid optimization method was examined and verified applying the method to nonlinear mathematical models.

  • PDF

An improved particle swarm optimizer for steel grillage systems

  • Erdal, Ferhat;Dogan, Erkan;Saka, Mehmet Polat
    • Structural Engineering and Mechanics
    • /
    • v.47 no.4
    • /
    • pp.513-530
    • /
    • 2013
  • In this paper, an improved version of particle swarm optimization based optimum design algorithm (IPSO) is presented for the steel grillage systems. The optimum design problem is formulated considering the provisions of American Institute of Steel Construction concerning Load and Resistance Factor Design. The optimum design algorithm selects the appropriate W-sections for the beams of the grillage system such that the design constraints are satisfied and the grillage weight is the minimum. When an improved version of the technique is extended to be implemented, the related results and convergence performance prove to be better than the simple particle swarm optimization algorithm and some other metaheuristic optimization techniques. The efficiency of different inertia weight parameters of the proposed algorithm is also numerically investigated considering a number of numerical grillage system examples.

Controller Optimization Algorithm for a 12-pulse Voltage Source Converter based HVDC System

  • Agarwal, Ruchi;Singh, Sanjeev
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.643-653
    • /
    • 2017
  • The paper presents controller optimization algorithm for a 12-pulse voltage source converter (VSC) based high voltage direct current (HVDC) system. To get an optimum algorithm, three methods namely conventional-Zeigler-Nichols, linear-golden section search (GSS) and stochastic-particle swarm optimization (PSO) are applied to control of 12 pulse VSC based HVDC system and simulation results are presented to show the best among the three. The performance results are obtained under various dynamic conditions such as load perturbation, non-linear load condition, and voltage sag, tapped load fault at points-of-common coupling (PCC) and single-line-to ground (SLG) fault at input AC mains. The conventional GSS and PSO algorithm are modified to enhance their performances under dynamic conditions. The results of this study show that modified particle swarm optimization provides the best results in terms of quick response to the dynamic conditions as compared to other optimization methods.

Genetic Algorithm Based Optimal Design for an Automobile Mirror Actuator (유전자 알고리듬을 이용한 자동차용 Mirror Actuator의 최적설계)

  • Park, Won-Ho;Kim, Chae-Sil;Choi, Heon-Oh
    • Proceedings of the KSME Conference
    • /
    • 2001.06c
    • /
    • pp.559-564
    • /
    • 2001
  • The design of an automobile mirror actuator system needs a systematic optimization due to several variables, constraints, geometric limitations, moving angle, and so on. Therefore, this article provides the procedure of a genetic algorithm(GA) based optimization with finite element analysis for design of a mirror actuator considering design constraints, geometric limitations, moving angle. Local optimum problem in optimization design with sensitivity analysis is overcome by using zero-order overall searching method which is new optimization design method using a genetic algorithm.

  • PDF

Static Compliance Analysis & Multi-Objective Optimization of Machine Tool Structures Using Genetic Algorithm(II) (유전자 알고리듬을 이용한 공작기계구조물의 정강성 해석 및 다목적 함수 최적화(II))

  • 이영우;성활경
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.10a
    • /
    • pp.231-236
    • /
    • 2001
  • The goal of multiphase optimization of machine structure is to obtain 1) light weight, 2) statically and dynamically rigid structure. The entire optimization process is carried out in two phases. In the first phase, multiple optimization problem with two objective functions is treated using pareto genetic algorithm. Two objective functions are weight of the structure, and static compliance. In the second phase, maximum receptance is minimized using genetic algorithm. The method is applied to design of quill type machine structure with back column.

  • PDF

A Feature-based Reconstruction Algorithm for Structural Optimization (구조 최적화를 위한 특징형상 재설계 알고리즘)

  • Park, Sangkun
    • Journal of Institute of Convergence Technology
    • /
    • v.4 no.2
    • /
    • pp.1-9
    • /
    • 2014
  • This paper examines feature-based reconstruction algorithm using feature-based modeling and based on topology optimization technology, which aims to achieve a minimal volume weight and to satisfy user-defined constraints such as stress, deformation related conditions. The finite element model after topology optimization allows us to remove some region of a solid model for predefined volume requirement. The stress or deformation distribution resulted from finite element analysis enables us to add some material to the solid model for a robust structure. For this purpose, we propose a feature-based redesign algorithm which inserts negative features to the solid model for material removal and positive features for material addition, and we introduce a bisection method which searches an optimal structure by iteratively applying the feature-based redesign algorithm. Several examples are considered to illustrate the proposed algorithms and to demonstrate the effectiveness of the present approach.