• 제목/요약/키워드: Hybrid algorithms

검색결과 581건 처리시간 0.029초

Hybrid Genetic Algorithms with Conditional Local Search

  • Yun, Young-Su;Seo, Seung-Lock;Kim, Jong-Hwan;Chiung Moon
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.183-186
    • /
    • 2003
  • Hybrid genetic algorithms (HGAs) have been studied as various ways. These HGAs usually use both the global search property of genetic algorithm (GA) and the local search one of local search techniques. One of the general types, when constructing HGAs, is to incorporate a local search technique into GA loop, and then the local search technique is repeated as many iteration number as the loop. This paper proposes a new HGA with a conditional local search technique (c-HGA) that does not be repeated as many iteration number as GA loop. For effectiveness of the proposed c-HGA, a conventional HGA and GA are also suggested, and then these algorithms are compared with each other in numerical examples,

  • PDF

계층적 경쟁기반 병렬 유전자 알고리즘을 이용한 퍼지집합 퍼지모델의 최적화 (Optimization of Fuzzy Set Fuzzy Model by Means of Hierarchical Fair Competition-based Parallel Genetic Algorithms)

  • 최정내;오성권;황형수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 D
    • /
    • pp.2097-2098
    • /
    • 2006
  • In this study, we introduce the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA). HFCGA is a kind of multi-populations of Parallel Genetic Algorithms(PGA), and it is used for structure optimization and parameter identification of fuzzy set model. It concerns the fuzzy model-related parameters as the number of input variables, a collection of specific subset of input variables, the number of membership functions, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. The structural optimization is realized via HFCGA 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

구조적 설계문제 최적화를 위한 혼합유전알고리즘 (Hybrid Genetic Algorithm for Optimizing Structural Design Problems)

  • 윤영수;이상용
    • 한국경영과학회지
    • /
    • 제23권3호
    • /
    • pp.1-15
    • /
    • 1998
  • Genetic algorithms(GAs) are suited for solving structural design problems, since they handle the design variables efficiently. This ability of GAs considers then as a good choice for optimization problems. Nevertheless, there are many situations that the conventional genetic algorithms do not perform particularly well, and so various methods of hybridization have been proposed. Thus. this paper develops a hybrid genetic algorithm(HGA) to incorporate a local convergence method and precision search method around optimum in the genetic algorithms. In case study. it is showed that HGA is able consistently to provide efficient, fine quality solutions and provide a significant capability for solving structural design problems.

  • PDF

구조최적화를 위한 분산 복합 유전알고리즘 (Distributed Hybrid Genetic Algorithms for Structural Optimization)

  • 우병헌;박효선
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2002년도 가을 학술발표회 논문집
    • /
    • pp.203-210
    • /
    • 2002
  • The great advantages on the Genetic Algorithms(GAs) are ease of implementation, and robustness in solving a wide variety of problems, several GAs based optimization models for solving complex structural problems were proposed. However, there are two major disadvantages in GAs. The first disadvantage, implementation of GAs-based optimization is computationally too expensive for practical use in the field of structural optimization, particularly for large-scale problems. The second problem is too difficult to find proper parameter for particular problem. Therefore, in this paper, a Distributed Hybrid Genetic Algorithms(DHGAs) is developed for structural optimization on a cluster of personal computers. The algorithm is applied to the minimum weight design of steel structures.

  • PDF

Kinodynamic Motion Planning with Artificial Wavefront Propagation

  • Ogay, Dmitriy;Kim, Eun-Gyung
    • Journal of information and communication convergence engineering
    • /
    • 제11권4호
    • /
    • pp.274-281
    • /
    • 2013
  • In this study, we consider the challenges in motion planning for automated driving systems. Most of the existing online motion-planning algorithms, which take dynamics into account, find it difficult to operate in an environment with narrow passages. Some of the existing algorithms overcome this by offline preprocessing if environment is known. In this work an online algorithm for motion planning with dynamics in an unknown cluttered environment with narrow passages is presented. It utilizes an idea of hybrid planning with sampling- and discretization-based motion planners, which run simultaneously in a full configuration space and a derived reduced space. The proposed algorithm has been implemented and tested with a real autonomous vehicle. It provides significant improvements in computational time performance over basic planning algorithms and allows the generation of smoother paths than those generated by the recently developed hybrid motion planners.

강인 복합제어 시스템 (Robust Hybrid Control System)

  • 박규식;정형조;오주원;이인원
    • 한국지진공학회:학술대회논문집
    • /
    • 한국지진공학회 2003년도 추계 학술발표회논문집
    • /
    • pp.442-449
    • /
    • 2003
  • This paper presents a robust hybrid control system for seismic response control of a cable-stayed bridge. Because multiple control devices are operating, a hybrid control system could alleviate some of restirctions and limitations that exist when each system is acting alone. A LQG algorithm with on-off control scheme, H$_2$ and H$_{\infty}$ control algorithms with various frequency weighting filters are used to improve the controller robustness of the active control part in the hybrid control system. The numerital simulation results show that control performances of robust hybrid control systems are similar to those of the hybrid control system with LQG algorithm. Furthermore, it is verified that robust hybrid control systems are more robust than the hybrid control system with LQG algorithm and there are no signs of instabilities in the $\pm$5% stiffness matrix perturbed system. Therefore, the proposed hybrid control system have a good robustness for stiffness matrix perturbation without loss of control effectiveness.

  • PDF

상수관망 최적설계를 위한 Modified Hybrid Vision Correction Algorithm의 적용 (Application of modified hybrid vision correction algorithm for an optimal design of water distribution system)

  • 류용민;이의훈
    • 한국수자원학회논문집
    • /
    • 제54권7호
    • /
    • pp.475-484
    • /
    • 2021
  • 상수관망의 최적설계는 절점의 최소 요구 수압을 만족함뿐만 아니라 관로비용의 최소화 등을 목적으로 한다. 상수관망 설계안의 수는 다양한 관의 배치로 인해 기하급수적으로 증가한다. 상수관망 설계에서 최적화된 설계를 제안하기 위해 다양한 최적화 알고리즘들이 적용되었다. 본 연구에서는 상수관망 최적설계에 자가적응형 매개변수를 개선한 Modified Hybrid Vision Correction Algorithm (MHVCA)을 적용하였다. 기존 Hybrid Vision Correction Algorithm (HVCA)의 Hybrid Rate (HR)를 비선형적 HR로 수정하여 성능을 개선하였다. 제안된 MHVCA의 성능을 확인하기 위해 결정변수가 2개 및 30개로 구성된 수학문제와 제약조건이 있는 수학문제에 적용하였다. MHVCA의 적용결과를 검토하기 위해 Harmony Search (HS), Improved Harmony Search (IHS), Vision Correction Algorithm (VCA) 및 HVCA와 비교하였다. 최종적으로 MHVCA를 상수관망 최적설계 문제에 적용하여 결과를 다른 알고리즘들과 비교하였다. 수학문제 및 상수관망 설계 문제에서 MHVCA가 다른 알고리즘들에 비해 좋은 결과를 보여주었다. MHVCA는 본 연구에서 적용한 문제뿐만 아니라 다양한 수자원공학 문제에 적용하여 좋은 결과를 보여줄 수 있을 것이다.

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

  • 한창욱;박정일
    • 제어로봇시스템학회논문지
    • /
    • 제7권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

ARIMA모델 기반 생활 기상지수를 이용한 동·하계 최대 전력 수요 예측 알고리즘 개발 (Development of ARIMA-based Forecasting Algorithms using Meteorological Indices for Seasonal Peak Load)

  • 정현철;정재성;강병오
    • 전기학회논문지
    • /
    • 제67권10호
    • /
    • pp.1257-1264
    • /
    • 2018
  • This paper proposes Autoregressive Integrated Moving Average (ARIMA)-based forecasting algorithms using meteorological indices to predict seasonal peak load. First of all, this paper observes a seasonal pattern of the peak load that appears intensively in winter and summer, and generates ARIMA models to predict the peak load of summer and winter. In addition, this paper also proposes hybrid ARIMA-based models (ARIMA-Hybrid) using a discomfort index and a sensible temperature to enhance the conventional ARIMA model. To verify the proposed algorithm, both ARIMA and ARIMA-Hybrid models are developed based on peak load data obtained from 2006 to 2015 and their forecasting results are compared by using the peak load in 2016. The simulation result indicates that the proposed ARIMA-Hybrid models shows the relatively improved performance than the conventional ARIMA model.

Efficient Hybrid Transactional Memory Scheme using Near-optimal Retry Computation and Sophisticated Memory Management in Multi-core Environment

  • Jang, Yeon-Woo;Kang, Moon-Hwan;Chang, Jae-Woo
    • Journal of Information Processing Systems
    • /
    • 제14권2호
    • /
    • pp.499-509
    • /
    • 2018
  • Recently, hybrid transactional memory (HyTM) has gained much interest from researchers because it combines the advantages of hardware transactional memory (HTM) and software transactional memory (STM). To provide the concurrency control of transactions, the existing HyTM-based studies use a bloom filter. However, they fail to overcome the typical false positive errors of a bloom filter. Though the existing studies use a global lock, the efficiency of global lock-based memory allocation is significantly low in multi-core environment. In this paper, we propose an efficient hybrid transactional memory scheme using near-optimal retry computation and sophisticated memory management in order to efficiently process transactions in multi-core environment. First, we propose a near-optimal retry computation algorithm that provides an efficient HTM configuration using machine learning algorithms, according to the characteristic of a given workload. Second, we provide an efficient concurrency control for transactions in different environments by using a sophisticated bloom filter. Third, we propose a memory management scheme being optimized for the CPU cache line, in order to provide a fast transaction processing. Finally, it is shown from our performance evaluation that our HyTM scheme achieves up to 2.5 times better performance by using the Stanford transactional applications for multi-processing (STAMP) benchmarks than the state-of-the-art algorithms.