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

Search Result 460, Processing Time 0.027 seconds

The optimization of fuzzy neural network using genetic algorithms and its application to the prediction of the chaotic time series data (유전 알고리듬을 이용한 퍼지 신경망의 최적화 및 혼돈 시계열 데이터 예측에의 응용)

  • Jang, Wook;Kwon, Oh-Gook;Joo, Young-Hoon;Yoon, Tae-Sung;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.708-711
    • /
    • 1997
  • This paper proposes the hybrid algorithm for the optimization of the structure and parameters of the fuzzy neural networks by genetic algorithms (GA) to improve the behaviour and the design of fuzzy neural networks. Fuzzy neural networks have a distinguishing feature in that they can possess the advantage of both neural networks and fuzzy systems. In this way, we can bring the low-level learning and computational power of neural networks into fuzzy systems and also high-level, human like IF-THEN rule thinking and reasoning of fuzzy systems into neural networks. As a result, there are many research works concerning the optimization of the structure and parameters of fuzzy neural networks. In this paper, we propose the hybrid algorithm that can optimize both the structure and parameters of fuzzy neural networks. Numerical example is provided to show the advantages of the proposed method.

  • PDF

Minimizing the Total Stretch in Flow Shop Scheduling with Limited Capacity Buffers (한정된 크기의 버퍼가 있는 흐름 공정 일정계획의 스트레치 최소화)

  • Yoon, Suk-Hun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.6
    • /
    • pp.642-647
    • /
    • 2014
  • In this paper, a hybrid genetic algorithm (HGA) approach is proposed for an n-job, m-machine flow shop scheduling problem with limited capacity buffers with blocking in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. HGA adopts the idea of seed selection and development in order to improve the exploitation and exploration power of genetic algorithms (GAs). Extensive computational experiments have been conducted to compare the performance of HGA with that of GA.

No-Wait Lot-Streaming Flow Shop Scheduling (비정체 로트 - 스트리밍 흐름공정 일정계획)

  • Yoon, Suk-Hun
    • IE interfaces
    • /
    • v.17 no.2
    • /
    • pp.242-248
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

A Hybrid Genetic Algorithm for the Location-Routing Problem with Simultaneous Pickup and Delivery

  • Karaoglan, Ismail;Altiparmak, Fulya
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.1
    • /
    • pp.24-33
    • /
    • 2011
  • In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

A study on Performance Improvement of Neural Networks Using Genetic algorithms (유전자 알고리즘을 이용한 신경 회로망 성능향상에 관한 연구)

  • Lim, Jung-Eun;Kim, Hae-Jin;Chang, Byung-Chan;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.2075-2076
    • /
    • 2006
  • In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Backpropagation(BP). The conventional BP does not guarantee that the BP generated through learning has the optimal network architecture. But the proposed GA-based BP enable the architecture to be a structurally more optimized network, and to be much more flexible and preferable neural network than the conventional BP. The experimental results in BP neural network optimization show that this algorithm can effectively avoid BP network converging to local optimum. It is found by comparison that the improved genetic algorithm can almost avoid the trap of local optimum and effectively improve the convergent speed.

  • PDF

Study on the Airfoil Shape Design Optimization Using Database based Genetic Algorithms (데이터베이스 기반 유전 알고리즘을 이용한 효율적인 에어포일 형상 최적화에 대한 연구)

  • Kwon, Jang-Hyuk;Kim, Jin;Kim, Su-Whan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.31 no.1
    • /
    • pp.58-66
    • /
    • 2007
  • Genetic Algorithms (GA) have some difficulties in practical applications because of too many function evaluations. To overcome these limitations, an approximated modeling method such as Response Surface Modeling(RSM) is coupled to GAs. Original RSM method predicts linear or convex problems well but it is not good for highly nonlinear problems cause of the average effect of the least square method(LSM). So the locally approximated methods. so called as moving least squares method(MLSM) have been used to reduce the error of LSM. In this study, the efficient evolutionary GAs tightly coupled with RSM with MLSM are constructed and then a 2-dimensional inviscid airfoil shape optimization is performed to show its efficiency.

Dynamic Neural Units and Genetic Algorithms With Applications to the Control of Unknown Nonlinear Systems (미지의 비선형 시스템 제어를 위한 DNU와 GA알고리즘 적용에 관한 연구)

  • XiaoBing, Zhao;Min, Lin;Cho, Hyeon-Seob;Jeon, Jeong-Chay
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2486-2489
    • /
    • 2002
  • Pool of the central nervous system. In this thesis, we present a genetic DNU-control scheme for unknown nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

  • PDF

On Lot-Streaming Flow Shops with Stretch Criterion (로트 스트리밍 흐름공정 일정계획의 스트레치 최소화)

  • Yoon, Suk-Hun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.4
    • /
    • pp.187-192
    • /
    • 2014
  • Lot-streaming is the process of splitting a job (lot) into sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for an n-job, m-machine, lot-streaming flow shop scheduling problem with equal-size sublots in which the objective is to minimize the total stretch. The stretch of a job is the ratio of the amount of time the job spent before its completion to its processing time. NGA replaces the selection and mating operators of genetic algorithms (GAs) by marriage and pregnancy operators and incorporates the idea of inter-chromosomal dominance and individuals' similarities. Extensive computational experiments for medium to large-scale lot-streaming flow-shop scheduling problems have been conducted to compare the performance of NGA with that of GA.

Fuzzy Controller Design by Means of Genetic Optimization and NFN-Based Estimation Technique

  • Oh, Sung-Kwun;Park, Seok-Beom;Kim, Hyun-Ki
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.3
    • /
    • pp.362-373
    • /
    • 2004
  • In this study, we introduce a noble neurogenetic approach to the design of the fuzzy controller. The design procedure dwells on the use of Computational Intelligence (CI), namely genetic algorithms and neurofuzzy networks (NFN). The crux of the design methodology is based on the selection and determination of optimal values of the scaling factors of the fuzzy controllers, which are essential to the entire optimization process. First, tuning of the scaling factors of the fuzzy controller is carried out, and then the development of a nonlinear mapping for the scaling factors is realized by using GA based NFN. The developed approach is applied to an inverted pendulum nonlinear system where we show the results of comprehensive numerical studies and carry out a detailed comparative analysis.

Genetic Algorithm Approach to Image Reconstruction in Electrical Impedance Tomography

  • Kim, Ho-Chan;Boo, Chang-Jin;Lee, Yoon-Joon;Kang, Chang-Ik
    • KIEE International Transactions on Electrophysics and Applications
    • /
    • v.4C no.3
    • /
    • pp.123-128
    • /
    • 2004
  • In electrical impedance tomography (EIT), the internal resistivity distribution of the unknown object is computed using the boundary voltage data induced by different current patterns using various reconstruction algorithms. This paper presents a new image reconstruction algorithm based on the genetic algorithm (GA) via a two-step approach for the solution of the EIT inverse problem, in particular for the reconstruction of "static" images. The computer simulation for the 32 channels synthetic data shows that the spatial resolution of reconstructed images in the proposed scheme is improved compared to that of the modified Newton-Raphson algorithm at the expense of an increased computational burden.rden.