2017Unpublished venueRequires access

An improvement of genetic algorithm for optimization problem

Sakkayaphop Pravesjit, Krittika Kantawong

Open publisher page 15 citations

Abstract

This paper proposed an improvement of genetic algorithm for optimization problem. In this study, the Gaussian function is applied in crossover and mutation operators instead of traditional crossover and mutation. The algorithm is tested on five benchmark problems and compared with the self-adaptive DE algorithm, traditional differential evolution (DE) algorithm, the JDE self-adaptive algorithm and the hybrid bat algorithm with natural-inspired. The computation results illustrate that the proposed algorithm can produce optimal solutions for all functions. Comparing to the other four algorithms, the proposed algorithm provides the best results. The finding proves that the algorithm should be improved in this direction.

About this research paper

What this paper is about

This paper proposed an improvement of genetic algorithm for optimization problem. In this study, the Gaussian function is applied in crossover and mutation operators instead of traditional crossover and mutation. The algorithm is tested on five benchmark problems and compared with the self-adaptive DE algorithm, traditional differential evolution (DE) algorithm, the JDE self-adaptive algorithm and the hybrid bat algorithm with natural-inspired. The computation results illustrate that the proposed algorithm can produce optimal solutions for all functions. Comparing to the other four algorithms, the proposed algorithm provides the best results. The finding proves that the algorithm should be improved in this direction.

Why it matters

OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proposed an improvement of genetic algorithm for optimization problem. In this study, the Gaussian function is applied in crossover and mutation operators instead of traditional crossover and mutation. The algorithm is tested on five benchmark problems and compared with the self-adaptive DE algorithm, traditional differential evolution (DE) algorithm, the JDE self-adaptive algorithm and the hybrid bat algorithm with natural-inspired. The computation results illustrate that the proposed algorithm can produce optimal solutions for all functions. Comparing to the other four algorithms, the proposed algorithm provides the best results. The finding proves that the algorithm should be improved in this direction.

Key concepts: Crossover, Benchmark (surveying), Algorithm, Population-based incremental learning, Meta-optimization, Genetic algorithm, Computer science, Mutation

Related papers

Back to paper searchBrowse research topicsOriginal source
An improvement of genetic algorithm for optimization problem — Research Paper | ScholarLens