• Title/Summary/Keyword: Genetic Algorithm(G.A)

Search Result 128, Processing Time 0.022 seconds

Performance comparison of Tabu search and genetic algorithm for cell planning of 5G cellular network (5G 이동통신 셀 설계를 위한 타부 탐색과 유전 알고리즘의 성능)

  • Kwon, Ohyun;Ahn, Heungseop;Choi, Seungwon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.3
    • /
    • pp.65-73
    • /
    • 2017
  • The fifth generation(5G) of wireless networks will connect not only smart phone but also unimaginable things. Therefore, 5G cellular network is facing the soaring traffic demand of numerous user devices. To solve this problem, a huge amount of 5G base stations will need to be installed. The base station positioning problem is an NP-hard problem that does not know how long it will take to solve the problem. Because, it can not find an answer other than to check the number of all cases. In this paper, to solve the NP hard problem, we compare the tabu search and the genetic algorithm using real maps for optimal cell planning. We also perform Monte Carlo simulations to study the performance of the Tabu search and Genetic algorithm for 5G cell planning. As a results, Tabu search required 2.95 times less computation time than Genetic algorithm and showed accuracy difference of 2dBm.

A Genetic Algorithm-based Scheduling Method for Job Shop Scheduling Problem (유전알고리즘에 기반한 Job Shop 일정계획 기법)

  • 박병주;최형림;김현수
    • Korean Management Science Review
    • /
    • v.20 no.1
    • /
    • pp.51-64
    • /
    • 2003
  • The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

Control of Feed Rate Using Neurocontroller Incorporated with Genetic Algorithm in Fed-Batch Cultivation of Scutellaria baicalensis Georgi

  • Choi, Jeong-Woo;Lee, Woochang;Cho, Jin-Man;Kim, Young-Kee;Park, Soo-Yong;Lee, Won-Hong
    • Journal of Microbiology and Biotechnology
    • /
    • v.12 no.4
    • /
    • pp.687-691
    • /
    • 2002
  • To enhance the production of flavonoids [baicalin, wogonin-7-Ο-glucuronic acid (GA)], which are secondary metabolites of Scutellaria baicalensis Georgi(G.) plant cells, a multilayer perceptron control system was applied to regulate the substrate feeding in a fed-batch cultivation. The optimal profile for the substrate feeding rate in a fed-batch culture of S. baicalensis G. was determined by simulating a kinetic model using a genetic algorithm. Process variable profiles were then prepared for the construction of a multilayer perceptron controller that included massive parallelism, trainability, and fault tolerance. An error back-propagation algorithm was applied to train the multiplayer perceptron. The experimental results showed that neurocontrol incorporated with a genetic algorithm improved the flavonoid production compared with a simple fuzzy logic control system. Furthermore, the specific production yield and flavonoid productivity also increased.

A Study on the PI Controller of AC Servo Motor using Genetic Algorithm (유전자알고리즘을 이용한 교류서보전동기의 PI 제어기에 관한 연구)

  • Kim, Hwan;Park, Se-Seung;Choi, Youn-Ok;Cho, Geum-Bae;Kim, Pyoung-Ho
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.20 no.7
    • /
    • pp.81-91
    • /
    • 2006
  • Recently, G.A studies have studied and demonstrated that artificial intelligence like G.A networks, G.A PI controller. The design techniques of PI controller using G.A with the newly proposed teaming algorithm was presented, and the designed controller with AC servo motor system. The goal of this paper is to design the AC servo motor using genetic algorithm and to control drive robot. And in this paper, we propose a genetic algorithms approach to find an optimal or near optimal input variables for genetic algorithm PI controller. Our experimental results show that this approach increases overall classification accuracy rate significantly. Finally, we executed for the implementation of high performance speed control system. It is used a 16-bit DSP, IMS320LF2407, which is capable of the high speed and floating point calculation.

Optimum Design for Rotor-bearing System Using Advanced Genetic Algorithm (향상된 유전알고리듬을 이용한 로터 베어링 시스템의 최적설계)

  • Kim, Young-Chan;Choi, Seong-Pil;Yang, Bo-Suk
    • Proceedings of the KSME Conference
    • /
    • 2001.11a
    • /
    • pp.533-538
    • /
    • 2001
  • This paper describes a combinational method to compute the global and local solutions of optimization problems. The present hybrid algorithm uses both a genetic algorithm and a local concentrate search algorithm (e. g simplex method). The hybrid algorithm is not only faster than the standard genetic algorithm but also supplies a more accurate solution. In addition, this algorithm can find the global and local optimum solutions. The present algorithm can be supplied to minimize the resonance response (Q factor) and to yield the critical speeds as far from the operating speed as possible. These factors play very important roles in designing a rotor-bearing system under the dynamic behavior constraint. In the present work, the shaft diameter, the bearing length, and clearance are used as the design variables.

  • PDF

Performance Improvement of Network Based Parallel Genetic Algorithm by Exploiting Server's Computing Power (서버의 계산능력을 활용한 네트워크기반 병렬유전자알고리즘의 성능향상)

  • 송봉기;김용성;성길영;우종호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.67-72
    • /
    • 2004
  • This paper proposes a method improving the convergence speed of optimal solution for parallel genetic algorithm in the network based client-server model. Unlike the existing methods of obtaining global elite only by evaluating local elites in server, the proposed method obtains it by evaluating local elites and improving its fitness by applying genetic algorithm during idle time of the server. By using the improved chromosome in server for the client's genetic algorithm processing, the convergence speed of the optimal solution is increased. The improvement of fitness at the server during the interval of chromosome migration is (equation omitted)(F$_{max}$(g)-F$_{max}$(g-1)), whole F$_{max}$(g) is a max fitness of the g-th generation and G is the number of improved generation by the server. As the number of clients increases and G decreases, the improvement of fitness goes down. However the improvement of fitness is better than existing methods..

Green Supply Chain Network Model: Genetic Algorithm Approach (그린 공급망 네트워크 모델: 유전알고리즘 접근법)

  • Yun, Young Su;Chuluunsukh, Anudari
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.3
    • /
    • pp.31-38
    • /
    • 2019
  • In this paper, we design a green supply chain (gSC) network model. For constructing the gSC network model, environmental and economic factors are taken into consideration in it. Environmental factor is to minimize the $CO_2$ emission amount emitted when transporting products or materials between each stage. For economic factor, the total cost which is composed of total transportation cost, total handling cost and total fixed cost is minimized. To minimize the environmental and economic factors simultaneously, a mathematical formulation is proposed and it is implemented in a genetic algorithm (GA) approach. In numerical experiment, some scales of the gSC network model is presented and its performance is analyzed using the GA approach. Finally, the efficiencies of the gSC network model and the GA approach are proved.

Control of Glucose Concentration in a Fed-Batch Cultivation of Scutellaria baicalensis G. Plant Cells a Self-Organizing Fuzzy Logic Controller

  • Choi, Jeong-Woo;Cho, Jin-Man;Kim, Young-Kee;Park, Soo-Yong;Kim, Ik-Hwan
    • Journal of Microbiology and Biotechnology
    • /
    • v.11 no.5
    • /
    • pp.739-748
    • /
    • 2001
  • A self-organizing fuzzy logic controller using a genetic algorithm is described, which controlled the glucose concentration for the enhancement of flavonoid production in a fed-batch cultivation of Scutellaria baicalensis G. plant cells. The substrate feeding strategy in a fed-batch culture was to increase the flavonoid production by using the proposed kinetic model. For the two-stage culture, the substrate feeding strategy consisted of a first period with 28 g/I of glucose to promote cell growth, followed by a second period with 5 g/I of glucose to promote flavonoid production. A simple fuzzy logic controller and the self-organizing fuzzy logic controller using a genetic algorithm was constructed to control the glucose concentration in a fed-batch culture. The designed fuzzy logic controllers were applied to maintain the glucose concentration at given set-points of the two-stage culture in fed-batch cultivation. The experimental results showed that the self-organizing fuzzy logic controller improved the controller\`s performance, compared with that of the simple fuzzy logic controller. The specific production yield and productivity of flavonoids in the two-stage culture were higher than those in the batch culture.

  • PDF

Applying Genetic Algorithm to the Minimum Vertex Cover Problem (Minimum Vertex Cover 문제에 대한 유전알고리즘 적용)

  • Han, Keun-Hee;Kim, Chan-Soo
    • The KIPS Transactions:PartB
    • /
    • v.15B no.6
    • /
    • pp.609-612
    • /
    • 2008
  • Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.

Feature Selection and Performance Analysis using Quantum-inspired Genetic Algorithm (양자 유전알고리즘을 이용한 특징 선택 및 성능 분석)

  • Heo, G.S.;Jeong, H.T.;Park, A.;Baek, S.J.
    • Smart Media Journal
    • /
    • v.1 no.1
    • /
    • pp.36-41
    • /
    • 2012
  • Feature selection is the important technique of selecting a subset of relevant features for building robust pattern recognition systems. Various methods have been studied for feature selection from sequential search algorithms to stochastic algorithms. In this work, we adopted a Quantum-inspired Genetic Algorithm (QGA) which is based on the concept and principles of quantum computing such as Q-bits and superposition of state for feature selection. The performance of QGA is compared to that of the Conventional Genetic Algorithm (CGA) with respect to the classification rates and the number of selected features. The experimental result using UCI data sets shows that QGA is superior to CGA.

  • PDF