• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Gong, DX (Gong, DX.) | Ruan, XG (Ruan, XG.) | Qiao, JF (Qiao, JF.) (Scholars:乔俊飞)

Indexed by:

Scopus SCIE

Abstract:

This paper proposes using neural networks (NN) to implement a real coded genetic algorithm (GA) with the center of gravity crossover (CGX) and the minimal generation gap (MGG) model. With all genetic operations of GA including selection, crossover, mutation and evaluation implemented with NN modules, this approach can realize in parallel genetic operations on the whole chromosome to achieve the maximum parallel realization potential of the MGG model of the GA. At the same time expensive hardware for field programmable gate arrays (FPGA) and the high speed memory of hardware for GA can be avoided. The performance of our solution is validated with a suite of benchmark test functions. This paper suggests that implementing GA with NN is a promising research direction for greatly reducing the running time of GA.

Keyword:

real coded genetic algorithm crossover neural network minimal generation gap model parallel implementation

Author Community:

  • [ 1 ] Beijing Univ Technol, Sch Elect Informat & Control Engn, Beijing 100022, Peoples R China

Reprint Author's Address:

  • [Ruan, XG]Beijing Univ Technol, Sch Elect Informat & Control Engn, Beijing 100022, Peoples R China

Show more details

Related Keywords:

Related Article:

Source :

NEURAL COMPUTING & APPLICATIONS

ISSN: 0941-0643

Year: 2004

Issue: 3

Volume: 13

Page: 221-228

6 . 0 0 0

JCR@2022

ESI Discipline: ENGINEERING;

JCR Journal Grade:4

Cited Count:

WoS CC Cited Count: 5

SCOPUS Cited Count: 5

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 4

Affiliated Colleges:

Online/Total:578/6588233
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.