arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.15052eess.SYcs.SY
收藏

基于元启发式算法的工业控制系统结构优化

On the Structural Optimization of Industrial Control Systems Using Metaheuristic Algorithms

NEXT engineering, LLC(NEXT工程有限责任公司)

Ruslan Zakirzyanov

AI总结:

本文针对工业控制系统架构优化的NP难问题,提出结合确定性层次构建与改进蚁群优化的混合元启发式算法,实验表明其在高I/O实例上成本更优且速度更快,可用于工业级早期架构设计。

摘要:

本文针对连续过程用自动过程控制系统(APCS)的成本最优硬件架构综合问题展开研究,将该问题形式化为满足I/O通道数量、通信接口类型与数量、处理器信息容量、调节时间及可靠性约束的设备最小成本有根树搜索问题,信号按控制室分组。该问题为NP难问题,本文提出一种混合方法,将确定性层次结构构建与改进蚁群优化(ACO)相结合,用于设备类型选择,并引入自适应启发式增强。在10个实例上,将该方法与遗传算法(GA)、粒子群优化(PSO)、模拟退火(SA)及CP-SAT各运行30次进行对比:在最佳发现成本上,混合ACO在所有I/O数量超100的实例上均优于GA、PSO和SA,提升幅度为14%-38%,且运行速度快9-14倍;但在中位成本上,确定性贪心基线更可靠(GA取得最佳Friedman秩),因ACO运行的成本波动极大,所有差异均经Friedman和Wilcoxon检验确认。该方法面向早期设计阶段的低成本可行架构搜索,可在数分钟内综合出工业规模(A达1086)的架构。

英文摘要:

The paper addresses the synthesis of a cost-optimal hardware architecture of the automated process control system (APCS) for continuous processes. The problem is formalized as the search for a minimum-cost rooted tree of devices subject to constraints on the number of I/O channels, the types and number of communication interfaces, the information capacity of processors, the regulation time and the reliability. The signals are grouped by control rooms. The problem is NP-hard, and a hybrid method is proposed that combines a deterministic hierarchy construction with a modified ant colony optimization (ACO) for device-type selection, enhanced by an adaptive heuristic. On ten instances the method is compared with a genetic algorithm (GA), particle swarm optimization (PSO), simulated annealing (SA) and CP-SAT over 30 runs each. By the best found cost the hybrid ACO outperforms GA, PSO and SA on all instances with more than 100 IOs (by 14-38 %) and runs 9-14 times faster. By the median cost, however, the deterministic-greedy baselines are more reliable (GA attains the best Friedman rank) because the cost of the ACO runs is highly variable. All differences are confirmed by the Friedman and Wilcoxon tests. The method targets the early-design search for the cheapest feasible architecture and synthesizes one within minutes at industrial scale (A up to 1086).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑