An implementation of new selection strategies in a genetic algorithm - Population recombination and elitist refinement

Noh Sung Kwak, Jongsoo Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The present study aims to develop a new genetic algorithm utilizing population recombination and elitist refinement. Population recombination determines how a population and its elitist sub-population evolve. A whole population consists of three major sub-populations: the first is the current generation's elitist sub-population, the second is obtained from the pure crossover of the elitist sub-population with another existing sub-population, and the third is the result of a crossover between the elitist and random sub-populations. Genetic operations such as reproduction and crossover are applied among sub-populations during the process of population recombination. The refinement of the elitist sub-population is then implemented in order to improve the converged solution that was obtained from the recombination. The refinement of elitist sub-populations facilitates the locations of a more enhanced design by altering the binary values in chromosomes. The proposed method is verified through a number of nonlinear and/or multi-modal functions and constrained optimization problems.

Original languageEnglish
Pages (from-to)1367-1384
Number of pages18
JournalEngineering Optimization
Volume43
Issue number12
DOIs
Publication statusPublished - 2011 Dec 1

Fingerprint

Constrained optimization
Chromosomes
Recombination
Refinement
Genetic algorithms
Genetic Algorithm
Crossover
Strategy
Genetic algorithm
Multimodal Optimization
Multimodal Function
Function Optimization
Constrained Optimization Problem
Chromosome

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

@article{b9c945188df74e709940beeab4c5a594,
title = "An implementation of new selection strategies in a genetic algorithm - Population recombination and elitist refinement",
abstract = "The present study aims to develop a new genetic algorithm utilizing population recombination and elitist refinement. Population recombination determines how a population and its elitist sub-population evolve. A whole population consists of three major sub-populations: the first is the current generation's elitist sub-population, the second is obtained from the pure crossover of the elitist sub-population with another existing sub-population, and the third is the result of a crossover between the elitist and random sub-populations. Genetic operations such as reproduction and crossover are applied among sub-populations during the process of population recombination. The refinement of the elitist sub-population is then implemented in order to improve the converged solution that was obtained from the recombination. The refinement of elitist sub-populations facilitates the locations of a more enhanced design by altering the binary values in chromosomes. The proposed method is verified through a number of nonlinear and/or multi-modal functions and constrained optimization problems.",
author = "Kwak, {Noh Sung} and Jongsoo Lee",
year = "2011",
month = "12",
day = "1",
doi = "10.1080/0305215X.2011.558577",
language = "English",
volume = "43",
pages = "1367--1384",
journal = "Engineering Optimization",
issn = "0305-215X",
publisher = "Taylor and Francis Ltd.",
number = "12",

}

An implementation of new selection strategies in a genetic algorithm - Population recombination and elitist refinement. / Kwak, Noh Sung; Lee, Jongsoo.

In: Engineering Optimization, Vol. 43, No. 12, 01.12.2011, p. 1367-1384.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An implementation of new selection strategies in a genetic algorithm - Population recombination and elitist refinement

AU - Kwak, Noh Sung

AU - Lee, Jongsoo

PY - 2011/12/1

Y1 - 2011/12/1

N2 - The present study aims to develop a new genetic algorithm utilizing population recombination and elitist refinement. Population recombination determines how a population and its elitist sub-population evolve. A whole population consists of three major sub-populations: the first is the current generation's elitist sub-population, the second is obtained from the pure crossover of the elitist sub-population with another existing sub-population, and the third is the result of a crossover between the elitist and random sub-populations. Genetic operations such as reproduction and crossover are applied among sub-populations during the process of population recombination. The refinement of the elitist sub-population is then implemented in order to improve the converged solution that was obtained from the recombination. The refinement of elitist sub-populations facilitates the locations of a more enhanced design by altering the binary values in chromosomes. The proposed method is verified through a number of nonlinear and/or multi-modal functions and constrained optimization problems.

AB - The present study aims to develop a new genetic algorithm utilizing population recombination and elitist refinement. Population recombination determines how a population and its elitist sub-population evolve. A whole population consists of three major sub-populations: the first is the current generation's elitist sub-population, the second is obtained from the pure crossover of the elitist sub-population with another existing sub-population, and the third is the result of a crossover between the elitist and random sub-populations. Genetic operations such as reproduction and crossover are applied among sub-populations during the process of population recombination. The refinement of the elitist sub-population is then implemented in order to improve the converged solution that was obtained from the recombination. The refinement of elitist sub-populations facilitates the locations of a more enhanced design by altering the binary values in chromosomes. The proposed method is verified through a number of nonlinear and/or multi-modal functions and constrained optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=84863156190&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863156190&partnerID=8YFLogxK

U2 - 10.1080/0305215X.2011.558577

DO - 10.1080/0305215X.2011.558577

M3 - Article

AN - SCOPUS:84863156190

VL - 43

SP - 1367

EP - 1384

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 12

ER -