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

立即免费体验

基于遗传算法的实验室设备综合规划。

Comprehensive Planning of Laboratory Equipment Based on Genetic Algorithms.

机构信息

School of Innovation and Entrepreneurship, Shandong Women's University, Jinan, Shandong 250300, China.

出版信息

Comput Intell Neurosci. 2022 Sep 12;2022:5242251. doi: 10.1155/2022/5242251. eCollection 2022.

DOI:10.1155/2022/5242251
PMID:36131900
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9484927/
Abstract

Laboratory equipment planning is a very important task in modern enterprise management. Laboratory equipment planning by computer algorithm is a very complex NP-hard combinatorial optimization problem, so it is impossible to find an accurate algorithm in polynomial time. In this study, an improved genetic algorithm is used to solve and analyze the comprehensive planning of laboratory equipment. After analyzing the traditional heuristic algorithm and genetic algorithm to solve the simple laboratory equipment planning problem, the simple laboratory equipment planning is designed and implemented according to the principle of the heuristic algorithm. Finally, the algorithm is implemented in Python. A general equipment planning based on genetic algorithm with two selection operators is realized. Two constraints of test start and completion time are given. In the scenario of using multiple test equipment for a test project, the possible solutions of laboratory equipment planning under given constraints are analyzed. The efficiency coefficient is not necessarily a constant, it is related to the output characteristics of energy equipment. Three independent planning algorithms are used to solve the actual test requirements. One is the planning method based on manual test scheduling in the test cycle of experimental instruments, the other is the genetic algorithm for gene location crossover operator, and the third is the genetic algorithm for experimental part crossover operator. The planning solutions obtained by the three algorithms are compared from three aspects: the shortest time to complete the test, the calculation time of the algorithm, and the utilization of the test equipment.

摘要

实验室设备规划是现代企业管理中非常重要的任务。通过计算机算法进行实验室设备规划是一个非常复杂的 NP 难组合优化问题,因此不可能在多项式时间内找到准确的算法。在本研究中,使用改进的遗传算法来解决和分析实验室设备的综合规划。在分析了传统启发式算法和遗传算法来解决简单的实验室设备规划问题之后,根据启发式算法的原理设计并实现了简单的实验室设备规划。最后,在 Python 中实现了算法。实现了一个具有两个选择算子的基于遗传算法的通用设备规划。给出了两个测试开始和完成时间的约束。在使用多个测试设备进行测试项目的情况下,分析了给定约束下实验室设备规划的可能解决方案。效率系数不一定是常数,它与能源设备的输出特性有关。使用三种独立的规划算法来解决实际测试需求。一种是基于实验仪器测试周期中手动测试调度的规划方法,另一种是基于基因定位交叉算子的遗传算法,第三种是基于实验部分交叉算子的遗传算法。从完成测试的最短时间、算法的计算时间和测试设备的利用率三个方面对三种算法得到的规划解决方案进行了比较。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/5e76b1f48592/CIN2022-5242251.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/30e0cbf4487c/CIN2022-5242251.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/d105651cca09/CIN2022-5242251.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/77c13e195689/CIN2022-5242251.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/f872c2b2540a/CIN2022-5242251.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/ba9f1f8a4026/CIN2022-5242251.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/1d899297b1dd/CIN2022-5242251.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/ae3d6745d176/CIN2022-5242251.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/5e76b1f48592/CIN2022-5242251.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/30e0cbf4487c/CIN2022-5242251.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/d105651cca09/CIN2022-5242251.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/77c13e195689/CIN2022-5242251.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/f872c2b2540a/CIN2022-5242251.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/ba9f1f8a4026/CIN2022-5242251.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/1d899297b1dd/CIN2022-5242251.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/ae3d6745d176/CIN2022-5242251.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/1e80/9484927/5e76b1f48592/CIN2022-5242251.008.jpg

相似文献

1
Comprehensive Planning of Laboratory Equipment Based on Genetic Algorithms.基于遗传算法的实验室设备综合规划。
Comput Intell Neurosci. 2022 Sep 12;2022:5242251. doi: 10.1155/2022/5242251. eCollection 2022.
2
An improved chemical reaction optimization algorithm for solving the shortest common supersequence problem.一种改进的化学反应优化算法,用于解决最短公共超序列问题。
Comput Biol Chem. 2020 Oct;88:107327. doi: 10.1016/j.compbiolchem.2020.107327. Epub 2020 Jul 3.
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
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.
5
A computational efficient optimization of flow shop scheduling problems.流水车间调度问题的一种计算高效优化方法。
Sci Rep. 2022 Jan 17;12(1):845. doi: 10.1038/s41598-022-04887-8.
6
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.
7
Passive Location Resource Scheduling Based on an Improved Genetic Algorithm.基于改进遗传算法的被动定位资源调度。
Sensors (Basel). 2018 Jun 29;18(7):2093. doi: 10.3390/s18072093.
8
A Mode of Intelligent Equipment Monitoring Optimization Based on Dynamic Programming Algorithm.基于动态规划算法的智能设备监测优化模式。
Comput Intell Neurosci. 2022 Mar 18;2022:1569428. doi: 10.1155/2022/1569428. eCollection 2022.
9
A deep reinforcement learning algorithm for the rectangular strip packing problem.一种用于矩形带材打包问题的深度强化学习算法。
PLoS One. 2023 Mar 16;18(3):e0282598. doi: 10.1371/journal.pone.0282598. eCollection 2023.
10
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.

本文引用的文献

1
DRASTIC framework improvement using Stepwise Weight Assessment Ratio Analysis (SWARA) and combination of Genetic Algorithm and Entropy.采用逐步权重评估比分析法(SWARA)和遗传算法与熵的组合对 DRASTIC 框架进行改进。
Environ Sci Pollut Res Int. 2021 Sep;28(34):46704-46724. doi: 10.1007/s11356-020-11406-7. Epub 2020 Nov 17.
2
A review on genetic algorithm: past, present, and future.关于遗传算法的综述:过去、现在与未来。
Multimed Tools Appl. 2021;80(5):8091-8126. doi: 10.1007/s11042-020-10139-6. Epub 2020 Oct 31.