A parallel implementation of genetic programming that achieves super-linear performance

被引:14
作者
Andre, D [1 ]
Koza, JR
机构
[1] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
[2] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
关键词
D O I
10.1016/S0020-0255(97)10011-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researchers of genetic algorithms and genetic programming can acquire computing power that is intermediate between the power of currently available workstations and that of supercomputers at intermediate cost. This approach is illustrated by a comparison of the computational effort required to solve a benchmark problem. Because of the decoupled character of genetic programming, our approach achieved a nearly linear speed up from parallelization. In addition, for the best choice of parameters tested, the use of subpopulations delivered a super-linear speed-up in terms of the ability of the algorithm to solve the problem. Several examples are also presented where the parallel genetic programming system evolved solutions that are competitive with human performance. (C) 1998 Published by Elsevier Science Inc. All rights reserved.
引用
收藏
页码:201 / 218
页数:18
相关论文
共 28 条
  • [1] ABRAMSON D, 1994, TRANSPUT OCCAM ENG S, V37, P139
  • [2] [Anonymous], 1996, GENETIC PROGRAMMING
  • [3] [Anonymous], ADV GENETIC PROGRAMM
  • [4] BIANCHINI R, 1993, TRANSPUTER RES APPL, V6, P67
  • [5] CUI J, 1992, TRANSPUT OCCAM ENG S, V28, P246
  • [6] DANDRE B, 1996, GENETIC PROGRAMMING
  • [7] DIETZ HG, 1992, TREE924 PURD U SCH E
  • [8] DIETZ HG, 1992, TREE925 PURD U SCH E
  • [9] Goldberg D.E., 1989, GENETIC ALGORITHMS S
  • [10] Holland JH., 1992, ADAPTATION NATURAL A, DOI DOI 10.7551/MITPRESS/1090.001.0001