• Title/Summary/Keyword: Genetic operators

Search Result 209, Processing Time 0.021 seconds

A Study on Single Machine Scheduling with a Rate-Modifying Activity and Time-Dependent Deterioration After the Activity (복구조정 활동과 복구조정 후 시간경과에 따라 퇴화하는 작업시간을 갖는 단일기계의 일정계획에 관한 연구)

  • Kim, Byung Soo;Joo, Cheol Min
    • Korean Management Science Review
    • /
    • v.30 no.1
    • /
    • pp.15-24
    • /
    • 2013
  • We consider the single machine scheduling problem with a rate-modifying activity and time-dependent deterioration after the activity. The class of scheduling problems with rate-modifying activities and the class of scheduling problems with time-dependent processing times have been studied independently. However, the integration of these classes is motivated by human operators of tasks who has fatigue while carrying out the operation of a series of tasks. This situation is also applicable to machines that experience performance degradation over time due to mal-position or mal-alignment of jobs, abrasion of tools, and scraps of operations, etc. In this study, the integration of the two classes of scheduling problems is considered. We present a mathematical model to determine job-sequence and a position of a rate-modifying activity for the integration problem. Since the model is difficult to solve as the size of real problem being very large, we propose genetic algorithms. The performance of the algorithms are compared with optimal solutions with various problems.

Estimation of LOCA Break Size Using Cascaded Fuzzy Neural Networks

  • Choi, Geon Pil;Yoo, Kwae Hwan;Back, Ju Hyun;Na, Man Gyun
    • Nuclear Engineering and Technology
    • /
    • v.49 no.3
    • /
    • pp.495-503
    • /
    • 2017
  • Operators of nuclear power plants may not be equipped with sufficient information during a loss-of-coolant accident (LOCA), which can be fatal, or they may not have sufficient time to analyze the information they do have, even if this information is adequate. It is not easy to predict the progression of LOCAs in nuclear power plants. Therefore, accurate information on the LOCA break position and size should be provided to efficiently manage the accident. In this paper, the LOCA break size is predicted using a cascaded fuzzy neural network (CFNN) model. The input data of the CFNN model are the time-integrated values of each measurement signal for an initial short-time interval after a reactor scram. The training of the CFNN model is accomplished by a hybrid method combined with a genetic algorithm and a least squares method. As a result, LOCA break size is estimated exactly by the proposed CFNN model.

Leak flow prediction during loss of coolant accidents using deep fuzzy neural networks

  • Park, Ji Hun;An, Ye Ji;Yoo, Kwae Hwan;Na, Man Gyun
    • Nuclear Engineering and Technology
    • /
    • v.53 no.8
    • /
    • pp.2547-2555
    • /
    • 2021
  • The frequency of reactor coolant leakage is expected to increase over the lifetime of a nuclear power plant owing to degradation mechanisms, such as flow-acceleration corrosion and stress corrosion cracking. When loss of coolant accidents (LOCAs) occur, several parameters change rapidly depending on the size and location of the cracks. In this study, leak flow during LOCAs is predicted using a deep fuzzy neural network (DFNN) model. The DFNN model is based on fuzzy neural network (FNN) modules and has a structure where the FNN modules are sequentially connected. Because the DFNN model is based on the FNN modules, the performance factors are the number of FNN modules and the parameters of the FNN module. These parameters are determined by a least-squares method combined with a genetic algorithm; the number of FNN modules is determined automatically by cross checking a fitness function using the verification dataset output to prevent an overfitting problem. To acquire the data of LOCAs, an optimized power reactor-1000 was simulated using a modular accident analysis program code. The predicted results of the DFNN model are found to be superior to those predicted in previous works. The leak flow prediction results obtained in this study will be useful to check the core integrity in nuclear power plant during LOCAs. This information is also expected to reduce the workload of the operators.

Nuclear reactor vessel water level prediction during severe accidents using deep neural networks

  • Koo, Young Do;An, Ye Ji;Kim, Chang-Hwoi;Na, Man Gyun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.723-730
    • /
    • 2019
  • Acquiring instrumentation signals generated from nuclear power plants (NPPs) is essential to maintain nuclear reactor integrity or to mitigate an abnormal state under normal operating conditions or severe accident circumstances. However, various safety-critical instrumentation signals from NPPs cannot be accurately measured on account of instrument degradation or failure under severe accident circumstances. Reactor vessel (RV) water level, which is an accident monitoring variable directly related to reactor cooling and prevention of core exposure, was predicted by applying a few signals to deep neural networks (DNNs) during severe accidents in NPPs. Signal data were obtained by simulating the postulated loss-of-coolant accidents at hot- and cold-legs, and steam generator tube rupture using modular accident analysis program code as actual NPP accidents rarely happen. To optimize the DNN model for RV water level prediction, a genetic algorithm was used to select the numbers of hidden layers and nodes. The proposed DNN model had a small root mean square error for RV water level prediction, and performed better than the cascaded fuzzy neural network model of the previous study. Consequently, the DNN model is considered to perform well enough to provide supporting information on the RV water level to operators.

Nonlinear Elastic Optimal Design Using Genetic Algorithm (유전자 알고리즘을 이용한 비선형 탄성 최적설계)

  • Kim, Seung Eock;Ma, Sang Soo
    • Journal of Korean Society of Steel Construction
    • /
    • v.15 no.2
    • /
    • pp.197-206
    • /
    • 2003
  • The optimal design method in cooperation with a nonlinear elastic analysis method was presented. The proposed nonlinear elastic method overcame the drawback of the conventional LRFD method this approximately accounts for the nonlinear effect caused by using the moment amplification factors of and. The genetic algorithm uses a procedure based on the Darwinian notions of the survival of the fittest, where selection, crossover, and mutation operators are used to look for high performance among the sections of the database. They satisfy constraint functions and give the lightest weight to the structure. The objective function was set to the total weight of the steel structure. The constraint functions were load-carrying capacities, serviceability, and ductility requirement. Case studies for a two-dimensional frame, a three-dimensional frame, and a three-dimensional steel arch bridge were likewise presented.

Global Optimum Searching Technique Using DNA Coding and Evolutionary Computing (DNA 코딩과 진화연산을 이용한 함수의 최적점 탐색방법)

  • Paek, Dong-Hwa;Kang, Hwan-Il;Kim, Kab-Il;Han, Seung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.6
    • /
    • pp.538-542
    • /
    • 2001
  • DNA computing has been applied to the problem of getting an optimal soluting since Adleman's experiment. DNA computing uses strings with various length and four-type bases that makes more useful for finding a global optimal solutions of the complex multi-modal problems This paper presents DNA coding method finding optimal solution of the multi-modal function and compares the efficiency of this method with the genetic algorithms(GA). GA searches efffectively an optimal solution via the artificial evolution of individual group of binary string and DNA coding method uses DNA molecules and four-type bases denoted by the A(Ademine) C(Gytosine);G(Guanine)and T(Thymine). The selection, crossover, mutation operators are applied to both DNA coding algorithm and genetic algorithms and the comparison has been performed. The results show that the DNA based algorithm performs better than GA.

  • PDF

A Genetic Algorithm using A Modified Order Exchange Crossover for Rural Postman Problem with Time Windows (MOX 교차 연산자를 이용한 Rural Postman Problem with Time Windows 해법)

  • Kang koung-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.179-186
    • /
    • 2005
  • This paper describes a genetic algorithm and compares three crossover operators for Rural Postman Problem with Time Windows (RPPTW). The RPPTW which is a multiobjective optimization problem, is an extension of Rural Postman Problem(RPP) in which some service places (located at edge) require service time windows that consist of earliest time and latest time. Hence, RPM is a m띤tieect optimization Problem that has minimal routing cost being serviced within the given time at each service Place. To solve the RPPTW which is a multiobjective optimization problem, we obtain a Pareto-optimal set that the superiority of each objective can not be compared. This Paper performs experiments using three crossovers for 12 randomly generated test problems and compares the results. The crossovers using in this Paper are Partially Matched Exchange(PMX) Order Exchange(OX), and Modified Order Exchange(MOX) which is proposed in this paper. For each test problem, the results show the efficacy of MOX method for RPPTW.

  • PDF

Optimum Structural Design of Sinusoidal Corrugated Web Beam Using Real-valued Genetic Algorithm (실변수 유전자 알고리즘을 이용한 사인형 주름 웨브 보의 최적구조설계)

  • Shon, Su-Deok;Lee, Seung-Jae
    • Journal of Korean Society of Steel Construction
    • /
    • v.23 no.5
    • /
    • pp.581-593
    • /
    • 2011
  • The underlying advantages of using thin-walled corrugatedwebs instead of plate girders with stiffeners are the elimination of instability problems associated with buckling of the thin-walled flat plate, and elimination of the need for transverse stiffeners, which alsoresults in economic advantages. This paper focuses on two aspects related to the structural design technique forsinusoidal corrugated web steel beams, and the optimum design of the beams using real-value genetic algorithms. The structural design process and design variables used in this optimization werecomposed with EN 1993-1-5, DASt-R015 standard and Pasternak et al. (2004), and the valid design capacity of shear buckling of the standards were compared. For the optimum structural design, the objective function, presented as the fullweight of the sinusoidal corrugated web beams, and the slenderness, member forces, and maximum deflection of the beam, were considered constraints. Finally, the simple beam under the uniform load was adopted as a numerical example, and the effective probability parameters of the genetic operators were considered to find the global minimum point.

Genetic Clustering with Semantic Vector Expansion (의미 벡터 확장을 통한 유전자 클러스터링)

  • Song, Wei;Park, Soon-Cheol
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.3
    • /
    • pp.1-8
    • /
    • 2009
  • This paper proposes a new document clustering system using fuzzy logic-based genetic algorithm (GA) and semantic vector expansion technology. It has been known in many GA papers that the success depends on two factors, the diversity of the population and the capability to convergence. We use the fuzzy logic-based operators to adaptively adjust the influence between these two factors. In traditional document clustering, the most popular and straightforward approach to represent the document is vector space model (VSM). However, this approach not only leads to a high dimensional feature space, but also ignores the semantic relationships between some important words, which would affect the accuracy of clustering. In this paper we use latent semantic analysis (LSA)to expand the documents to corresponding semantic vectors conceptually, rather than the individual terms. Meanwhile, the sizes of the vectors can be reduced drastically. We test our clustering algorithm on 20 news groups and Reuter collection data sets. The results show that our method outperforms the conventional GA in various document representation environments.

A Genetic Algorithm for the Chinese Postman Problem on the Mixed Networks (유전자 알고리즘을 이용한 혼합 네트워크에서의 Chinese Postman Problem 해법)

  • Jun Byung Hyun;Kang Myung Ju;Han Chi Geun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.181-188
    • /
    • 2005
  • Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

  • PDF