• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于高阶熵的旅行商问题种群多样性度量。

High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem.

机构信息

Graduate School of Technology, Industrial and Social Sciences, Tokushima University, 2-1 Minami Josanjima, Tokusima, 770-8506, Japan

出版信息

Evol Comput. 2020 Winter;28(4):595-619. doi: 10.1162/evco_a_00268. Epub 2020 Feb 13.

DOI:10.1162/evco_a_00268
PMID:32053017
Abstract

To maintain the population diversity of genetic algorithms (GAs), we are required to employ an appropriate population diversity measure. However, commonly used population diversity measures designed for permutation problems do not consider the dependencies between the variables of the individuals in the population. We propose three types of population diversity measures that address high-order dependencies between the variables to investigate the effectiveness of considering high-order dependencies. The first is formulated as the entropy of the probability distribution of individuals estimated from the population based on an -th--order Markov model. The second is an extension of the first. The third is similar to the first, but it is based on a variable order Markov model. The proposed population diversity measures are incorporated into the evaluation function of a GA for the traveling salesman problem to maintain population diversity. Experimental results demonstrate the effectiveness of the three types of high-order entropy-based population diversity measures against the commonly used population diversity measures.

摘要

为了保持遗传算法(GA)的种群多样性,我们需要采用适当的种群多样性度量方法。然而,通常用于排列问题的种群多样性度量方法并没有考虑种群中个体变量之间的依赖关系。我们提出了三种类型的种群多样性度量方法,用于解决变量之间的高阶依赖关系,以研究考虑高阶依赖关系的有效性。第一种方法是基于 -th--阶马尔可夫模型,从种群中估计个体的概率分布的熵。第二种方法是第一种方法的扩展。第三种方法类似于第一种方法,但它基于变量阶马尔可夫模型。所提出的种群多样性度量方法被纳入旅行商问题的 GA 的评估函数中,以保持种群多样性。实验结果表明,三种基于高阶熵的种群多样性度量方法在对抗常用的种群多样性度量方法方面是有效的。

相似文献

1
High-Order Entropy-Based Population Diversity Measures in the Traveling Salesman Problem.基于高阶熵的旅行商问题种群多样性度量。
Evol Comput. 2020 Winter;28(4):595-619. doi: 10.1162/evco_a_00268. Epub 2020 Feb 13.
2
Circular Jaccard distance based multi-solution optimization for traveling salesman problems.基于循环杰卡德距离的旅行商问题多解优化
Math Biosci Eng. 2022 Mar 2;19(5):4458-4480. doi: 10.3934/mbe.2022206.
3
The entropy rate of Linear Additive Markov Processes.线性加性马尔可夫过程的熵率。
PLoS One. 2024 Apr 5;19(4):e0295074. doi: 10.1371/journal.pone.0295074. eCollection 2024.
4
A high-performance genetic algorithm: using traveling salesman problem as a case.一种高性能遗传算法:以旅行商问题为例。
ScientificWorldJournal. 2014;2014:178621. doi: 10.1155/2014/178621. Epub 2014 May 5.
5
Information flow and information production in a population system.种群系统中的信息流与信息产生
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Jul;84(1 Pt 1):011110. doi: 10.1103/PhysRevE.84.011110. Epub 2011 Jul 11.
6
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.
7
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.
8
Implementation of an effective hybrid GA for large-scale traveling salesman problems.一种用于大规模旅行商问题的有效混合遗传算法的实现。
IEEE Trans Syst Man Cybern B Cybern. 2007 Feb;37(1):92-9. doi: 10.1109/tsmcb.2006.880136.
9
A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.一种由两阶段法求解的单物品取送货旅行商问题:传感器重新定位应用。
PLoS One. 2019 Apr 17;14(4):e0215107. doi: 10.1371/journal.pone.0215107. eCollection 2019.
10
A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.基于生物计算模型的求解定额旅行商问题的并行 DNA 算法。
Comput Intell Neurosci. 2022 Aug 31;2022:1450756. doi: 10.1155/2022/1450756. eCollection 2022.