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

立即免费体验

基于 ER 网络的多群体遗传算法求解柔性作业车间调度问题。

Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems.

机构信息

School of Manufacturing Science and Engineering, Southwest University of Science and Technology, Mianyang, China.

School of Mechanical Engineering, Sichuan University, Chengdu, China.

出版信息

PLoS One. 2020 May 29;15(5):e0233759. doi: 10.1371/journal.pone.0233759. eCollection 2020.

DOI:10.1371/journal.pone.0233759
PMID:32470077
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC7259647/
Abstract

A genetic algorithm (GA) cannot always avoid premature convergence, and multi-population is usually used to overcome this limitation by dividing the population into several sub-populations (sub-population number) with the same number of individuals (sub-population size). In previous research, the questions of how a network structure composed of sub-populations affects the propagation rate of advantageous genes among sub-populations and how it affects the performance of GA have always been ignored. Therefore, we first propose a multi-population GA with an ER network (MPGA-ER). Then, by using the flexible job shop scheduling problem (FJSP) as an example and considering the total individual number (TIN), we study how the sub-population number and size and the propagation rate of advantageous genes affect the performance of MPGA-ER, wherein the performance is evaluated by the average optimal value and success rate based on TIN. The simulation results indicate the following regarding the performance of MPGA-ER: (i) performance shows considerable improvement compared with that of traditional GA; (ii) for an increase in the sub-population number for a certain TIN, the performance first increases slowly, and then decreases rapidly; (iii) for an increase in the sub-population size for a certain TIN, the performance of MPGA-ER first increases rapidly and then tends to remain stable; and (iv) with an increase in the propagation rate of advantageous genes, the performance first increases rapidly and then decreases slowly. Finally, we use a parameter-optimized MPGA-ER to solve for more FJSP instances and demonstrate its effectiveness by comparing it with that of other algorithms proposed in other studies.

摘要

遗传算法(GA)并不能总是避免早熟收敛,通常使用多群体来克服这一限制,即将群体划分为几个具有相同个体数量(子群体大小)的子群体(子群体数量)。在以前的研究中,网络结构由子群体组成,如何影响子群体之间有利基因的传播速度,以及如何影响 GA 的性能,这些问题一直被忽视。因此,我们首先提出了一种具有 ER 网络的多群体 GA(MPGA-ER)。然后,通过使用灵活作业车间调度问题(FJSP)作为示例,并考虑总个体数(TIN),我们研究了子群体数量和大小以及有利基因的传播速度如何影响 MPGA-ER 的性能,其中性能是基于 TIN 通过平均最优值和成功率来评估的。模拟结果表明 MPGA-ER 的性能如下:(i)与传统 GA 相比,性能有了显著提高;(ii)对于给定 TIN 的子群体数量增加,性能先缓慢增加,然后迅速下降;(iii)对于给定 TIN 的子群体大小增加,MPGA-ER 的性能先快速增加,然后趋于稳定;(iv)随着有利基因传播速度的增加,性能先快速增加,然后缓慢下降。最后,我们使用参数优化的 MPGA-ER 来解决更多的 FJSP 实例,并通过与其他研究中提出的其他算法进行比较来证明其有效性。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/a5b2a916d630/pone.0233759.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/88fee679a719/pone.0233759.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/2f4f773401ea/pone.0233759.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/d92856c87151/pone.0233759.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/7fdd6781230b/pone.0233759.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/86e5bdb21676/pone.0233759.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/0e18eaa0a82c/pone.0233759.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/060cdeb5edce/pone.0233759.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/db2809b0ca56/pone.0233759.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/ea3c549de8b0/pone.0233759.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/a5b2a916d630/pone.0233759.g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/88fee679a719/pone.0233759.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/2f4f773401ea/pone.0233759.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/d92856c87151/pone.0233759.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/7fdd6781230b/pone.0233759.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/86e5bdb21676/pone.0233759.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/0e18eaa0a82c/pone.0233759.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/060cdeb5edce/pone.0233759.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/db2809b0ca56/pone.0233759.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/ea3c549de8b0/pone.0233759.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/5d6b/7259647/a5b2a916d630/pone.0233759.g010.jpg

相似文献

1
Multi-population genetic algorithm with ER network for solving flexible job shop scheduling problems.基于 ER 网络的多群体遗传算法求解柔性作业车间调度问题。
PLoS One. 2020 May 29;15(5):e0233759. doi: 10.1371/journal.pone.0233759. eCollection 2020.
2
Different Performances of Different Intelligent Algorithms for Solving FJSP: A Perspective of Structure.不同智能算法求解 FJSP 的性能表现:结构视角
Comput Intell Neurosci. 2018 Sep 2;2018:4617816. doi: 10.1155/2018/4617816. eCollection 2018.
3
Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm.基于改进遗传算法的带运输时间的柔性作业车间调度问题求解
Math Biosci Eng. 2019 Feb 20;16(3):1334-1347. doi: 10.3934/mbe.2019065.
4
A Self-Adjusting Search Domain Method-Based Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem.基于自调整搜索域方法的遗传算法求解柔性作业车间调度问题。
Comput Intell Neurosci. 2022 Oct 10;2022:4212556. doi: 10.1155/2022/4212556. eCollection 2022.
5
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem.一种改进的遗传算法求解多 AGV 柔性作业车间调度问题。
Sensors (Basel). 2023 Apr 7;23(8):3815. doi: 10.3390/s23083815.
6
A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling.一种用于多目标柔性作业车间调度的蜜蜂进化引导非支配排序遗传算法II
Comput Intell Neurosci. 2017;2017:5232518. doi: 10.1155/2017/5232518. Epub 2017 Mar 28.
7
An Improved African Vulture Optimization Algorithm for Dual-Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problems.一种改进的非洲秃鹫优化算法,用于双资源约束的多目标柔性作业车间调度问题。
Sensors (Basel). 2022 Dec 22;23(1):90. doi: 10.3390/s23010090.
8
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem.基于禁忌搜索的多智能体遗传算法在作业车间调度问题中的研究。
PLoS One. 2019 Sep 27;14(9):e0223182. doi: 10.1371/journal.pone.0223182. eCollection 2019.
9
A Reinforcement Learning Approach for Flexible Job Shop Scheduling Problem With Crane Transportation and Setup Times.一种用于具有起重机运输和准备时间的柔性作业车间调度问题的强化学习方法。
IEEE Trans Neural Netw Learn Syst. 2024 Apr;35(4):5695-5709. doi: 10.1109/TNNLS.2022.3208942. Epub 2024 Apr 4.
10
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem.一种用于遗传算法中的群体改进的新频率分析算子,以解决作业车间调度问题。
Sensors (Basel). 2022 Jun 17;22(12):4561. doi: 10.3390/s22124561.

引用本文的文献

1
Two hybrid flow shop scheduling lines with assembly stage and compatibility constraints.两条具有装配阶段和兼容性约束的混合流水作业调度线。
PLoS One. 2024 Jun 21;19(6):e0304119. doi: 10.1371/journal.pone.0304119. eCollection 2024.
2
Preservation of Autologous Brachiocephalic Vessels with Assistance of Three-Dimensional Printing Based on Convolutional Neural Networks.基于卷积神经网络的三维打印辅助自体头臂血管保存。
Comput Math Methods Med. 2022 Mar 17;2022:6499461. doi: 10.1155/2022/6499461. eCollection 2022.
3
A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem.

本文引用的文献

1
Different Performances of Different Intelligent Algorithms for Solving FJSP: A Perspective of Structure.不同智能算法求解 FJSP 的性能表现:结构视角
Comput Intell Neurosci. 2018 Sep 2;2018:4617816. doi: 10.1155/2018/4617816. eCollection 2018.
2
Road screening and distribution route multi-objective robust optimization for hazardous materials based on neural network and genetic algorithm.基于神经网络和遗传算法的危险品道路筛选与配送路径多目标鲁棒优化
PLoS One. 2018 Jun 21;13(6):e0198931. doi: 10.1371/journal.pone.0198931. eCollection 2018.
3
Estimating risk propagation between interacting firms on inter-firm complex network.
一种用于柔性作业车间调度问题的全局-局部邻域搜索算法和禁忌搜索
PeerJ Comput Sci. 2021 May 27;7:e574. doi: 10.7717/peerj-cs.574. eCollection 2021.
企业间复杂网络中相互作用企业间风险传播的估计
PLoS One. 2017 Oct 3;12(10):e0185712. doi: 10.1371/journal.pone.0185712. eCollection 2017.
4
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.
5
Distress Propagation in Complex Networks: The Case of Non-Linear DebtRank.复杂网络中的困境传播:非线性债务排名案例
PLoS One. 2016 Oct 4;11(10):e0163825. doi: 10.1371/journal.pone.0163825. eCollection 2016.
6
Emergence of scaling in random networks.随机网络中幂律分布的出现。
Science. 1999 Oct 15;286(5439):509-12. doi: 10.1126/science.286.5439.509.
7
Collective dynamics of 'small-world' networks.“小世界”网络的集体动力学
Nature. 1998 Jun 4;393(6684):440-2. doi: 10.1038/30918.