高性能进化计算

Edwin Núñez, E. R. Banks, Paul Agarwal, Marshall McBride, Ron Liedel
{"title":"高性能进化计算","authors":"Edwin Núñez, E. R. Banks, Paul Agarwal, Marshall McBride, Ron Liedel","doi":"10.1109/HPCMP-UGC.2006.31","DOIUrl":null,"url":null,"abstract":"Evolutionary computing (EC) comprises a family of global optimization techniques that start with a random population of potential solutions and then evolve more fit solutions over many generations. To accomplish this increase in fitness, EC uses basic operations like selection, recombination, and mutation. Because of its compute- intensive nature, EC research is an obvious candidate for hosting on HPC clusters or systems. EC requires high performance computers (HPC) because the selection process needs to evaluate the fitness of each member of a population of solutions, so the more fit individuals may propagate their characteristics to the next generation of solutions. This requirement becomes even more acute because the evaluation process must be iterated over a very large number of generations. In this paper, we provide a general overview of EC, its applicability to a broad range of problems. In particular, we focus on some subclasses of EC known as genetic programming (GP), genetic algorithms (GA), hybrids, and other EC forms. This paper also discusses the architectural issues of hosting EC on a HPC cluster, and the related issue of population management. Two possible EC architectures are presented: (1) a single chromosome evaluator that treats a pool of cluster nodes as evaluators for an individual solution, and (2) a parallel evolver that manages a sub-population of solutions at each node. Advantages and disadvantages of each approach will be discussed. EC may be applied to a wide variety of problems. Applications of EC include schedule optimization, robotic navigation, image enhancement/processing, discrimination of buried unexploded ordnance, discovery of innovative electronic filter and controller designs, lens design optimization, radar response modeling, and many more. EC excels at solving high-dimensional and nonlinear problems. HPC resources have enabled the broader application of EC optimization techniques. However, at present, EC is underutilized in the HPC environment. This paper raises awareness of EC's general applicability and its power when coupled with HPC resources","PeriodicalId":173959,"journal":{"name":"2006 HPCMP Users Group Conference (HPCMP-UGC'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"High Performance Evolutionary Computing\",\"authors\":\"Edwin Núñez, E. R. Banks, Paul Agarwal, Marshall McBride, Ron Liedel\",\"doi\":\"10.1109/HPCMP-UGC.2006.31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolutionary computing (EC) comprises a family of global optimization techniques that start with a random population of potential solutions and then evolve more fit solutions over many generations. To accomplish this increase in fitness, EC uses basic operations like selection, recombination, and mutation. Because of its compute- intensive nature, EC research is an obvious candidate for hosting on HPC clusters or systems. EC requires high performance computers (HPC) because the selection process needs to evaluate the fitness of each member of a population of solutions, so the more fit individuals may propagate their characteristics to the next generation of solutions. This requirement becomes even more acute because the evaluation process must be iterated over a very large number of generations. In this paper, we provide a general overview of EC, its applicability to a broad range of problems. In particular, we focus on some subclasses of EC known as genetic programming (GP), genetic algorithms (GA), hybrids, and other EC forms. This paper also discusses the architectural issues of hosting EC on a HPC cluster, and the related issue of population management. Two possible EC architectures are presented: (1) a single chromosome evaluator that treats a pool of cluster nodes as evaluators for an individual solution, and (2) a parallel evolver that manages a sub-population of solutions at each node. Advantages and disadvantages of each approach will be discussed. EC may be applied to a wide variety of problems. Applications of EC include schedule optimization, robotic navigation, image enhancement/processing, discrimination of buried unexploded ordnance, discovery of innovative electronic filter and controller designs, lens design optimization, radar response modeling, and many more. EC excels at solving high-dimensional and nonlinear problems. HPC resources have enabled the broader application of EC optimization techniques. However, at present, EC is underutilized in the HPC environment. This paper raises awareness of EC's general applicability and its power when coupled with HPC resources\",\"PeriodicalId\":173959,\"journal\":{\"name\":\"2006 HPCMP Users Group Conference (HPCMP-UGC'06)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 HPCMP Users Group Conference (HPCMP-UGC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPCMP-UGC.2006.31\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 HPCMP Users Group Conference (HPCMP-UGC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCMP-UGC.2006.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

进化计算(EC)包括一系列全局优化技术,这些技术从潜在解决方案的随机种群开始,然后在许多代中进化出更适合的解决方案。为了实现适应度的提高,EC使用了选择、重组和突变等基本操作。由于其计算密集的性质,EC研究显然是托管在HPC集群或系统上的候选对象。EC需要高性能计算机(HPC),因为选择过程需要评估解决方案群体中每个成员的适应度,因此更适合的个体可能会将其特征传播给下一代解决方案。这个需求变得更加迫切,因为评估过程必须在非常多的代上迭代。在本文中,我们提供了电子商务的总体概述,它适用于广泛的问题。特别地,我们专注于一些被称为遗传规划(GP)、遗传算法(GA)、杂交和其他EC形式的EC子类。本文还讨论了在高性能计算集群上托管EC的体系结构问题,以及相关的人口管理问题。提出了两种可能的EC架构:(1)将集群节点池作为单个解决方案的评估器的单染色体评估器,以及(2)管理每个节点上解决方案的子种群的并行进化器。将讨论每种方法的优点和缺点。电子商务可以应用于各种各样的问题。电子商务的应用包括调度优化、机器人导航、图像增强/处理、埋藏未爆弹药的识别、创新电子滤波器和控制器设计的发现、镜头设计优化、雷达响应建模等等。电子商务擅长解决高维和非线性问题。高性能计算资源使EC优化技术得到了更广泛的应用。然而,目前,EC在HPC环境中未得到充分利用。本文提高了人们对EC的普遍适用性及其与高性能计算资源相结合的能力的认识
本文章由计算机程序翻译,如有差异,请以英文原文为准。
High Performance Evolutionary Computing
Evolutionary computing (EC) comprises a family of global optimization techniques that start with a random population of potential solutions and then evolve more fit solutions over many generations. To accomplish this increase in fitness, EC uses basic operations like selection, recombination, and mutation. Because of its compute- intensive nature, EC research is an obvious candidate for hosting on HPC clusters or systems. EC requires high performance computers (HPC) because the selection process needs to evaluate the fitness of each member of a population of solutions, so the more fit individuals may propagate their characteristics to the next generation of solutions. This requirement becomes even more acute because the evaluation process must be iterated over a very large number of generations. In this paper, we provide a general overview of EC, its applicability to a broad range of problems. In particular, we focus on some subclasses of EC known as genetic programming (GP), genetic algorithms (GA), hybrids, and other EC forms. This paper also discusses the architectural issues of hosting EC on a HPC cluster, and the related issue of population management. Two possible EC architectures are presented: (1) a single chromosome evaluator that treats a pool of cluster nodes as evaluators for an individual solution, and (2) a parallel evolver that manages a sub-population of solutions at each node. Advantages and disadvantages of each approach will be discussed. EC may be applied to a wide variety of problems. Applications of EC include schedule optimization, robotic navigation, image enhancement/processing, discrimination of buried unexploded ordnance, discovery of innovative electronic filter and controller designs, lens design optimization, radar response modeling, and many more. EC excels at solving high-dimensional and nonlinear problems. HPC resources have enabled the broader application of EC optimization techniques. However, at present, EC is underutilized in the HPC environment. This paper raises awareness of EC's general applicability and its power when coupled with HPC resources
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信