• Title/Summary/Keyword: space search optimization algorithm

Search Result 167, Processing Time 0.032 seconds

A Study on Adaptive Partitioning-based Genetic Algorithms and Its Applications (적응 분할법에 기반한 유전 알고리즘 및 그 응용에 관한 연구)

  • Han, Chang-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.4
    • /
    • pp.207-210
    • /
    • 2012
  • Genetic algorithms(GA) are well known and very popular stochastic optimization algorithm. Although, GA is very powerful method to find the global optimum, it has some drawbacks, for example, premature convergence to local optima, slow convergence speed to global optimum. To enhance the performance of GA, this paper proposes an adaptive partitioning-based genetic algorithm. The partitioning method, which enables GA to find a solution very effectively, adaptively divides the search space into promising sub-spaces to reduce the complexity of optimization. This partitioning method is more effective as the complexity of the search space is increasing. The validity of the proposed method is confirmed by applying it to several bench mark test function examples and the optimization of fuzzy controller for the control of an inverted pendulum.

A Study on Spot Welder of PI Controller Using Evolution Strategy (진화전략에 의한 PI제어기의 스폿용접기에 관한 연구)

  • Kim, Jae-Mun;Kim, Yuen-Chung;Won, Chung-Yuen;Kim, Gyu-Sik
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.531-533
    • /
    • 1997
  • PI(proportional-integral) controller has been extensively used in the industrial field. But in practicle case, it is difficult to tune PI gains. Evolution Strategy(ES) is used as an effective search algorithm in optimization programs. In this paper we proposed a PI controller for Spot welder system using ES with varying search space. ES with varying search space which depends on fitness values at each generation is used to tune PI control parameters. Simulation results show the proposed algorithm has accurate and robust performance with effective search ability.

  • PDF

A Comparison of Scheduling Optimization Algorithm for the Efficient Satellite Mission Scheduling Operation (효율적인 위성 임무 스케줄링 운영을 위한 스케줄링 최적화 알고리즘 비교 연구)

  • Baek, Seung-Woo;Cho, Kyeum-Rae;Lee, Dae-Woo;Kim, Hae-Dong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.1
    • /
    • pp.48-57
    • /
    • 2010
  • A comparison of two kinds of scheduling optimization algorithms is presented in this paper. As satellite control and operation techniques have been developed, satellite missions became more complicated and overall quantity of missions also increased. These changes require more specific consideration and a huge amount of computation for the satellite mission scheduling. Therefore, it is a good strategy to make a scheduling optimization algorithm for the efficient satellite mission scheduling operation. In this paper, two kinds of scheduling optimization algorithms are designed with tabu-search algorithm and genetic algorithm respectively. These algorithms are applied for the same mission scenario and the results of each algorithm are compared and analyzed.

Improvement of Dynamic encoding algorithm with history information (동부호화 최적화 기법의 성능개선을 위한 과거 검색정보의 활용)

  • Park, Young-Su;Kim, Jong-Wook;Kim, Yeon-Tak
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.111-113
    • /
    • 2006
  • DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

  • PDF

Optimal Allocation of Distributed Solar Photovoltaic Generation in Electrical Distribution System under Uncertainties

  • Verma, Ashu;Tyagi, Arjun;Krishan, Ram
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1386-1396
    • /
    • 2017
  • In this paper, a new approach is proposed to select the optimal sitting and sizing of distributed solar photovoltaic generation (SPVG) in a radial electrical distribution systems (EDS) considering load/generation uncertainties. Here, distributed generations (DGs) allocation problem is modeled as optimization problem with network loss based objective function under various equality and inequality constrains in an uncertain environment. A boundary power flow is utilized to address the uncertainties in load/generation forecasts. This approach facilitates the consideration of random uncertainties in forecast having no statistical history. Uncertain solar irradiance is modeled by beta distribution function (BDF). The resulted optimization problem is solved by a new Dynamic Harmony Search Algorithm (DHSA). Dynamic band width (DBW) based DHSA is proposed to enhance the search space and dynamically adjust the exploitation near the optimal solution. Proposed approach is demonstrated for two standard IEEE radial distribution systems under different scenarios.

Design of multi-span steel box girder using lion pride optimization algorithm

  • Kaveh, A.;Mahjoubi, S.
    • Smart Structures and Systems
    • /
    • v.20 no.5
    • /
    • pp.607-618
    • /
    • 2017
  • In this research, a newly developed nature-inspired optimization method, the Lion Pride Optimization algorithm (LPOA), is utilized for optimal design of composite steel box girder bridges. A composite box girder bridge is one of the common types of bridges used for medium spans due to their economic, aesthetic, and structural benefits. The aim of the present optimization procedure is to provide a feasible set of design variables in order to minimize the weight of the steel trapezoidal box girders. The solution space is delimited by different types of design constraints specified by the American Association of State Highway and Transportation Officials. Additionally, the optimal solution obtained by LPOA is compared to the results of other well-established meta-heuristic algorithms, namely Gray Wolf Optimization (GWO), Ant Lion Optimizer (ALO) and the results of former researches. By this comparison the capability of the LPOA in optimal design of composite steel box girder bridges is demonstrated.

Structural Design of Optimized Fuzzy Inference System Based on Particle Swarm Optimization (입자군집 최적화에 기초한 최적 퍼지추론 시스템의 구조설계)

  • Kim, Wook-Dong;Lee, Dong-Jin;Oh, Sung-Kwun
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.384-386
    • /
    • 2009
  • This paper introduces an effectively optimized Fuzzy model identification by means of complex and nonlinear system applying PSO algorithm. In other words, we use PSO(Particle Swarm Optimization) for identification of Fuzzy model structure and parameter. PSO is an algorithm that follows a collaborative population-based search model. Each particle of swarm flies around in a multidimensional search space looking for the optimal solution. Then, Particles adjust their position according to their own and their neighboring-particles experience. This paper identifies the premise part parameters and the consequence structures that have many effects on Fuzzy system based on PSO. In the premise parts of the rules, we use triangular. Finally we evaluate the Fuzzy model that is widely used in the standard model of gas data and sew data.

  • PDF

Truss structure damage identification using residual force vector and genetic algorithm

  • Nobahari, Mehdi;Ghasemi, Mohammad Reza;Shabakhty, Naser
    • Steel and Composite Structures
    • /
    • v.25 no.4
    • /
    • pp.485-496
    • /
    • 2017
  • In this paper, damage detection has been introduced as an optimization problem and a two-step method has been proposed that can detect the location and severity of damage in truss structures precisely and reduce the volume of computations considerably. In the first step, using the residual force vector concept, the suspected damaged members are detected which will result in a reduction in the number of variables and hence a decrease in the search space dimensions. In the second step, the precise location and severity of damage in the members are identified using the genetic algorithm and the results of the first step. Considering the reduced search space, the algorithm can find the optimal points (i.e. the solution for the damage detection problem) with less computation cost. In this step, the Efficient Correlation Based Index (ECBI), that considers the structure's first few frequencies in both damaged and healthy states, is used as the objective function and some examples have been provided to check the efficiency of the proposed method; results have shown that the method is innovatively capable of detecting damage in truss structures.

Development of NASTRAN-based Optimization Framework for Vibration Optimum Design of Ship Structure. (선박 구조물의 진동 최적설계를 위한 NASTRAN 기반 최적화 프레임웍의 제안)

  • Kong, Y.M.;Choi, S.H.;Chae, S.I.;Song, J.D.;Kim, Y.H.;Yang, B.S.
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.11 s.104
    • /
    • pp.1223-1231
    • /
    • 2005
  • Recently, the issue of ship nitration due to the large scale, high speed and lightweight of ship is emerging. For pleasantness in the cabin, shipbuilders are asked for strict vibration criteria and the degree of nitration level at a deckhouse became an important condition for taking order from customers. This study proposes a new optimization framework that is NASTRAN external call type optimization method (OptShip) and applies to an optimum design to decrease the nitration level of a deckhouse. The merits of this method are capable of using of global searching method and selecting of various objective function and design variables. The global optimization algorithms used here are random tabu search method which has fast converging speed and searches various size domains and genetic algorithm which searches multi-point solutions and has a good search capability in a complex space. By adapting OptShip to full-scale model, the validity of the suggested method was investigated.

Optimal Acoustic Search Path Planning Based on Genetic Algorithm in Discrete Path System (이산 경로 시스템에서 유전알고리듬을 이용한 최적음향탐색경로 전략)

  • CHO JUNG-HONG;KIM JUNG-HAE;KIM JEA-SOO;LIM JUN-SEOK;KIM SEONG-IL;KIM YOUNG-SUN
    • Journal of Ocean Engineering and Technology
    • /
    • v.20 no.1 s.68
    • /
    • pp.69-76
    • /
    • 2006
  • The design of efficient search path to maximize the Cumulative Detection Probability(CDP) is mainly dependent on experience and intuition when searcher detect the target using SONAR in the ocean. Recently with the advance of modeling and simulation method, it has been possible to access the optimization problems more systematically. In this paper, a method for the optimal search path calculation is developed based on the combination of the genetic algorithm and the calculation algorithm for detection range. We consider the discrete system for search path, space, and time, and use the movement direction of the SONAR for the gene of the genetic algorithm. The developed algorithm, OASPP(Optimal Acoustic Search Path Planning), is shown to be effective, via a simulation, finding the optimal search path for the case when the intuitive solution exists. Also, OASPP is compared with other algorithms for the measure of efficiency to maximize CDP.