有关遗传算法终止条件的书籍资源
我目前正在写一篇关于遗传算法的论文。我想有一个关于终止条件的小节，它确定算法何时必须停止。
我发现这个不错的网站：
http://www.nd.com/genic/termination.html
其中列出了一些确定遗传算法中终止条件的好方法。然而，负责我论文的教授非常不愿意接受随机的互联网站点作为来源。
您能否提供一些有关书籍的推荐（如果我能以电子书形式获得它们，那就太好了），其中包含有关这些终止条件的更多信息，并可能扩展各种方法的优点或缺点？
I'm currently writing a paper on genetic algorithms. I'd like to have a small subsection on the termination condition which determines when the algorithm has to stop.
I found this nice site:
http://www.nd.com/genetic/termination.html
which lists some nice methods via which the termination condition in genetic algorithms is determined. However, the professor who's in charge of my paper is very reluctant to accept random internet sites as sources.
Can you give some recommendations on books (would be very good if I can get my hands on them in e-book form) which contain more information about these termination conditions and maybe expand on the various method's advantages or disadvantages?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
不幸的是，尽管这是一个非常有趣的研究领域，但迄今为止却很少受到关注。
尽管最初的问题最初是请求一本书，但您可能会对这篇已发表的文章感兴趣，该文章讨论了一些终止标准：On Stopping Criteria for Genetic Algorithms（Martín Safe、Jessica Carballido、Ignacio Ponzoni 和 Nélida Brignole），网址为：http://www.springerlink.com/content/cgt7635e3lhu3pdn/
您可能还有兴趣阅读几页博士论文“使用信息论概念分析和改进遗传算法”来自 John Milton，第 3.6 节（第 127 页及以下），其中讨论了一些终止条件。位于：http://epress.lib.uts.edu.au/scholarly-works/bitstream/handle/2100/1004/02Whole.pdf?sequence=2
Unfortunately, although this is a very interesting field of research, it has only received little attention until now.
Although the original question was originally requesting a book, you might be interested in this published article that discuss some termination criteria: On Stopping Criteria for Genetic Algorithms (Martín Safe, Jessica Carballido, Ignacio Ponzoni and Nélida Brignole) at this url: http://www.springerlink.com/content/cgt7635e3lhu3pdn/
You might also be interested in reading a few pages the PhD thesis "Analysis and Improvement of Genetic Algorithms using Concepts from Information Theory" from John Milton, section 3.6 (pages 127 and following), which discuss some termination conditions. Available at: http://epress.lib.uts.edu.au/scholarly-works/bitstream/handle/2100/1004/02Whole.pdf?sequence=2
您最好的选择可能是关于遗传算法的任何好的一般介绍性文本，其中可能会简要提及可能的终止标准。我手上唯一一本这样的书是遗传编程现场指南（GP与 GA 密切相关）。其中有一个简短的段落（第 3.5 节），其中提到了最大代数，或“特定于问题的成功谓词”。在实践中，这两个是最常用的，后者只是意味着只要找到完整的解决方案就停止。
Your best bet is probably any good general introductory text on genetic algorithms, which are likely to have a brief mention of possible termination criterion. The only such book I had to hand was A Field Guide to Genetic Programming (GP being very closely related to GA). In there, there is a short paragraph (section 3.5), which mention maximum number of generations, or "a problem-specific success predicate". In practice these two are the most used, with the latter just meaning stop whenever a complete solution is found.