解决旅行商问题的克隆选择算法
我正在尝试使用克隆选择算法来实现旅行商问题的解决方案。我正在为我的一个班级项目做这件事，以比较克隆选择与传统遗传算法在这个问题上的比较。我找到了一篇之前有人做过这件事的论文，我正在尝试重现。
http://www.dca.fee.unicamp。 br/~vonzuben/research/lnunes_dout/artigos/gecco00.pdf
该算法在第 5 节中有详细解释。有人知道每一代的 Memory Set 和 Population 之间的关系吗？记忆集会取代每一代的人口吗？在每一代中，是记忆集被克隆和变异，还是种群？
任何帮助将不胜感激！
I'm attempting to implement a solution to the Traveling Salesman Problem using the a Clonal Selection ALgorithm. I'm doing it for a class project of mine to compare how Clonal Selection compares with a traditional Genetic Algorithm for this problem. I've found a paper of someone who has done this before at which I am attempting to reproduce.
http://www.dca.fee.unicamp.br/~vonzuben/research/lnunes_dout/artigos/gecco00.pdf
The algorithm is explained in detail in section 5. Does anybody know the relationship between the Memory Set and the Population at each generation? Does the memory set replace the population at each generation? At each generation is it the Memory set that is cloned and mutated or is it the population?
Any help would be appreciated!
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论