• 제목/요약/키워드: 2-Phase Genetic Algorithm

검색결과 40건 처리시간 0.024초

다단계 제품 구조를 고려한 유연 잡샵 일정계획의 Large Step Optimization 적용 연구 (Large Step Optimization Approach to Flexible Job Shop Scheduling with Multi-level Product Structures)

  • Jang, Yang-Ja;Kim, Kidong;Park, Jinwoo
    • 한국지능정보시스템학회:학술대회논문집
    • /
    • 한국지능정보시스템학회 2002년도 춘계학술대회 논문집
    • /
    • pp.429-434
    • /
    • 2002
  • For companies assembling end products from sub assemblies or components, MRP (Material Requirement Planning) logic is frequently used to synchronize and pace the production activities for the required parts. However, in MRP, the planning of operational-level activities is left to short term scheduling. So, we need a good scheduling algorithm to generate feasible schedules taking into account shop floor characteristics and multi-level job structures used in MRP. In this paper, we present a GA (Genetic Algorithm) solution for this complex scheduling problem based on a new gene to reflect the machine assignment, operation sequences and the levels of the operations relative to final operation. The relative operation level is the control parameter that paces the completion timing of the components belonging to the same branch in the multi-level job hierarchy. In order to revise the fixed relative level which solutions are confined to, we apply large step transition in the first step and GA in the second step. We compare the genetic algorithm and 2-phase optimization with several dispatching rules in terms of tardiness for about forty modified standard job-shop problem instances.

  • PDF

A Systematic Engineering Approach to Design the Controller of the Advanced Power Reactor 1400 Feedwater Control System using a Genetic Algorithm

  • Tran, Thanh Cong;Jung, Jae Cheon
    • 시스템엔지니어링학술지
    • /
    • 제14권2호
    • /
    • pp.58-66
    • /
    • 2018
  • This paper represents a systematic approach aimed at improving the performance of the proportional integral (PI) controller for the Advanced Power Reactor (APR) 1400 Feedwater Control System (FWCS). When the performance of the PI controller offers superior control and enhanced robustness, the steam generator (SG) level is properly controlled. This leads to the safe operation and increased the availability of the nuclear power plant. In this paper, a systems engineering approach is used in order to design a novel PI controller for the FWCS. In the reverse engineering stage, the existing FWCS configuration, especially the characteristics of the feedwater controller as well as the feedwater flow path to each SG from the FWCS, were reviewed and analysed. The overall block diagram of the FWCS and the SG was also developed in the reverse engineering process. In the re-engineering stage, the actual design of the feedwater PI controller was carried out using a genetic algorithm (GA). Lastly, in the validation and verification phase, the existing PI controller and the PI controller designed using GA method were simulated in Simulink/Matlab. From the simulation results, the GA-PI controller was found to exhibit greater stability than the current controller of the FWCS.

한정 용량 차량 경로 탐색 문제에서 이분 시드 검출 법에 의한 발견적 해법 (The Bisection Seed Detection Heuristic for Solving the Capacitated Vehicle Routing Problem)

  • 고준택;유영훈;조근식
    • 지능정보연구
    • /
    • 제15권1호
    • /
    • pp.1-14
    • /
    • 2009
  • 본 연구에서는 한정 용량 차량 경로탐색 문제(CVRP, Capacitated Vehicle Routing Problem)에서 이분 시드 검출 방법(Bisection Seed Detection)을 이용한 휴리스틱 알고리즘을 제안하였다. 이 알고리즘은 3단계로 구성된다. 1단계에서는 improved sweep 알고리즘을 이용해서 초기 클러스터를 구성한다. 2단계에서는 1단계에서 얻은 각 클러스터에 대하여 이분 시드 검출 법을 이용해서 seed 노드를 선택하고, regret 값에 따라 각 경로에 고객 노드들을 삽입 함으로서 차량 이동 경로를 생성한다. 3단계에서는 tabu 탐색 방법과 노드 교환 알고리즘(node exchange algorithm)을 이용하여 2단계에서 얻어진 각 경로를 더욱 향상 시킨다. 본 논문의 실험에서는 제안된 휴리스틱이 비교적 빠른 시간 내에 최적 근사 값을 얻을 수 있음을 보였으며, 이는 빠른 실행 시간을 요구하는 실 업무에 유용하다.

  • PDF

유전자 알고리즘을 이용한 새로운 무릎 보장구의 최적 설계 (Optimal Design of a Novel Knee Orthosis using a Genetic Algorism)

  • 표상훈;윤정원
    • 제어로봇시스템학회논문지
    • /
    • 제17권10호
    • /
    • pp.1021-1028
    • /
    • 2011
  • The objective of this paper is to optimize the design parameters of a novel mechanism for a robotic knee orthosis. The feature of the proposed knee othosis is to drive a knee joint with independent actuation during swing and stance phases, which can allow an actuator with fast rotation to control swing motions and an actuator with high torque to control stance motions, respectively. The quadriceps device operates in five-bar links with 2-DOF motions during swing phase and is changed to six-bar links during stance phase by the contact motion to the patella device. The hamstring device operates in a slider-crank mechanism for entire gait cycle. The suggested kinematic model will allow a robotic knee orthosis to use compact and light actuators with full support during walking. However, the proposed orthosis must use additional linkages than a simple four-bar mechanism. To maximize the benefit of reducing the actuators power by using the developed kinematic design, it is necessary to minimize total weight of the device, while keeping necessary actuator performances of torques and angular velocities for support. In this paper, we use a SGA (Simple Genetic Algorithm) to minimize sum of total link lengths and motor power by reducing the weight of the novel knee orthosis. To find feasible parameters, kinematic constraints of the hamstring and quadriceps mechanisms have been applied to the algorithm. The proposed optimization scheme could reduce sum of total link lengths to half of the initial value. The proposed optimization scheme can be applied to reduce total weight of general multi-linkages while keeping necessary actuator specifications.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • 한국광학회:학술대회논문집
    • /
    • 한국광학회 2003년도 하계학술발표회
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Performance Improvement of Freight Logistics Hub Selection in Thailand by Coordinated Simulation and AHP

  • Wanitwattanakosol, Jirapat;Holimchayachotikul, Pongsak;Nimsrikul, Phatchari;Sopadang, Apichat
    • Industrial Engineering and Management Systems
    • /
    • 제9권2호
    • /
    • pp.88-96
    • /
    • 2010
  • This paper presents a two-phase quantitative framework to aid the decision making process for effective selection of an efficient freight logistics hub from 8 alternatives in Thailand on the North-South economic corridor. Phase 1 employs both multiple regression and Pearson Feature selection to find the important criteria, as defined by logistics hub score, and to reduce number of criteria by eliminating the less important criteria. The result of Pearson Feature selection indicated that only 5 of 15 criteria affected the logistics hub score. Moreover, Genetic Algorithm (GA) was constructed from original 15 criteria data set to find the relationship between logistics criteria and freight logistics hub score. As a result, the statistical tools are provided the same 5 important criteria, affecting logistics hub score from GA, and data mining tool. Phase 2 performs the fuzzy stochastic AHP analysis with the five important criteria. This approach could help to gain insight into how the imprecision in judgment ratios may affect their alternatives toward the best solution and how the best alternative may be identified with certain confidence. The main objective of the paper is to find the best alternative for selecting freight logistics hub under proper criteria. The experimental results show that by using this approach, Chiang Mai province is the best place with the confidence interval 95%.

성과기반 군수지원체계의 정비정책 최적화를 위한 PIDO 기법 적용에 관한 연구 (A Study on the Application of PIDO Technique for the Maintenance Policy Optimization Considering the Performance-Based Logistics Support System)

  • 주현준;이재천
    • 한국산학기술학회논문지
    • /
    • 제15권2호
    • /
    • pp.632-637
    • /
    • 2014
  • 무기체계에 대한 군수지원 방법으로 성과중심 군수지원체계가 최근에 많은 관심을 끌고 있다. 기본개념은 운용단계에서의 민수계약으로 군수지원을 제공하게 되는데, 체계개발단계부터 군수지원요소가 결정되는 것이 필요하다. 또한 기존의 단일 성과지표로부터 확장하여 복수의 성과지표를 고려할 필요가 있다. 시스템 구조가 복잡해짐에 따라 기존 최적화기법의 적용에 제약이 존재하므로 유전자 알고리즘의 적용 가능성 판단이 요구된다. 본 연구에서는 운용단계 이전 체계개발단계에서부터의 성과기반군수지원 개념을 고려한 수리수준분석을 위한 요구사항을 식별한다. 또한, 운용단계 이전에 사용자의 요구사항에 따른 정비정책 대안 결정을 위하여 성과지표 설정 및 제약조건 변경이 용이한 PIDO 기반의 최적화 기법 적용 방안을 제시한다. PIDO 개념을 적용하고 있는 PIAnO와 ModelCenter 도구의 유전자 알고리즘이 정비정책 최적화 문제에 적용 가능함을 확인하였다.

EM 알고리듬을 이용한 단일염기변이 (SNP;SINGLE NUCLEOTIDE POLYMORPHISM)군의 일배체형 (HAPLOTYPE) 비율 추정 (Estimation of Haplotype Proportions in Single Necleotide Polymorphism Group Using EM Algorithm)

  • 김선우;김종원;이경아
    • 응용통계연구
    • /
    • 제16권2호
    • /
    • pp.195-202
    • /
    • 2003
  • 복합성유전질환 연구에 있어서 단일염기변이를 이용한 일배체형 분석은 개별적인 단일염기변이 분석에 비하여 비용 및 효율 면에서 훨씬 유용하며, 생물학적으로도 기능적 중요성을 갖는 것으로 평가되고 있다. 그러나 일반적인 유전형분석방법을 이용한 단일염기변이군 자료는 이배체형(diploid)으로서 위상(phase)을 확인할 수 없으므로 일배체형 비율을 예측하기 어렵다. 본 연구에서는 고형종양 환자군과 정상군의 단일염기변이군 이배체형 자료가 주어졌을 때 단일염기변이군 일배체형 비율의 우도함수에 EM알고리듬을 적용하여 각 일배체형의 비율을 추정하였다. 이로부터 단일염기변이간의 연관불균형(linkage disequilibrium)을 분석하여 고형 종양과 연관 가능성이 있는 단일염기변이를 살펴보았다.

니칭 유전 알고리즘을 이용한 어레이 안테나의 방사패턴 합성 (Beam Forming of Array Antenna Using Niching Genetic Algorithm)

  • 강노원;이정엽;정현교;천창율
    • 정보통신설비학회논문지
    • /
    • 제2권1호
    • /
    • pp.30-36
    • /
    • 2003
  • 최근 기계적으로 빔을 움직일 수 있는 마이크로 스트립 패치 배열 안테나가 MEMS 기술을 이용해서 제작되고 시험되었다. 본 논문에서는, 제작된 안테나의 적용 예로써 위상변위기를 사용하지 않는 새로운 어레이 안테나의 방사패턴 합성방법을 제안하고, 제안된 방법을 원하는 빔 형상합성에 적용하였다. 방사패턴 형상의 최적화에는 Restricted Competition Selection (RCS)를 이용한 니칭 유전 알고리즘을 이용하였다. 또한 이러한 방식의 접근은 EMC 표준에 대처하기 위한 배열 안테나의 설계 시에도 적용이 가능하며, 제안된 방법을 이용하여 특정한 빔 형상들에 대한 합성이 가능하다.

  • PDF

Two-stage crack identification in an Euler-Bernoulli rotating beam using modal parameters and Genetic Algorithm

  • Belen Munoz-Abella;Lourdes Rubio;Patricia Rubio
    • Smart Structures and Systems
    • /
    • 제33권2호
    • /
    • pp.165-175
    • /
    • 2024
  • Rotating beams play a crucial role in representing complex mechanical components that are prevalent in vital sectors like energy and transportation industries. These components are susceptible to the initiation and propagation of cracks, posing a substantial risk to their structural integrity. This study presents a two-stage methodology for detecting the location and estimating the size of an open-edge transverse crack in a rotating Euler-Bernoulli beam with a uniform cross-section. Understanding the dynamic behavior of beams is vital for the effective design and evaluation of their operational performance. In this regard, modal parameters such as natural frequencies and eigenmodes are frequently employed to detect and identify damages in mechanical components. In this instance, the Frobenius method has been employed to determine the first two natural frequencies and corresponding eigenmodes associated with flapwise bending vibration. These calculations have been performed by solving the governing differential equation that describes the motion of the beam. Various parameters have been considered, such as rotational speed, beam slenderness, hub radius, and crack size and location. The effect of the crack has been replaced by a rotational spring whose stiffness represents the increase in local flexibility as a result of the damage presence. In the initial phase of the proposed methodology, a damage index utilizing the slope of the beam's eigenmode has been employed to estimate the location of the crack. After detecting the presence of damage, the size of the crack is determined using a Genetic Algorithm optimization technique. The ultimate goal of the proposed methodology is to enable the development of more suitable and reliable maintenance plans.