Gaussian Linear Regression Crossover for Genetic Algorithms

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Gholamnezhad Pezhman

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2022 | Volume:9 | Issue:1 Page(s): 45-56

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Gaussian Linear Regression Crossover for Genetic Algorithms

Author(s)

Gholamnezhad Pezhman | Issue Writer Certificate

Keywords

Genetic Algorithm

Crossover

Simulated Binary Crossover (SBX)

Gaussian Process

Bayesian Linear Regression

Abstract

In the simulated binary Crossover, offspring are generated from parents with a coefficient of variation and uses a probability distribution function for the coefficient and there is a linear relationship between parents and offspring. Most existing methods of Crossover operators generate offspring on the solution on the decision space during the search and so far, no suggestion has been proposed on making a regression model for generating the offspring on the objective space. In this paper, a Gaussian linear regression Crossover has been proposed. The idea is to apply linear regression to model a relationship between parents and offspring in Crossover operations through the Gaussian Process. The reason for using this process is that the probability distribution of the simulated binary operator is based on the parent in the mating pool on decision space, while the probability distribution of the proposed method is on objective space in the mating pool. To optimize problems on the combinatorial sets, the proposed method is applied. The performance of the proposed algorithm was tested on Computational Expensive Optimization benchmark tests and indicates that the proposed operator is a competitive and promising approach.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans