• Title/Summary/Keyword: Hybrid Genetic Algorithms

Search Result 165, Processing Time 0.026 seconds

A Distributed Hybrid Algorithm for Glass Cutting (유리재단 문제에 대한 분산 합성 알고리즘)

  • Hong, Chuleui
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.343-349
    • /
    • 2018
  • The proposed hybrid algorithm combines the benefits of rapid convergence property of mean filed annealing(MFA) and the effective genetic operations of simulated annealing-like genetic algorithm(SGA). This algorithm is applied to the isotropic material stock cutting problem, especially to glass cutting in distributed computing environments base on MPI called message passing interface. The glass cutting is to place the required rectangular patterns to the given large glass sheets resulting in reducing the wasted scrap area. Our experimental results show that the heuristic method improves the performance over the conventional ones by decreasing the scrap area and maximum execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential one while it achieves almost linear speedup as the problem size increases.

The Design of Genetically Optimized Multi-layer Fuzzy Neural Networks

  • Park, Byoung-Jun;Park, Keon-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.5
    • /
    • pp.660-665
    • /
    • 2004
  • In this study, a new architecture and comprehensive design methodology of genetically optimized Multi-layer Fuzzy Neural Networks (gMFNN) are introduced and a series of numeric experiments are carried out. The gMFNN architecture results from a synergistic usage of the hybrid system generated by combining Fuzzy Neural Networks (FNN) with Polynomial Neural Networks (PNN). FNN contributes to the formation of the premise part of the overall network structure of the gMFNN. The consequence part of the gMFNN is designed using PNN. The optimization of the FNN is realized with the aid of a standard back-propagation learning algorithm and genetic optimization. The development of the PNN dwells on the extended Group Method of Data Handling (GMDH) method and Genetic Algorithms (GAs). To evaluate the performance of the gMFNN, the models are experimented with the use of a numerical example.

A Hybrid Genetic Algorithm for Vehicle Routing Problem which Considers Traffic Situations and Stochastic Demands (교통상황과 확률적 수요를 고려한 차량경로문제의 Hybrid 유전자 알고리즘)

  • Kim, Gi-Tae;Jeon, Geon-Uk
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.5
    • /
    • pp.107-116
    • /
    • 2010
  • The vehicle travel time between locations in a downtown is greatly influenced by both complex road conditions and traffic situation that changes real time according to various external variables. The customer's demands also stochastically change by time period. Most vehicle routing problems suggest a vehicle route considering travel distance, average vehicle speed, and deterministic demand; however, they do not consider the dynamic external environment, including items such as traffic conditions and stochastic demand. A realistic vehicle routing problem which considers traffic (smooth, delaying, and stagnating) and stochastic demands is suggested in this study. A mathematical programming model and hybrid genetic algorithm are suggested to minimize the total travel time. By comparing the results considering traffic and stochastic demands, the suggested algorithm gives a better solution than existing algorithms.

Using Bayesian tree-based model integrated with genetic algorithm for streamflow forecasting in an urban basin

  • Nguyen, Duc Hai;Bae, Deg-Hyo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2021.06a
    • /
    • pp.140-140
    • /
    • 2021
  • Urban flood management is a crucial and challenging task, particularly in developed cities. Therefore, accurate prediction of urban flooding under heavy precipitation is critically important to address such a challenge. In recent years, machine learning techniques have received considerable attention for their strong learning ability and suitability for modeling complex and nonlinear hydrological processes. Moreover, a survey of the published literature finds that hybrid computational intelligent methods using nature-inspired algorithms have been increasingly employed to predict or simulate the streamflow with high reliability. The present study is aimed to propose a novel approach, an ensemble tree, Bayesian Additive Regression Trees (BART) model incorporating a nature-inspired algorithm to predict hourly multi-step ahead streamflow. For this reason, a hybrid intelligent model was developed, namely GA-BART, containing BART model integrating with Genetic algorithm (GA). The Jungrang urban basin located in Seoul, South Korea, was selected as a case study for the purpose. A database was established based on 39 heavy rainfall events during 2003 and 2020 that collected from the rain gauges and monitoring stations system in the basin. For the goal of this study, the different step ahead models will be developed based in the methods, including 1-hour, 2-hour, 3-hour, 4-hour, 5-hour, and 6-hour step ahead streamflow predictions. In addition, the comparison of the hybrid BART model with a baseline model such as super vector regression models is examined in this study. It is expected that the hybrid BART model has a robust performance and can be an optional choice in streamflow forecasting for urban basins.

  • PDF

Improvement of evolution speed of individuals through hybrid reproduction of monogenesis and gamogenesis in genetic algorithms (유전자알고리즘에서 단성생식과 양성생식을 혼용한 번식을 통한 개체진화 속도향상)

  • Jung, Sung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.45-51
    • /
    • 2011
  • This paper proposes a method to accelerate the evolution speed of individuals through hybrid reproduction of monogenesis and gamogenesis. Monogenesis as a reproduction method that bacteria or monad without sexual distinction divide into two individuals has an advantage for local search and gamogenesis as a reproduction method that individuals with sexual distinction mate and breed the offsprings has an advantages for keeping the diversity of individuals. These properties can be properly used for improvement of evolution speed of individuals in genetic algorithms. In this paper, we made relatively good individuals among selected parents to do monogenesis for local search and forced relatively bad individuals among selected parents to do gamogenesis for global search by increasing the diversity of chromosomes. The mutation probability for monogenesis was set to a lower value than that of original genetic algorithm for local search and the mutation probability for gamogenesis was set to a higher value than that of original genetic algorithm for global search. Experimental results with four function optimization problems showed that the performances of three functions were very good, but the performances of fourth function with distributed global optima were not good. This was because distributed global optima prevented individuals from steady evolution.

Coarse-to-fine Classifier Ensemble Selection using Clustering and Genetic Algorithms (군집화와 유전 알고리즘을 이용한 거친-섬세한 분류기 앙상블 선택)

  • Kim, Young-Won;Oh, Il-Seok
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.9
    • /
    • pp.857-868
    • /
    • 2007
  • The good classifier ensemble should have a high complementarity among classifiers in order to produce a high recognition rate and its size is small in order to be efficient. This paper proposes a classifier ensemble selection algorithm with coarse-to-fine stages. for the algorithm to be successful, the original classifier pool should be sufficiently diverse. This paper produces a large classifier pool by combining several different classification algorithms and lots of feature subsets. The aim of the coarse selection is to reduce the size of classifier pool with little sacrifice of recognition performance. The fine selection finds near-optimal ensemble using genetic algorithms. A hybrid genetic algorithm with improved searching capability is also proposed. The experimentation uses the worldwide handwritten numeral databases. The results showed that the proposed algorithm is superior to the conventional ones.

Development of Case-adaptation Algorithm using Genetic Algorithm and Artificial Neural Networks

  • Han, Sang-Min;Yang, Young-Soon
    • Journal of Ship and Ocean Technology
    • /
    • v.5 no.3
    • /
    • pp.27-35
    • /
    • 2001
  • In this research, hybrid method with case-based reasoning and rule-based reasoning is applied. Using case-based reasoning, design experts'experience and know-how are effectively represented in order to obtain a proper configuration of midship section in the initial ship design stage. Since there is not sufficient domain knowledge available to us, traditional case-adaptation algorithms cannot be applied to our problem, i.e., creating the configuration of midship section. Thus, new case-adaptation algorithms not requiring any domain knowledge are developed antral applied to our problem. Using the knowledge representation of DnV rules, rule-based reasoning can perform deductive inference in order to obtain the scantling of midship section efficiently. The results from the case-based reasoning and the rule-based reasoning are examined by comparing the results with various conventional methods. And the reasonability of our results is verified by comparing the results wish actual values from parent ship.

  • PDF

A Study on Large Scale Unit Commitment Using Genetic Algorithm (유전 알고리즘을 이용한 대규모의 발전기 기동정지계획에 관한 연구)

  • Kim, H.S.;Mun, K.J.;Hwang, G.H.;Park, J.H.;Jung, J.W.;Kim, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 1997.11a
    • /
    • pp.174-176
    • /
    • 1997
  • This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

  • PDF

Development of Real Coded Genetic Algorithm for Multiperiod Optimization

  • Chang, Young-Jung;Song, Sang-Ok;Song, Ji-Ho;Dongil Shin;S. Ando
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.396-396
    • /
    • 2000
  • Multiperiod optimization is the key step to tackle the supply chain optimization problems. Taking supply and demand uncertainty or prediction into consideration during the process synthesis phase leads to the maximization of the profit for the long range time horizon. In this study, new algorithm based on the Genetic Algorithms is proposed for multiperiod optimization formulated in MINLP, GDP and hybrid MINLP/GDP. In this study, the focus is given especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is tried. and many heuristics are adopted for this purpose.

  • PDF

An Efficient Artificial Intelligence Hybrid Approach for Energy Management in Intelligent Buildings

  • Wahid, Fazli;Ismail, Lokman Hakim;Ghazali, Rozaida;Aamir, Muhammad
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5904-5927
    • /
    • 2019
  • Many artificial intelligence (AI) techniques have been embedded into various engineering technologies to assist them in achieving different goals. The integration of modern technologies with energy consumption management system and occupant's comfort inside buildings results in the introduction of intelligent building concept. The major aim of this integration is to manage the energy consumption effectively and keeping the occupant satisfied with the internal environment of the building. The last few couple of years have seen many applications of AI techniques for optimizing the energy consumption with maximizing the user comfort in smart buildings but still there is much room for improvement in this area. In this paper, a hybrid of two AI algorithms called firefly algorithm (FA) and genetic algorithm (GA) has been used for user comfort maximization with minimum energy consumption inside smart building. A complete user friendly system with data from various sensors, user, processes, power control system and different actuators is developed in this work for reducing power consumption and increase the user comfort. The inputs of optimization algorithms are illumination, temperature and air quality sensors' data and the user set parameters whereas the outputs of the optimization algorithms are optimized parameters. These optimized parameters are the inputs of different fuzzy controllers which change the status of different actuators according to user satisfaction.