Campus Units

Electrical and Computer Engineering

Document Type

Conference Proceeding

Conference

2009 11th International Conference on Computer Modelling and Simulation

Publication Version

Accepted Manuscript

Link to Published Version

https://doi.org/10.1109/UKSIM.2009.119

Publication Date

2009

Journal or Book Title

2009 11th International Conference on Computer Modelling and Simulation

First Page

47

Last Page

52

DOI

10.1109/UKSIM.2009.119

Conference Title

2009 11th International Conference on Computer Modelling and Simulation

Conference Date

March 25-27, 2009

City

Cambridge, UK

Abstract

Genetic algorithms are robust parallel calculation methods based on natural selection. Various crossover and mutation methods to accomplish Genetic Algorithm (GA), namely, single point, multipoint, uniform, greedy, migration, and on-demand etc.; exist. However, these mechanisms are static in nature. This paper presents a dynamic crossover (DC) mechanism. We investigate its performance by implementing in hardware (FPGA) with convergence rate and higher fitness as the performance metric. The purpose of the DC concept is two fold; to achieve faster convergence and to consume lesser memory by keeping the population size static. The results indicate that for a linear and a nonlinear objective function, DC outperforms all static crossover mechanisms.

Comments

This is a manuscript of a proceeding published as Kher, Shubhalaxmi, T. S. Ganesh, Prem Ramesh, and Arun K. Somani. "Greedy dynamic crossover management in hardware accelerated genetic algorithm implementations using FPGA." In 2009 11th International Conference on Computer Modelling and Simulation (2009): 47-52. DOI: 10.1109/UKSIM.2009.119. Posted with permission.

Rights

© 2009 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Published Version

Share

Article Location

 
COinS