• Title/Summary/Keyword: Genetic algorithm (GA)

Search Result 1,517, Processing Time 0.036 seconds

A Genetic Algorithm for a Multiple Objective Sequencing Problem in Mixed Model Assembly Lines (혼합모델 조립라인의 다목적 투입순서 문제를 위한 유전알고리즘)

  • Hyun, Chul-Ju;Kim, Yeo-Keun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.4
    • /
    • pp.533-549
    • /
    • 1996
  • This paper is concerned with a sequencing problem in mixed model assembly lines, which is important to efficient utilization of the lines. In the problem, we deal with the two objectives of minimizing the risk of stoppage and leveling part usage, and consider sequence-dependent setup time. In this paper, we present a genetic algorithm(GA) suitable for the multi-objective optimization problem. The aim of multi-objective optimization problems is to find all possible non-dominated solutions. The proposed algorithm is compared with existing multi-objective GAs such as vector evaluated GA, Pareto GA, and niched Pareto GA. The results show that our algorithm outperforms the compared algorithms in finding good solutions and diverse non-dominated solutions.

  • PDF

A Shaking Optimization Algorithm for Solving Job Shop Scheduling Problem

  • Abdelhafiez, Ehab A.;Alturki, Fahd A.
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.1
    • /
    • pp.7-14
    • /
    • 2011
  • In solving the Job Shop Scheduling Problem, the best solution rarely is completely random; it follows one or more rules (heuristics). The Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing, and Tabu search, which belong to the Evolutionary Computations Algorithms (ECs), are not efficient enough in solving this problem as they neglect all conventional heuristics and hence they need to be hybridized with different heuristics. In this paper a new algorithm titled "Shaking Optimization Algorithm" is proposed that follows the common methodology of the Evolutionary Computations while utilizing different heuristics during the evolution process of the solution. The results show that the proposed algorithm outperforms the GA, PSO, SA, and TS algorithms, while being a good competitor to some other hybridized techniques in solving a selected number of benchmark Job Shop Scheduling problems.

New design of variable structure control based on lightning search algorithm for nuclear reactor power system considering load-following operation

  • Elsisi, M.;Abdelfattah, H.
    • Nuclear Engineering and Technology
    • /
    • v.52 no.3
    • /
    • pp.544-551
    • /
    • 2020
  • Reactor control is a standout amongst the most vital issues in the nuclear power plant. In this paper, the optimal design of variable structure controller (VSC) based on the lightning search algorithm (LSA) is proposed for a nuclear reactor power system. The LSA is a new optimization algorithm. It is used to find the optimal parameters of the VSC instead of the trial and error method or experts of the designer. The proposed algorithm is used for the tuning of the feedback gains and the sliding equation gains of the VSC to prove a good performance. Furthermore, the parameters of the VSC are tuned by the genetic algorithm (GA). Simulation tests are carried out to verify the performance and robustness of the proposed LSA-based VSC compared with GA-based VSC. The results prove the high performance and the superiority of VSC based on LSA compared with VSC based on GA.

An integrated approach for optimum design of HPC mix proportion using genetic algorithm and artificial neural networks

  • Parichatprecha, Rattapoohm;Nimityongskul, Pichai
    • Computers and Concrete
    • /
    • v.6 no.3
    • /
    • pp.253-268
    • /
    • 2009
  • This study aims to develop a cost-based high-performance concrete (HPC) mix optimization system based on an integrated approach using artificial neural networks (ANNs) and genetic algorithms (GA). ANNs are used to predict the three main properties of HPC, namely workability, strength and durability, which are used to evaluate fitness and constraint violations in the GA process. Multilayer back-propagation neural networks are trained using the results obtained from experiments and previous research. The correlation between concrete components and its properties is established. GA is employed to arrive at an optimal mix proportion of HPC by minimizing its total cost. A system prototype, called High Performance Concrete Mix-Design System using Genetic Algorithm and Neural Networks (HPCGANN), was developed in MATLAB. The architecture of the proposed system consists of three main parts: 1) User interface; 2) ANNs prediction models software; and 3) GA engine software. The validation of the proposed system is carried out by comparing the results obtained from the system with the trial batches. The results indicate that the proposed system can be used to enable the design of HPC mix which corresponds to its required performance. Furthermore, the proposed system takes into account the influence of the fluctuating unit price of materials in order to achieve the lowest cost of concrete, which cannot be easily obtained by traditional methods or trial-and-error techniques.

Study of Connection Process in Distribution systems using Genetic Algorithm (배전계통에서 GA를 이용한 접속변경 순서 결정 방법)

  • Oh, Seon;Seo, Jeong-Kap
    • Journal of Satellite, Information and Communications
    • /
    • v.6 no.1
    • /
    • pp.6-11
    • /
    • 2011
  • In this paper presents a new approach to evaluate reliability indices of electric distribution systems using genetic Algorithm (GA). The use of reliability evaluation is an important aspect of distribution system planning and operation to adjust the reliability level of each area. In this paper, the reliability model is based on the optimal load transferring problem to minimize load generated load point outage in each sub-section. This approach is one of the most difficult procedures and become combination problems. A new approach using GA was developed for this problem. GA is a general purpose optimization technique based on principles inspired from the biological evolution using metaphors of mechanisms such as natural selection, genetic recombination and survival of the fittest. Test results for the model system with 24 nodes 29 branches are reported in the paper.

FE MODEL UPDATING OF ROTOR SHAFT USING OPTIMIZATION TECHNIQUES (최적화 기법을 이용한 로터 축 유한요소모델 개선)

  • Kim, Yong-Han;Feng, Fu-Zhou;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.104-108
    • /
    • 2003
  • Finite element (FE) model updating is a procedure to minimize the differences between analytical and experimental results, which can be usually posed as an optimization problem. This paper aims to introduce a hybrid optimization algorithm (GA-SA), which consists of a Genetic algorithm (GA) stage and an Adaptive Simulated Annealing (ASA) stage, to FE model updating for a shrunk shaft. A good agreement of the first four natural frequencies has been achieved obtained from GASA based updated model (FEgasa) and experiment. In order to prove the validity of GA-SA, comparisons of natural frequencies obtained from the initial FE model (FEinit), GA based updated model (FEga) and ASA based updated model (FEasa) are carried out. Simultaneously, the FRF comparisons obtained from different FE models and experiment are also shown. It is concluded that the GA, ASA, GA-SA are powerful optimization techniques which can be successfully applied to FE model updating, the natural frequencies and FRF obtained from all the updated models show much better agreement with experiment than that obtained from FEinit model. However, FEgasa is proved to be the most reasonable FE model, and also FEasa model is better than FEga model.

  • PDF

The Generation Organization Technique Removing Redundancy of Chromosome on Genetic Algorithm for Symmetric Traveling Salesman Problem (Symmetric Traveling Salesman Problem을 풀기 위한 Genetic Algorithm에서 유전자의 중복을 제거한 세대 구성 방법)

  • 김행수;정태층
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.9-11
    • /
    • 1999
  • 조합 최적화 문제인 Traveling Salesman problems(TSP)을 Genetic Algorithm(GA)과 Local Search Heuristic인 Lin-Kernighan(LK) Heuristic[2]을 이용하여 접근하는 것은 최적해를 구하기 위해 널리 알려진 방법이다. 이 논문에서는 LK를 이용하여 주어진 TSP 문제에서 Local Optima를 찾고, GA를 이용하여 Local Optimal를 바탕으로 Global Optima를 찾는데 이용하게 된다. 여기서 이런 GA와 LK를 이용하여 TSP 문제를 풀 경우 해가 점점 수렴해가면서 중복된 유전자가 많이 생성된다. 이런 중복된 유전자를 제거함으로써 탐색의 범위를 보다 넓고 다양하게 검색하고, 더욱 효율적으로 최적화를 찾아내는 방법에 대해서 논하겠다. 이런 방법을 이용하여 rat195, gil262, lin318의 TSP문제에서 효율적으로 수행된다.

  • PDF

A study of selection operator using distance information between individuals in genetic algorithm

  • Ito, Minoru;Sugisaka, Masanori
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1521-1524
    • /
    • 2003
  • In this paper, we propose a "Distance Correlation Selection operator (DCS)" as a new selection operator. For Genetic Algorithm (GA), many improvements have been proposed. The MGG (Minimal Generation Gap) model proposed by Satoh et.al. shows good performance. The MGG model has all advantages of conventional models and the ability of avoiding the premature convergence and suppressing the evolutionary stagnation. The proposed method is an extension of selection operator in the original MGG model. Generally, GA has two types of selection operators, one is "selection for reproduction", and the other is "selection for survival"; the former is for crossover and the latter is the individuals which survive to the next generation. The proposed method is an extension of the former. The proposed method utilizes distance information between individuals. From this extension, the proposed method aims to expand a search area and improve ability to search solution. The performance of the proposed method is examined with several standard test functions. The experimental results show good performance better than the original MGG model.

  • PDF

Motion Control of Inchworm using Input Shaping and Genetic Algorithm (입력 성형과 유전 알고리즘에 의한 자벌레 운동제어)

  • Kim, In-Soo;Kim, Ki-Bum;Park, Seung-Min
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.26 no.3
    • /
    • pp.313-319
    • /
    • 2017
  • This study presents a genetic algorithm (GA) to design a PID controller systematically for an inchworm operated by piezoelectric actuators. The performance index considering overshoot and settling time is adopted to search an optimal PID gain using GA. The piezoelectric actuator shows nonlinear characteristics including hysteresis and residual displacement. The PID feedback system combined with an integrator is used to improve the ability of tracking the complex input signals and suppressing the steady state error. The PID controller tuned by GA can track the various motion contours effectively. However, the PID controller shows an improper residual vibration under the application of high-frequency square input. The input shaper combined with the feedback system can overcome this limitation of the PID controller.

Genetic Algorithm based Relevance Feedback for Content-based Image Retrieval

  • Seo, Kwang-Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.7 no.4
    • /
    • pp.13-18
    • /
    • 2008
  • This paper explores a content-based image retrieval framework with relevance feedback based on genetic algorithm (GA). This framework adopts GA to learn the user preferences using the similarity functions defined for all available descriptors. The objective of the GA-based learning methods is to learn the user preferences using the similarity functions and to find a descriptor combination function that best represents the user perception. Experiments were performed to validate the proposed frameworks. The experiments employed the natural image databases and color and texture descriptors to represent the content of database images. The proposed frameworks were compared with the other two relevance feedback methods regarding effectiveness in image retrieval tasks. Experiment results demonstrate the superiority of the proposed method.

  • PDF