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

立即免费体验

基于参数迭代更新策略的蚁群优化算法的地下水污染监测网最优布局设计。

Optimal layout design of groundwater pollution monitoring network using parameter iterative updating strategy-based ant colony optimization algorithm.

机构信息

Key Laboratory of Groundwater Resources and Environment (Jilin University), Ministry of Education, Changchun, 130021, China.

Jilin Provincial Key Laboratory of Water Resources and Environment, Jilin University, Changchun, 130021, China.

出版信息

Environ Sci Pollut Res Int. 2023 Nov;30(53):114535-114555. doi: 10.1007/s11356-023-30228-x. Epub 2023 Oct 20.

DOI:10.1007/s11356-023-30228-x
PMID:37861835
Abstract

The scientific layout design of the groundwater pollution monitoring network (GPMN) can provide high quality groundwater monitoring data, which is essential for the timely detection and remediation of groundwater pollution. The simulation optimization approach was effective in obtaining the optimal design of the GPMN. The ant colony optimization (ACO) algorithm is an effective method for solving optimization models. However, the parameters used in the conventional ACO algorithm are empirically adopted with fixed values, which may affect the global searchability and convergence speed. Therefore, a parameter-iterative updating strategy-based ant colony optimization (PIUSACO) algorithm was proposed to solve this problem. For the GPMN optimal design problem, a simulation-optimization framework using PIUSACO algorithm was applied in a municipal waste landfill in BaiCheng city in China. Moreover, to reduce the computational load of the design process while considering the uncertainty of aquifer parameters and pollution sources, a genetic algorithm-support vector regression (GA-SVR) method was proposed to develop the surrogate model for the numerical model. The results showed that the layout scheme obtained using the PIUSACO algorithm had a significantly higher detection rate than ACO algorithm and random layout schemes, indicating that the designed layout scheme based on the PIUSACO algorithm can detect the groundwater pollution occurrence timely. The comparison of the iteration processes of the PIUSACO and conventional ACO algorithms shows that the global searching ability is improved and the convergence speed is accelerated significantly using the iteration updating strategy of crucial parameters. This study demonstrates the feasibility of the PIUSACO algorithm for the optimal layout design of the GPMN for the timely detection of groundwater pollution.

摘要

地下水污染监测网络(GPMN)的科学布局设计可以提供高质量的地下水监测数据,这对于及时发现和修复地下水污染至关重要。模拟优化方法在获得 GPMN 的最佳设计方面非常有效。蚁群优化(ACO)算法是解决优化模型的有效方法。然而,传统 ACO 算法中使用的参数是通过经验采用固定值的,这可能会影响全局搜索能力和收敛速度。因此,提出了一种基于参数迭代更新策略的蚁群优化(PIUSACO)算法来解决这个问题。对于 GPMN 最优设计问题,应用基于 PIUSACO 算法的模拟-优化框架在中国白城市的一个市政垃圾填埋场中进行了应用。此外,为了在考虑含水层参数和污染源不确定性的情况下降低设计过程的计算负荷,提出了一种遗传算法-支持向量回归(GA-SVR)方法来为数值模型开发代理模型。结果表明,与 ACO 算法和随机布局方案相比,PIUSACO 算法获得的布局方案具有更高的检测率,这表明基于 PIUSACO 算法设计的布局方案能够及时检测到地下水污染的发生。PIUSACO 和传统 ACO 算法的迭代过程比较表明,通过关键参数的迭代更新策略,可以显著提高全局搜索能力并加速收敛速度。本研究证明了 PIUSACO 算法在地下水污染及时检测方面用于 GPMN 最优布局设计的可行性。

相似文献

1
Optimal layout design of groundwater pollution monitoring network using parameter iterative updating strategy-based ant colony optimization algorithm.基于参数迭代更新策略的蚁群优化算法的地下水污染监测网最优布局设计。
Environ Sci Pollut Res Int. 2023 Nov;30(53):114535-114555. doi: 10.1007/s11356-023-30228-x. Epub 2023 Oct 20.
2
Machine learning-based optimal design of groundwater pollution monitoring network.基于机器学习的地下水污染监测网络优化设计。
Environ Res. 2022 Aug;211:113022. doi: 10.1016/j.envres.2022.113022. Epub 2022 Mar 10.
3
Optimal design of groundwater pollution monitoring network based on a back-propagation neural network surrogate model and grey wolf optimizer algorithm under uncertainty.基于反向传播神经网络代理模型和灰狼优化算法的不确定性地下水污染监测网络优化设计。
Environ Monit Assess. 2024 Jan 10;196(2):132. doi: 10.1007/s10661-023-12276-5.
4
Optimal design of groundwater pollution monitoring network based on the SVR surrogate model under uncertainty.基于不确定性下 SVR 替代模型的地下水污染监测网络的优化设计。
Environ Sci Pollut Res Int. 2020 Jul;27(19):24090-24102. doi: 10.1007/s11356-020-08758-5. Epub 2020 Apr 17.
5
Multiobjective optimization of the groundwater exploitation layout in coastal areas based on multiple surrogate models.基于多个替代模型的沿海地区地下水开采布局的多目标优化。
Environ Sci Pollut Res Int. 2020 Jun;27(16):19561-19576. doi: 10.1007/s11356-020-08367-2. Epub 2020 Mar 26.
6
Design and validation of a multi-objective waypoint planning algorithm for UAV spraying in orchards based on improved ant colony algorithm.基于改进蚁群算法的果园无人机喷雾多目标航点规划算法设计与验证
Front Plant Sci. 2023 Feb 2;14:1101828. doi: 10.3389/fpls.2023.1101828. eCollection 2023.
7
Dynamic Load Balancing of Software-Defined Networking Based on Genetic-Ant Colony Optimization.基于遗传-蚁群优化的软件定义网络动态负载均衡。
Sensors (Basel). 2019 Jan 14;19(2):311. doi: 10.3390/s19020311.
8
Multi-objective groundwater management strategy under uncertainties for sustainable control of saltwater intrusion: Solution for an island country in the South Pacific.多目标地下水管理策略在不确定性下的可持续控制海水入侵:一个南太平洋岛国的解决方案。
J Environ Manage. 2019 Mar 15;234:115-130. doi: 10.1016/j.jenvman.2018.12.054. Epub 2019 Jan 4.
9
A scheduling route planning algorithm based on the dynamic genetic algorithm with ant colony binary iterative optimization for unmanned aerial vehicle spraying in multiple tea fields.一种基于动态遗传算法与蚁群二进制迭代优化的多茶园无人机喷施调度路径规划算法
Front Plant Sci. 2022 Sep 16;13:998962. doi: 10.3389/fpls.2022.998962. eCollection 2022.
10
Chance-constrained multi-objective optimization of groundwater remediation design at DNAPLs-contaminated sites using a multi-algorithm genetically adaptive method.基于多算法遗传自适应方法的DNAPLs污染场地地下水修复设计的机会约束多目标优化
J Contam Hydrol. 2017 May;200:15-23. doi: 10.1016/j.jconhyd.2017.03.004. Epub 2017 Mar 14.