• Title/Summary/Keyword: hybrid genetic algorithms

Search Result 165, Processing Time 0.023 seconds

국소수렴기법과 정밀탐색법을 이용한 혼합유전알고리즘

  • 윤영수;이상용
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.2 no.1
    • /
    • pp.1-17
    • /
    • 1997
  • Genetic algorithms have proved to be a versatile and effectvie approach for solving optimization problems. Nevertheless, there are many situations that the genetic algorithm does not perform particularly well, and so various methods of hybridization have been proposed. Thus, this paper develop a hybrid method and a precision search method around optimum in the gentic algorithm and the conventional optimization techniques in finding global or near optimum.

Local zooming genetic algorithm and its application to radial gate support problems

  • Kwon, Young-Doo;Jin, Seung-Bo;Kim, Jae-Yong;Lee, Il-Hee
    • Structural Engineering and Mechanics
    • /
    • v.17 no.5
    • /
    • pp.611-626
    • /
    • 2004
  • On the basis of a structural analysis of radial gate (i.e. Tainter gate), the current paper focuses on weight minimization according to the location of the arms on a radial gate. In spite of its economical significance, there are hardly any previous studies on the optimum design of radial gate. Accordingly, the present study identifies the optimum position of the support point for a radial gate that guarantees the minimum weight satisfying the strength constraint conditions. This study also identifies the optimum position for 2 or 3 radial arms with a convex cylindrical skin plate relative to a given radius of the skin plate curvature, pivot point, water depth, ice pressure, etc. These optimum designs are then compared with previously constructed radial gates. Local genetic and hybrid-type genetic algorithms are used as the optimum tools to reduce the computing time and enhance the accuracy. The results indicate that the weights of the optimized radial gates are appreciably lower than those of previously constructed gates.

An EMG Signals Classification using Hybrid HMM and MLP Classifier with Genetic Algorithms (유전 알고리즘이 결합된 MLP와 HMM 합성 분류기를 이용한 근전도 신호 인식 기법)

  • 정정수;권장우;류길수
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.1
    • /
    • pp.48-57
    • /
    • 2003
  • This paper describes an approach for classifying myoelectric patterns using a multilayer perceptrons (MLP's) with genetic algorithm and hidden Markov models (HMM's) hybrid classifier. Genetic Algorithms play a role of selecting Multilayer Perceptron's optimized initial connection weights by its typical global search. The dynamic aspects of EMG are important for tasks such as continuous prosthetic control or various time length EMG signal recognition, which have not been successfully mastered by the most neural approaches. It is known that the hidden Markov model (HMM) is suitable for modeling temporal patterns. In contrast, the multilayer feedforward networks are suitable for static patterns. And, a lot of investigators have shown that the HMM's to be an excellent tool for handling the dynamical problems. Considering these facts, we suggest the combination of ANN and HMM algorithms that might lead to further improved EMG recognition systems.

  • PDF

Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows

  • Chamnanlor, Chettha;Sethanan, Kanchana;Chien, Chen-Fu;Gen, Mitsuo
    • Industrial Engineering and Management Systems
    • /
    • v.12 no.4
    • /
    • pp.306-316
    • /
    • 2013
  • The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.

Study on Delivery of Military Drones and Transport UGVs with Time Constraints Using Hybrid Genetic Algorithms (하이브리드 유전 알고리즘을 이용한 시간제약이 있는 군수 드론 및 수송 UGV 혼합배송 문제 연구)

  • Lee, Jeonghun;Kim, Suhwan
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.25 no.4
    • /
    • pp.425-433
    • /
    • 2022
  • This paper studies the method of delivering munitions using both drones and UGVs that are developing along with the 4th Industrial Revolution. While drones are more mobile than UGVs, their loading capacity is small, and UGVs have relatively less mobility than drones, but their loading capacity is better. Therefore, by simultaneously operating these two delivery means, each other's shortcomings may be compensated. In addition, on actual battlefields, time constraints are an important factor in delivering munitions. Therefore, assuming an actual battlefield environment with a time limit, we establish delivery routes that minimize delivery time by operating both drones and UGVs with different capacities and speeds. If the delivery is not completed within the time limit, penalties are imposed. We devised the hybrid genetic algorithm to find solutions to the proposed model, and as results of the experiment, we showed the algorithm we presented solved the actual size problems in a short time.

A developed hybrid method for crack identification of beams

  • Vosoughi, Ali.R.
    • Smart Structures and Systems
    • /
    • v.16 no.3
    • /
    • pp.401-414
    • /
    • 2015
  • A developed hybrid method for crack identification of beams is presented. Based on the Euler-Bernouli beam theory and concepts of fracture mechanics, governing equation of the cracked beams is reformulated. Finite element (FE) method as a powerful numerical tool is used to discritize the equation in space domain. After transferring the equations from time domain to frequency domain, frequencies and mode shapes of the beam are obtained. Efficiency of the governed equation for free vibration analysis of the beams is shown by comparing the results with those available in literature and via ANSYS software. The used equation yields to move the influence of cracks from the stiffness matrix to the mass matrix. For crack identification measured data are produced by applying random error to the calculated frequencies and mode shapes. An objective function is prepared as root mean square error between measured and calculated data. To minimize the function, hybrid genetic algorithms (GAs) and particle swarm optimization (PSO) technique is introduced. Efficiency, Robustness, applicability and usefulness of the mixed optimization numerical tool in conjunction with the finite element method for identification of cracks locations and depths are shown via solving different examples.

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

A Study on the Inverse Analysis of Surface Radiation in a Cylindrical Enclosure (원통형상에서의 표면복사 역해석에 관한 연구)

  • KIm, Ki-Wan;Baek, Seung-Wook;Ryou, Hong-Sun
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.6
    • /
    • pp.705-712
    • /
    • 2004
  • An inverse boundary analysis of surface radiation in an axisymmetric cylindrical enclosure has been conducted in this study. Net energy exchange method was used to calculate the radiative heat flux on each surface, and a hybrid genetic algorithm was adopted to minimize an objective function, which is expressed by sum of square errors between estimated and measured or desired heat fluxes on the design surface. We have examined the effects of the measurement error as well as the number of measurement points on the estimation accuracy. Furthermore, the effect of a variation in one boundary condition on the other boundary conditions was also investigated to get the same desired heat flux and temperature distribution on the design surface.

A Hybrid Method for Improvement of Evolutionary Computation (진화 연산의 성능 개선을 위한 하이브리드 방법)

  • Chung, Jin-Ki;Oh, Se-Young
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.317-322
    • /
    • 2002
  • The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

A Vehicle Routing Problem Which Considers Traffic Situation by Service Time Zones (서비스 시간대별 교통상황을 고려한 차량경로문제)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • IE interfaces
    • /
    • v.22 no.4
    • /
    • pp.359-367
    • /
    • 2009
  • The vehicle travel time between the demand points in downtown area is greatly influenced by complex road condition and traffic situation that change real time to various external environments. Most of research in the vehicle routing problems compose vehicle routes only considering travel distance and average vehicle speed between the demand points, however did not consider dynamic external environments such as traffic situation by service time zones. A realistic vehicle routing problem which considers traffic situation of smooth, delaying, and stagnating by three service time zones such as going to work, afternoon, and going home was suggested in this study. A mathematical programming model was suggested and it gives an optimal solution when using ILOG CPLEX. A hybrid genetic algorithm was also suggested to chooses a vehicle route considering traffic situation to minimize the total travel time. By comparing the result considering the traffic situation, the suggested algorithm gives better solution than existing algorithms.