• Title/Summary/Keyword: Hybrid Genetic Algorithms

Search Result 165, Processing Time 0.029 seconds

Optimization of Max-Plus based Neural Networks using Genetic Algorithms (유전 알고리즘을 이용한 Max-Plus 기반의 뉴럴 네트워크 최적화)

  • Han, Chang-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.14 no.1
    • /
    • pp.57-61
    • /
    • 2013
  • A hybrid genetic algorithm based learning method for the morphological neural networks (MNN) is proposed. The morphological neural networks are based on max-plus algebra, therefore, it is difficult to optimize the coefficients of MNN by the learning method with derivative operations. In order to solve the difficulty, a hybrid genetic algorithm based learning method to optimize the coefficients of MNN is used. Through the image compression/reconstruction experiment using test images extracted from standard image database(SIDBA), it is confirmed that the quality of the reconstructed images obtained by the proposed method is better than that obtained by the conventional neural networks.

Genetic Algorithm based Hybrid Ensemble Model (유전자 알고리즘 기반 통합 앙상블 모형)

  • Min, Sung-Hwan
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.1
    • /
    • pp.45-59
    • /
    • 2016
  • An ensemble classifier is a method that combines output of multiple classifiers. It has been widely accepted that ensemble classifiers can improve the prediction accuracy. Recently, ensemble techniques have been successfully applied to the bankruptcy prediction. Bagging and random subspace are the most popular ensemble techniques. Bagging and random subspace have proved to be very effective in improving the generalization ability respectively. However, there are few studies which have focused on the integration of bagging and random subspace. In this study, we proposed a new hybrid ensemble model to integrate bagging and random subspace method using genetic algorithm for improving the performance of the model. The proposed model is applied to the bankruptcy prediction for Korean companies and compared with other models in this study. The experimental results showed that the proposed model performs better than the other models such as the single classifier, the original ensemble model and the simple hybrid model.

GENIIS, a New Hybrid Algorithm for Solving the Mixed Chinese Postman Problem

  • Choi, Myeong-Gil;Thangi, Nguyen-Manh;Hwang, Won-Joo
    • The Journal of Information Systems
    • /
    • v.17 no.3
    • /
    • pp.39-58
    • /
    • 2008
  • Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.

Cost Estimation of Case-Based Reasoning Using Hybrid Genetic Algorithm - Focusing on Local Search Method Using Correlation Analysis - (혼합형 유전자 알고리즘을 적용한 사례기반추론 공사비예측 - 상관분석을 이용한 지역탐색 기법을 중심으로 -)

  • Jung, Sangsun;Park, Moonseo;Lee, Hyun-Soo;Yoon, Inseok
    • Korean Journal of Construction Engineering and Management
    • /
    • v.21 no.1
    • /
    • pp.50-60
    • /
    • 2020
  • Estimates of project costs in the early stages of a construction project have a significant impact on the operator's decision-making in important matters, such as the site's decision or the construction period. However, it is difficult to carry out the initial stage with confidence because information such as design books and specifications is not available. In previous studies, case-based reasoning was used to predict initial construction costs, and genetic algorithms were used to calculate the weight of the inquiry phase among them. However, some say that it is difficult to perform better than the current year because existing genetic algorithms are calculated in random numbers. To overcome these limitations, correlation numbers using correlation analysis rather than random numbers are reflected in the genetic algorithm by method of local search, and weights are calculated using a hybrid genetic algorithm that combines local search and genetic algorithms. A case-based reasoning model was developed using the weights calculated and validated with the data. As a result, it was found that the hybrid GA-CBR applied with local search performed better than the existing GA-CBR.

Optimal Design for Indoor Thermal Environment based on CFD Simulation and Genetic Algorithms (CFD 연성해석과 유전자 알고리즘을 이용한 실내 열환경 최적설계에 관한 연구)

  • 김태연;이윤규
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.16 no.2
    • /
    • pp.111-120
    • /
    • 2004
  • The optimal design method of indoor thermal environment using CFD coupled simulation and genetic algorithms (GA) is developed in this study. CFD could analyze the thermal environment considering the distribution of temperature, velocity, etc. in a room. Therefore, It would be appropriate to use CFD for the optimal design method considering their distribution. In this paper, the optimal design means the most appropriate boundary conditions of the room among the conditions where the design target of indoor therm environment is achieved. Two step optimal indoor thermal environment design method is proposed. It includes the GA for searching the optimal indoor thermal environment design. To examine the performance of this method, the optimal design of hybrid ventilation system, which uses the natural cross ventilation and the radiation-cooling panel is conducted. The optimal design which satisfies the design target (thermal comfort, minimum cooling load, minimum vertical temperature difference) is found using two step optimal design method.

UHGA channel assignment can be applied under various environments (다양한 환경에 적용이 가능한 UHGA 채널 할당 방식)

  • Heo, Seo-Jung;Son, Dong-Cheol;Kim, Chang Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.487-493
    • /
    • 2013
  • As the spread of smart devices that service variety of content, limited mobile terminal channel assignment problem has intensified. In the channel assignment in mobile networks mobile switching center at the request belongs to each base station allocates the channel to the mobile station. This effectively allocate the limited channels of various methods have been proposed for, in this case a hybrid channel allocation using genetic algorithms UHGA (Universal Hybrid Channel Assignment using Genetic Algorithm) in rural areas or urban areas, such as universal network applied to a variety of environments that the efficiency is verified through simulation.

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

Non-Synonymously Redundant Encodings and Normalization in Genetic Algorithms (비유사 중복 인코딩을 사용하는 유전 알고리즘을 위한 정규화 연산)

  • Choi, Sung-Soon;Moon, Byung-Ro
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.6
    • /
    • pp.503-518
    • /
    • 2007
  • Normalization transforms one parent genotype to be consistent with the other before crossover. In this paper, we explain how normalization alleviates the difficulties caused by non-synonymously redundant encodings in genetic algorithms. We define the encodings with maximally non-synonymous property and prove that the encodings induce uncorrelated search spaces. Extensive experiments for a number of problems show that normalization transforms the uncorrelated search spaces to correlated ones and leads to significant improvement in performance.

Real-Time Power-Saving Scheduling Based on Genetic Algorithms in Multi-core Hybrid Memory Environments (멀티코어 이기종메모리 환경에서의 유전 알고리즘 기반 실시간 전력 절감 스케줄링)

  • Yoo, Suhyeon;Jo, Yewon;Cho, Kyung-Woon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.135-140
    • /
    • 2020
  • Recently, due to the rapid diffusion of intelligent systems and IoT technologies, power saving techniques in real-time embedded systems has become important. In this paper, we propose P-GA (Parallel Genetic Algorithm), a scheduling algorithm aims at reducing the power consumption of real-time systems in multi-core hybrid memory environments. P-GA improves the Proportional-Fairness (PF) algorithm devised for multi-core environments by combining the dynamic voltage/frequency scaling of the processor with the nonvolatile memory technologies. Specifically, P-GA applies genetic algorithms for optimizing the voltage and frequency modes of processors and the memory types, thereby minimizing the power consumptions of the task set. Simulation experiments show that the power consumption of P-GA is reduced by 2.85 times compared to the conventional schemes.

A Cellular Learning Strategy for Local Search in Hybrid Genetic Algorithms (복합 유전자 알고리즘에서의 국부 탐색을 위한 셀룰러 학습 전략)

  • Ko, Myung-Sook;Gil, Joon-Min
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.669-680
    • /
    • 2001
  • Genetic Algorithms are optimization algorithm that mimics biological evolution to solve optimization problems. Genetic algorithms provide an alternative to traditional optimization techniques by using directed random searches to locate optimal solutions in complex fitness landscapes. Hybrid genetic algorithm that is combined with local search called learning can sustain the balance between exploration and exploitation. The genetic traits that each individual in the population learns through evolution are transferred back to the next generation, and when this learning is combined with genetic algorithm we can expect the improvement of the search speed. This paper proposes a genetic algorithm based Cellular Learning with accelerated learning capability for function optimization. Proposed Cellular Learning strategy is based on periodic and convergent behaviors in cellular automata, and on the theory of transmitting to offspring the knowledge and experience that organisms acquire in their lifetime. We compared the search efficiency of Cellular Learning strategy with those of Lamarckian and Baldwin Effect in hybrid genetic algorithm. We showed that the local improvement by cellular learning could enhance the global performance higher by evaluating their performance through the experiment of various test bed functions and also showed that proposed learning strategy could find out the better global optima than conventional method.

  • PDF