• Title/Summary/Keyword: quantum genetic algorithm

Search Result 12, Processing Time 0.015 seconds

A Survey of Genetic Programming and Its Applications

  • Ahvanooey, Milad Taleby;Li, Qianmu;Wu, Ming;Wang, Shuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1765-1794
    • /
    • 2019
  • Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

DIAMETRAL CREEP PREDICTION OF THE PRESSURE TUBES IN CANDU REACTORS USING A BUNDLE POSITION-WISE LINEAR MODEL

  • Lee, Sung-Han;Kim, Dong-Su;Lee, Sim-Won;No, Young-Gyu;Na, Man-Gyun;Lee, Jae-Yong;Kim, Dong-Hoon;Jang, Chang-Heui
    • Nuclear Engineering and Technology
    • /
    • v.43 no.3
    • /
    • pp.301-308
    • /
    • 2011
  • The diametral creep of pressure tubes (PTs) in CANDU (CANada Deuterium Uranium) reactors is one of the principal aging mechanisms governing the heat transfer and hydraulic degradation of the heat transport system (HTS). PT diametral creep leads to diametral expansion, which affects the thermal hydraulic characteristics of the coolant channels and the critical heat flux (CHF). The CHF is a major parameter determining the critical channel power (CCP), which is used in the trip setpoint calculations of regional overpower protection (ROP) systems. Therefore, it is essential to predict PT diametral creep in CANDU reactors. PT diametral creep is caused mainly by fast neutron irradiation, temperature and applied stress. The objective of this study was to develop a bundle position-wise linear model (BPLM) to predict PT diametral creep employing previously measured PT diameters and HTS operating conditions. The linear model was optimized using a genetic algorithm and was devised based on a bundle position because it is expected that each bundle position in a PT channel has inherent characteristics. The proposed BPLM for predicting PT diametral creep was confirmed using the operating data of the Wolsung nuclear power plant in Korea. The linear model was able to predict PT diametral creep accurately.