• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

遗传算法中算子的自动组合以解决旅行商问题

Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.

作者信息

Contreras-Bolton Carlos, Parada Victor

机构信息

Departamento de Ingeniería Informática, Universidad de Santiago de Chile, Santiago, Chile.

出版信息

PLoS One. 2015 Sep 14;10(9):e0137724. doi: 10.1371/journal.pone.0137724. eCollection 2015.

DOI:10.1371/journal.pone.0137724
PMID:26367182
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC4569577/
Abstract

Genetic algorithms are powerful search methods inspired by Darwinian evolution. To date, they have been applied to the solution of many optimization problems because of the easy use of their properties and their robustness in finding good solutions to difficult problems. The good operation of genetic algorithms is due in part to its two main variation operators, namely, crossover and mutation operators. Typically, in the literature, we find the use of a single crossover and mutation operator. However, there are studies that have shown that using multi-operators produces synergy and that the operators are mutually complementary. Using multi-operators is not a simple task because which operators to use and how to combine them must be determined, which in itself is an optimization problem. In this paper, it is proposed that the task of exploring the different combinations of the crossover and mutation operators can be carried out by evolutionary computing. The crossover and mutation operators used are those typically used for solving the traveling salesman problem. The process of searching for good combinations was effective, yielding appropriate and synergic combinations of the crossover and mutation operators. The numerical results show that the use of the combination of operators obtained by evolutionary computing is better than the use of a single operator and the use of multi-operators combined in the standard way. The results were also better than those of the last operators reported in the literature.

摘要

遗传算法是受达尔文进化论启发的强大搜索方法。迄今为止,由于其特性易于使用且在为难题找到良好解决方案方面具有鲁棒性,它们已被应用于许多优化问题的求解。遗传算法的良好运行部分归功于其两个主要的变异算子,即交叉算子和变异算子。通常,在文献中,我们发现使用的是单一的交叉和变异算子。然而,有研究表明使用多个算子会产生协同作用,并且这些算子相互补充。使用多个算子并非易事,因为必须确定使用哪些算子以及如何将它们组合起来,而这本身就是一个优化问题。本文提出,可以通过进化计算来完成探索交叉和变异算子不同组合的任务。所使用的交叉和变异算子是通常用于解决旅行商问题的那些算子。寻找良好组合的过程是有效的,产生了交叉和变异算子的合适且协同的组合。数值结果表明,使用通过进化计算获得的算子组合比使用单一算子以及以标准方式组合的多个算子更好。结果也优于文献中报道的最新算子的结果。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/64a32f673552/pone.0137724.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/bdfb8e731f06/pone.0137724.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/af86cedee064/pone.0137724.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/4f41c961b591/pone.0137724.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/9e54da4665f0/pone.0137724.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/39b88a5fffac/pone.0137724.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/afb038066e30/pone.0137724.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/64a32f673552/pone.0137724.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/bdfb8e731f06/pone.0137724.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/af86cedee064/pone.0137724.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/4f41c961b591/pone.0137724.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/9e54da4665f0/pone.0137724.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/39b88a5fffac/pone.0137724.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/afb038066e30/pone.0137724.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0006/4569577/64a32f673552/pone.0137724.g007.jpg

相似文献

1
Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.遗传算法中算子的自动组合以解决旅行商问题
PLoS One. 2015 Sep 14;10(9):e0137724. doi: 10.1371/journal.pone.0137724. eCollection 2015.
2
Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.遗传算法与改进的环交叉算子在旅行商问题中的应用。
Comput Intell Neurosci. 2017;2017:7430125. doi: 10.1155/2017/7430125. Epub 2017 Oct 25.
3
Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems.基于子种群的遗传算法的变异算子对多机器人任务分配问题的性能影响。
Springerplus. 2016 Aug 18;5(1):1361. doi: 10.1186/s40064-016-3027-2. eCollection 2016.
4
A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima.一种新的旅行商问题广义分区交叉算子:局部最优之间的隧道。
Evol Comput. 2020 Summer;28(2):255-288. doi: 10.1162/evco_a_00254. Epub 2019 Mar 22.
5
The role of crossover operator in evolutionary-based approach to the problem of genetic code optimization.交叉算子在基于进化方法解决遗传密码优化问题中的作用。
Biosystems. 2016 Dec;150:61-72. doi: 10.1016/j.biosystems.2016.08.008. Epub 2016 Aug 20.
6
Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.基于受黏菌启发的数学模型的多目标蚁群优化算法求解双目标旅行商问题
PLoS One. 2016 Jan 11;11(1):e0146709. doi: 10.1371/journal.pone.0146709. eCollection 2016.
7
A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem.一种用于旅行商问题的离散果蝇优化算法。
PLoS One. 2016 Nov 3;11(11):e0165804. doi: 10.1371/journal.pone.0165804. eCollection 2016.
8
An evolutionary algorithm for large traveling salesman problems.一种求解大型旅行商问题的进化算法。
IEEE Trans Syst Man Cybern B Cybern. 2004 Aug;34(4):1718-29. doi: 10.1109/tsmcb.2004.828283.
9
Differential evolution with ranking-based mutation operators.基于排序的变异算子的差分进化。
IEEE Trans Cybern. 2013 Dec;43(6):2066-81. doi: 10.1109/TCYB.2013.2239988.
10
Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.基于人工协同搜索算法的旅行商问题求解。
Comput Intell Neurosci. 2022 Apr 12;2022:1008617. doi: 10.1155/2022/1008617. eCollection 2022.

引用本文的文献

1
PseudoGA: cell pseudotime reconstruction based on genetic algorithm.伪 GA:基于遗传算法的细胞伪时间重建。
Nucleic Acids Res. 2021 Aug 20;49(14):7909-7924. doi: 10.1093/nar/gkab457.
2
Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.基于改进遗传算法的双路径约束多AGV路径规划
PLoS One. 2017 Jul 26;12(7):e0181747. doi: 10.1371/journal.pone.0181747. eCollection 2017.
3
Dynamic Staffing and Rescheduling in Software Project Management: A Hybrid Approach.软件项目管理中的动态人员配置与重新调度:一种混合方法。

本文引用的文献

1
Automatically generated algorithms for the vertex coloring problem.自动生成顶点着色问题的算法。
PLoS One. 2013;8(3):e58551. doi: 10.1371/journal.pone.0058551. Epub 2013 Mar 13.
PLoS One. 2016 Jun 10;11(6):e0157104. doi: 10.1371/journal.pone.0157104. eCollection 2016.