RasID-GA with Simplex Crossover(SPX) for optimization problems

DongKyu Sohn, Shingo Mabu, Kotaro Hirasawa, Takayuki Furuzuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) which improves the ability of diversification searching with Simplex Crossover (SPX). SPX generates the offspring based on uniform probability distribution and uses the M + 1 number of parent vectors, where M is the dimension of the vector. The RasIDGA with Simplex Crossover is compared with parallel RasIDs and GA with Simplex Crossover using 23 different objective functions having no local minima, a small number of local minima and a large number of local minima.

Original languageEnglish
Title of host publication2006 IEEE Congress on Evolutionary Computation, CEC 2006
Pages3021-3028
Number of pages8
Publication statusPublished - 2006
Event2006 IEEE Congress on Evolutionary Computation, CEC 2006 - Vancouver, BC
Duration: 2006 Jul 162006 Jul 21

Other

Other2006 IEEE Congress on Evolutionary Computation, CEC 2006
CityVancouver, BC
Period06/7/1606/7/21

Fingerprint

Crossover
Local Minima
Optimization Problem
Diversification
Probability distributions
Genetic algorithms
Abbreviation
Random Search
Uniform distribution
Probability Distribution
Objective function
Genetic Algorithm
Gas

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Theoretical Computer Science

Cite this

Sohn, D., Mabu, S., Hirasawa, K., & Furuzuki, T. (2006). RasID-GA with Simplex Crossover(SPX) for optimization problems. In 2006 IEEE Congress on Evolutionary Computation, CEC 2006 (pp. 3021-3028). [1688690]

RasID-GA with Simplex Crossover(SPX) for optimization problems. / Sohn, DongKyu; Mabu, Shingo; Hirasawa, Kotaro; Furuzuki, Takayuki.

2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. p. 3021-3028 1688690.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sohn, D, Mabu, S, Hirasawa, K & Furuzuki, T 2006, RasID-GA with Simplex Crossover(SPX) for optimization problems. in 2006 IEEE Congress on Evolutionary Computation, CEC 2006., 1688690, pp. 3021-3028, 2006 IEEE Congress on Evolutionary Computation, CEC 2006, Vancouver, BC, 06/7/16.
Sohn D, Mabu S, Hirasawa K, Furuzuki T. RasID-GA with Simplex Crossover(SPX) for optimization problems. In 2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. p. 3021-3028. 1688690
Sohn, DongKyu ; Mabu, Shingo ; Hirasawa, Kotaro ; Furuzuki, Takayuki. / RasID-GA with Simplex Crossover(SPX) for optimization problems. 2006 IEEE Congress on Evolutionary Computation, CEC 2006. 2006. pp. 3021-3028
@inproceedings{120182e7aa9046f2ba5b46c06d2623a1,
title = "RasID-GA with Simplex Crossover(SPX) for optimization problems",
abstract = "In this paper, we propose RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) which improves the ability of diversification searching with Simplex Crossover (SPX). SPX generates the offspring based on uniform probability distribution and uses the M + 1 number of parent vectors, where M is the dimension of the vector. The RasIDGA with Simplex Crossover is compared with parallel RasIDs and GA with Simplex Crossover using 23 different objective functions having no local minima, a small number of local minima and a large number of local minima.",
author = "DongKyu Sohn and Shingo Mabu and Kotaro Hirasawa and Takayuki Furuzuki",
year = "2006",
language = "English",
isbn = "0780394879",
pages = "3021--3028",
booktitle = "2006 IEEE Congress on Evolutionary Computation, CEC 2006",

}

TY - GEN

T1 - RasID-GA with Simplex Crossover(SPX) for optimization problems

AU - Sohn, DongKyu

AU - Mabu, Shingo

AU - Hirasawa, Kotaro

AU - Furuzuki, Takayuki

PY - 2006

Y1 - 2006

N2 - In this paper, we propose RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) which improves the ability of diversification searching with Simplex Crossover (SPX). SPX generates the offspring based on uniform probability distribution and uses the M + 1 number of parent vectors, where M is the dimension of the vector. The RasIDGA with Simplex Crossover is compared with parallel RasIDs and GA with Simplex Crossover using 23 different objective functions having no local minima, a small number of local minima and a large number of local minima.

AB - In this paper, we propose RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) which improves the ability of diversification searching with Simplex Crossover (SPX). SPX generates the offspring based on uniform probability distribution and uses the M + 1 number of parent vectors, where M is the dimension of the vector. The RasIDGA with Simplex Crossover is compared with parallel RasIDs and GA with Simplex Crossover using 23 different objective functions having no local minima, a small number of local minima and a large number of local minima.

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

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

M3 - Conference contribution

SN - 0780394879

SN - 9780780394872

SP - 3021

EP - 3028

BT - 2006 IEEE Congress on Evolutionary Computation, CEC 2006

ER -