• Title/Summary/Keyword: hybrid genetic algorithm

Search Result 416, Processing Time 0.029 seconds

A Study on the Efficient Optimization Method by Coupling Genetic Algorithm and Direct Search Method (유전적 알고리즘과 직접탐색법의 결합에 의한 효율적인 최적화방법에 관한 연구)

  • D.K. Lee;S.J. Jeong;S.Y. Kim
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.31 no.3
    • /
    • pp.12-18
    • /
    • 1994
  • Optimization in the engineering design is to select the best of many possible design alternatives in a complex design space. In order to optimize, various optimization methods have been used. One major problem of traditional optimization methods is that they often result in local optima. Recently genetic algorithm based on the mechanics of natural selection and natural genetics is used in many application fields for optimization. Genetic algorithm is more powerful to local optima, but it requires more calculation time and has difficulties in finding exact optimum point in design variable with real data type generally. In this paper. hybrid method was developed by coupling genetic algorithm and traditional direct search method. The developed method finds out a region for global optimum using genetic algorithm, and is to search global optimum using direct search method based on results obtained from genetic algorithm. By using hybrid method, calculation time is reduced and search efficient for optimum point is increased.

  • PDF

A Cellular Learning Strategy for Local Search in Hybrid Genetic Algorithms (복합 유전자 알고리즘에서의 국부 탐색을 위한 셀룰러 학습 전략)

  • Ko, Myung-Sook;Gil, Joon-Min
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.669-680
    • /
    • 2001
  • Genetic Algorithms are optimization algorithm that mimics biological evolution to solve optimization problems. Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex fitness landscapes. Hybrid genetic algorithm that is combined with local search called learning can sustain the balance between exploration and exploitation. The genetic traits that each individual in the population learns through evolution are transferred back to the next generation, and when this learning is combined with genetic algorithm we can expect the improvement of the search speed. This paper proposes a genetic algorithm based Cellular Learning with accelerated learning capability for function optimization. Proposed Cellular Learning strategy is based on periodic and convergent behaviors in cellular automata, and on the theory of transmitting to offspring the knowledge and experience that organisms acquire in their lifetime. We compared the search efficiency of Cellular Learning strategy with those of Lamarckian and Baldwin Effect in hybrid genetic algorithm. We showed that the local improvement by cellular learning could enhance the global performance higher by evaluating their performance through the experiment of various test bed functions and also showed that proposed learning strategy could find out the better global optima than conventional method.

  • PDF

Particle Swarm Assisted Genetic Algorithm for the Optimal Design of Flexbeam Sections

  • Dhadwal, Manoj Kumar;Lim, Kyu Baek;Jung, Sung Nam;Kim, Tae Joo
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.4
    • /
    • pp.341-349
    • /
    • 2013
  • This paper considers the optimum design of flexbeam cross-sections for a full-scale bearingless helicopter rotor, using an efficient hybrid optimization algorithm based on particle swarm optimization, and an improved genetic algorithm, with an effective constraint handling scheme for constrained nonlinear optimization. The basic operators of the genetic algorithm, of crossover and mutation, are revisited, and a new rank-based multi-parent crossover operator is utilized. The rank-based crossover operator simultaneously enhances both the local, and the global exploration. The benchmark results demonstrate remarkable improvements, in terms of efficiency and robustness, as compared to other state-of-the-art algorithms. The developed algorithm is adopted for two baseline flexbeam section designs, and optimum cross-section configurations are obtained with less function evaluations, and less computation time.

Hybrid Fuzzy Controller Based on Control Parameter Estimation Mode Using Genetic Algorithms (유전자 알고리즘을 이용한 제어파라미터 추정모드기반 HFC)

  • Lee, Dae-Keun;Oh, Sung-Kwun;Jang, Sung-Whan
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2545-2547
    • /
    • 2000
  • In this paper, a hybrid fuzzy controller using genetic algorithm based on parameter estimation mode to obtain optimal control parameter is presented. First, The control input for the system in the HFC is a convex combination of the FLC's output in transient state and PID's output in steady state by a fuzzy variable, namely, membership function of weighting coefficient. Second, genetic algorithms is presented to automatically improve the performance of hybrid fuzzy controller utilizing the conventional methods for finding PID parameters and estimation mode of scaling factor. The algorithms estimates automatically the optimal values of scaling factors, PID parameters and membership function parameters of fuzzy control rules according to the rate of change and limitation condition of control input. Computer simulations are conducted to evaluate the performance of proposed hybrid fuzzy controller. ITAE, overshoot and rising time are used as a performance index of controller.

  • PDF

Optimization of the fuzzy model using the clustering and hybrid algorithms (클러스터링 및 하이브리드 알고리즘을 이용한 퍼지모델의 최적화)

  • Park, Byoung-Jun;Yoon, Ki-Chan;Oh, Sung-Kwun;Jang, Seong-Whan
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2908-2910
    • /
    • 1999
  • In this paper, a fuzzy model is identified and optimized using the hybrid algorithm and HCM clustering method. Here, the hybrid algorithm is carried out as the structure combined with both a genetic algorithm and the improved complex method. The one is utilized for determining the initial parameters of membership function, the other for obtaining the fine parameters of membership function. HCM clustering algorithm is used to determine the confined region of initial parameters and also to avoid overflow phenomenon during auto-tuning of hybrid algorithm. And the standard least square method is used for the identification of optimum consequence parameters of fuzzy model. Two numerical examples are shown to evaluate the performance of the proposed model.

  • PDF

Fuzzy neural network modeling using hyper elliptic gaussian membership functions (초타원 가우시안 소속함수를 사용한 퍼지신경망 모델링)

  • 권오국;주영훈;박진배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.442-445
    • /
    • 1997
  • We present a hybrid self-tuning method of fuzzy inference systems with hyper elliptic Gaussian membership functions using genetic algorithm(GA) and back-propagation algorithm. The proposed self-tuning method has two phases : one is the coarse tuning process based on GA and the other is the fine tuning process based on back-propagation. But the parameters which is obtained by a GA are near optimal solutions. In order to solve the problem in GA applications, it uses a back-propagation algorithm, which is one of learning algorithms in neural networks, to finely tune the parameters obtained by a GA. We provide Box-Jenkins time series to evaluate the advantage and effectiveness of the proposed approach and compare with the conventional method.

  • PDF

Distributed Database Design using Evolutionary Algorithms

  • Tosun, Umut
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.430-435
    • /
    • 2014
  • The performance of a distributed database system depends particularly on the site-allocation of the fragments. Queries access different fragments among the sites, and an originating site exists for each query. A data allocation algorithm should distribute the fragments to minimize the transfer and settlement costs of executing the query plans. The primary cost for a data allocation algorithm is the cost of the data transmission across the network. The data allocation problem in a distributed database is NP-complete, and scalable evolutionary algorithms were developed to minimize the execution costs of the query plans. In this paper, quadratic assignment problem heuristics were designed and implemented for the data allocation problem. The proposed algorithms find near-optimal solutions for the data allocation problem. In addition to the fast ant colony, robust tabu search, and genetic algorithm solutions to this problem, we propose a fast and scalable hybrid genetic multi-start tabu search algorithm that outperforms the other well-known heuristics in terms of execution time and solution quality.

A Distributed Hybrid Algorithm for Glass Cutting (유리재단 문제에 대한 분산 합성 알고리즘)

  • Hong, Chuleui
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.343-349
    • /
    • 2018
  • The proposed hybrid algorithm combines the benefits of rapid convergence property of mean filed annealing(MFA) and the effective genetic operations of simulated annealing-like genetic algorithm(SGA). This algorithm is applied to the isotropic material stock cutting problem, especially to glass cutting in distributed computing environments base on MPI called message passing interface. The glass cutting is to place the required rectangular patterns to the given large glass sheets resulting in reducing the wasted scrap area. Our experimental results show that the heuristic method improves the performance over the conventional ones by decreasing the scrap area and maximum execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential one while it achieves almost linear speedup as the problem size increases.

Hybrid Model Approach to the Complexity of Stock Trading Decisions in Turkey

  • CALISKAN CAVDAR, Seyma;AYDIN, Alev Dilek
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.7 no.10
    • /
    • pp.9-21
    • /
    • 2020
  • The aim of this paper is to predict the Borsa Istanbul (BIST) 30 index movements to determine the most accurate buy and sell decisions using the methods of Artificial Neural Networks (ANN) and Genetic Algorithm (GA). We combined these two methods to obtain a hybrid intelligence method, which we apply. In the financial markets, over 100 technical indicators can be used. However, several of them are preferred by analysts. In this study, we employed nine of these technical indicators. They are moving average convergence divergence (MACD), relative strength index (RSI), commodity channel index (CCI), momentum, directional movement index (DMI), stochastic oscillator, on-balance volume (OBV), average directional movement index (ADX), and simple moving averages (3-day moving average, 5-day moving average, 10-day moving average, 14-day moving average, 20-day moving average, 22-day moving average, 50-day moving average, 100-day moving average, 200-day moving average). In this regard, we combined these two techniques and obtained a hybrid intelligence method. By applying this hybrid model to each of these indicators, we forecast the movements of the Borsa Istanbul (BIST) 30 index. The experimental result indicates that our best proposed hybrid model has a successful forecast rate of 75%, which is higher than the single ANN or GA forecasting models.

Development of a Fuzzy-Genetic Algorithm-based Incident Detection Model with Self-adaptation Capability (Fuzzy-Genetic Algorithm기반의 자가적응형 돌발상황 검지모형 개발 연구)

  • Lee, Si-Bok;Kim, Young-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.4 s.75
    • /
    • pp.159-173
    • /
    • 2004
  • This study utilizes the fuzzy logic and genetic algorithm to improve the existing incident detection models by addressing the problems associated with "crisp" thresholds and model transferability (applicability). The model's major components were designed to be a set of the fuzzy inference engines, and for the self-adaptation capability the genetic algorithm was introduced in optimization(or training) of the fuzzy membership functions. This approach is often called "the hybrid of fuzzy-genetic algorithm" The model performance was tested and found to be compatible with that of the existing well-recognized models in terms of performance measures such as detection rate, false alarm rate, and detection time. This study was not an effort for simple improvement of the model performance, but an experimental attempt to incorporate new characteristics essential for the incident detection model to be universally applicable for various roadway and traffic conditions. The study results prove that the initial objective of the study was satisfied, and suggest a direction that the future research work in this area must follow.