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

立即免费体验

一种改进的非洲秃鹫优化算法,用于双资源约束的多目标柔性作业车间调度问题。

An Improved African Vulture Optimization Algorithm for Dual-Resource Constrained Multi-Objective Flexible Job Shop Scheduling Problems.

机构信息

School of Electrical and Control Engineering, Shaanxi University of Science & Technology, Xi'an 710021, China.

College of Mechanical and Electrical Engineering, Shaanxi University of Science & Technology, Xi'an 710021, China.

出版信息

Sensors (Basel). 2022 Dec 22;23(1):90. doi: 10.3390/s23010090.

DOI:10.3390/s23010090
PMID:36616686
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9824686/
Abstract

According to the characteristics of flexible job shop scheduling problems, a dual-resource constrained flexible job shop scheduling problem (DRCFJSP) model with machine and worker constraints is constructed such that the makespan and total delay are minimized. An improved African vulture optimization algorithm (IAVOA) is developed to solve the presented problem. A three-segment representation is proposed to code the problem, including the operation sequence, machine allocation, and worker selection. In addition, the African vulture optimization algorithm (AVOA) is improved in three aspects: First, in order to enhance the quality of the initial population, three types of rules are employed in population initialization. Second, a memory bank is constructed to retain the optimal individuals in each iteration to increase the calculation precision. Finally, a neighborhood search operation is designed for individuals with certain conditions such that the makespan and total delay are further optimized. The simulation results indicate that the qualities of the solutions obtained by the developed approach are superior to those of the existing approaches.

摘要

根据柔性作业车间调度问题的特点,构建了一个同时考虑机器和工人约束的双资源约束柔性作业车间调度问题(DRCFJSP)模型,以最小化最大完工时间和总延迟。开发了一种改进的非洲秃鹫优化算法(IAVOA)来解决所提出的问题。提出了一种三部分表示法来对问题进行编码,包括操作序列、机器分配和工人选择。此外,从三个方面对非洲秃鹫优化算法(AVOA)进行了改进:首先,为了提高初始种群的质量,在种群初始化中采用了三种规则。其次,构建了一个记忆库来保留每个迭代中的最优个体,以提高计算精度。最后,为具有一定条件的个体设计了邻域搜索操作,以进一步优化最大完工时间和总延迟。仿真结果表明,所提出方法得到的解的质量优于现有方法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/2b68a8bb6bea/sensors-23-00090-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/b7a7b4e759a3/sensors-23-00090-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/0c674ca36de9/sensors-23-00090-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/a45febac1f18/sensors-23-00090-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/323702713e57/sensors-23-00090-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/488938ade2ed/sensors-23-00090-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/fda8d2ee7546/sensors-23-00090-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/c76968abc896/sensors-23-00090-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/41fcc42b28f7/sensors-23-00090-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/74316578e20e/sensors-23-00090-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/96f7191f8f18/sensors-23-00090-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/f8db22a66e77/sensors-23-00090-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/08721ca0d05f/sensors-23-00090-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/2b68a8bb6bea/sensors-23-00090-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/b7a7b4e759a3/sensors-23-00090-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/0c674ca36de9/sensors-23-00090-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/a45febac1f18/sensors-23-00090-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/323702713e57/sensors-23-00090-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/488938ade2ed/sensors-23-00090-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/fda8d2ee7546/sensors-23-00090-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/c76968abc896/sensors-23-00090-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/41fcc42b28f7/sensors-23-00090-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/74316578e20e/sensors-23-00090-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/96f7191f8f18/sensors-23-00090-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/f8db22a66e77/sensors-23-00090-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/08721ca0d05f/sensors-23-00090-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b565/9824686/2b68a8bb6bea/sensors-23-00090-g013.jpg

相似文献

1
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.
2
An improved ant colony optimization for solving the flexible job shop scheduling problem with multiple time constraints.一种用于解决具有多个时间约束的柔性作业车间调度问题的改进蚁群优化算法。
Math Biosci Eng. 2023 Feb 16;20(4):7519-7547. doi: 10.3934/mbe.2023325.
3
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.
4
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.
5
An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem.一种用于作业车间调度问题的具有动态邻域搜索的改进遗传算法。
Math Biosci Eng. 2023 Sep 11;20(9):17407-17427. doi: 10.3934/mbe.2023774.
6
Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization.基于改进离散粒子群优化算法的多目标柔性作业车间调度问题
Springerplus. 2016 Aug 30;5(1):1432. doi: 10.1186/s40064-016-3054-z. eCollection 2016.
7
A benchmark dataset for multi-objective flexible job shop cell scheduling.用于多目标柔性作业车间单元调度的基准数据集。
Data Brief. 2023 Dec 13;52:109946. doi: 10.1016/j.dib.2023.109946. eCollection 2024 Feb.
8
Minimizing the makespan and carbon emissions in the green flexible job shop scheduling problem with learning effects.最小化学习效应的绿色柔性作业车间调度问题的最大完工时间和碳排放。
Sci Rep. 2023 Apr 19;13(1):6369. doi: 10.1038/s41598-023-33615-z.
9
An Approach to Integrated Scheduling of Flexible Job-Shop Considering Conflict-Free Routing Problems.考虑无冲突路径问题的柔性作业车间综合调度方法。
Sensors (Basel). 2023 May 6;23(9):4526. doi: 10.3390/s23094526.
10
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.

引用本文的文献

1
An enhanced walrus optimization algorithm for flexible job shop scheduling with parallel batch processing operation.一种用于具有并行批处理操作的柔性作业车间调度的增强型海象优化算法。
Sci Rep. 2025 Feb 17;15(1):5699. doi: 10.1038/s41598-025-89527-7.
2
Sensor Network Attack Synthesis against Fault Diagnosis of Discrete Event Systems.针对离散事件系统故障诊断的传感器网络攻击合成
Sensors (Basel). 2024 Jul 9;24(14):4445. doi: 10.3390/s24144445.
3
Optimizing daylight in west-facing facades for LEED V4.1 compliance using metaheuristic approach.

本文引用的文献

1
Comparison of multiobjective evolutionary algorithms: empirical results.多目标进化算法的比较:实证结果
Evol Comput. 2000 Summer;8(2):173-95. doi: 10.1162/106365600568202.
使用元启发式方法优化朝西立面的自然采光以符合LEED V4.1标准。
Sci Rep. 2023 Dec 11;13(1):21942. doi: 10.1038/s41598-023-49025-0.
4
Performance Optimization for a Class of Petri Nets.一类 Petri 网的性能优化。
Sensors (Basel). 2023 Jan 28;23(3):1447. doi: 10.3390/s23031447.