基于改进海洋捕食者优化算法和瑞雷波频散曲线的近地表地层参数反演

面波勘探是获取近地表地质结构的重要手段,利用瑞雷波频散曲线可以反演得到地层横波速度和厚度或泊松比等参数.本文提出了一种新的优化策略来处理瑞雷波频散曲线的反演问题.改进海洋捕食者算法（ACMPA）是一种改进混沌初始化,引入自适应步长和精英竞赛机制优化的反演算法.采用混沌映射进行种群位置初始化,提高初始化种群位置的质量;加入自适应函数,增强全局搜索能力;引入精英等级制度,避免算法陷入局部极值点,从而从局部和全局寻优进行优化,提高反演的收敛速度.通过正演模拟和实测数据进行测试分析,证明了改进的海洋捕食者优化算法的有效性与稳定性.该方法可以利用瑞雷波频散曲线信息反演得到近地表地层的介质参数,其收敛精度和收敛范围明显优于其他优化算法,具有较强的应用前景.

     

改进的地壳速度结构遗传反演方法

遗传算法的收敛速度与模型参数初始搜索范围的划分精度有关.本文提出了在低精度的基础上开始迭代,在选代过程中逐步缩小搜索范围的改进措施.这种改进使得遗传算法的收敛速度和反演精度同时得到提高,并且又不增加模型空间的大小.一维地壳速度结构的反演计算结果表明方法是有效的.最后给出了实际应用中应采用的反演策略.     

一种改进的全局优化算法及其在面波频散曲线反演中的应用

建议一种SA和GA相结合的策略,较好地解决了GA收敛早熟及SA搜索效率较低的问题,提高了全局优化计算效率;在应用其依据面波频散曲线反演工程场地剪切波速时,利用简化剥层法提供较小的模型空间,取得了较好的反演效果.     

自适应对数螺旋路径萤火虫算法反演瑞雷面波频散曲线

瑞雷面波技术是浅地层地质勘探的重要手段之一, 通过瑞雷面波频散曲线反演可有效获得地下横波速度模型.然而, 瑞雷面波频散曲线反演具有多参数、多极值和非线性等特点, 面对复杂地震-地质条件下的瑞雷面波资料处理, 传统方法难以快速、精确地对地层参数进行反演和重建.本文将自适应对数螺旋路径萤火虫算法(Adaptive Logarithmic Spiral-Lévy Firefly Algorithm, 简称ALSL-FA)引入到瑞雷面波频散曲线反演中, 有效解决了经典萤火虫算法(Firefly Algorithm, 简称FA)精于探索, 疏于开发的缺点.ALSL-FA集成了对数螺旋引导萤火虫路径, 并在搜索过程中通过自适应切换因子实现了全局搜索与局部开发自适应切换, 在增强局部开发能力的同时, 确保了全局搜索的能力.通过Rastrigin函数求解, 对比分析了FA、Lévy飞行萤火虫算法(Lévy Flying Firefly Algorithm, 简称LF-FA)和ALSL-FA的运算性能; 通过速度递增和含高速硬夹层地质模型的瑞雷面波频散曲线反演, 比较了人工蜂群算法(Artificial Bee Colony algorithm, 简称ABC)、FA、LF-FA和ALSL-FA的反演结果, 验证了本文方法的正确性和抗噪能力, 并进一步应用于一套实际瑞雷面波资料反演处理.研究结果表明, 本文方法有效弱化了对初始模型的依赖, 并进一步提高了反演的精度, 具有较强的全局寻优能力和局部开发能力, 同时兼备良好的抗噪性能.

     

基于萤火虫和蝙蝠群智能算法的瑞雷波频散曲线反演

反演瑞雷波频散曲线能有效获取地层横波速度和厚度.但由于其高度的非线性、多参数、多极值等特点,传统的全局搜索方法易出现收敛速度慢、早熟收敛及搜索精度低的问题.鉴于此,本文提出并测试了基于萤火虫优化算法（FA）和带惯性权重的蝙蝠优化算法（WBA）的新的瑞雷波频散曲线反演策略.在瑞雷波频散曲线反演中,FA全局搜索能力强,但后期搜索精度低,而WBA局部搜索能力强,搜索精度高,但易出现早熟收敛.故本文将二者结合,提出了一种新的优化策略,称其为WFBA,即在反演前期使用FA,后期使用WBA,很好地解决了FA后期搜索精度低及WBA早熟收敛的问题.本文首先反演了三个典型理论模型的无噪声、含噪声的数据,验证了WFBA对瑞雷波数据反演的有效性与稳定性.然后将WFBA与WBA、FA单独反演以及不含惯性权重的FBA和粒子群优化算法（PSO）反演的结果进行了对比,说明了WFBA相对于WBA、FA、FBA和PSO具有更稳定、收敛速度更快、求解精度更高等优点.最后,反演了来自美国怀俄明地区的实测资料,检验了WFBA对瑞雷波数据反演的实用性.理论模型试算和实测资料分析表明,WFBA很适用于瑞雷波频散曲线的定量解释,具有很高的实用性价值.

     

小生境遗传算法求解多峰问题在反演中应用

基于反演问题的不确定性和目标函数的多峰性，引入改进的小生境遗传算法，求解出目标函数的若干个局部峰（或全局峰），然后利用先验知识，判定得到满意解，并利用褶积模型进行层速度反演，通过理论速度与反演速度的比较，验证了进行多峰优化的有效性。     

基于IGA算法的电阻率神经网络反演成像研究

为满足地球物理资料反演解释的高精度、快速、稳定的要求,本文结合免疫遗传算法寻优速度快和BP神经网络反演不依赖初始模型等优点,设计了一种将BP神经网络和免疫遗传算法进行有机结合的全局优化反演策略,并将该策略成功地应用于二维高密度电法数据反演.利用免疫遗传算法（Immune Genetic Algorithm,简称IGA）对神经网络的反演参数进行同步优化,提高了电阻率反演的精度.仿真和实验结果验证设计的全局优化反演策略取得了较好的效果,通过与线性反演方法和BP法以及遗传神经网络法等反演方法进行比较,得出该方法具有反演精度更高,反演时间更短等显著优势的结论.     

Coarse-grained parallel genetic algorithm applied to a vector based land use allocation optimization problem: the case study of Tongzhou Newtown, Beijing, China

A Coarse-Grained Parallel Genetic Algorithm (CGPGA) is utilized to search for near-optimal solutions for land use allocation optimization problems in the context of multiple objectives and constraints. Plans are obtained based on the trade-off among three spatial objectives including ecological benefit, accessibility and compatibility. The Multi-objective Optimization of Land Use model integrates these objectives with the fitness function assessed by reference point method (goal programming). The CGPGA, as the first coupling in land use allocation optimization problems, is tested through the experiments with one processor, two processors and four processors to pursue near-optimal land use allocation scenarios and the comparison to these experiments based on Generic Genetic Algorithm (GGA), which clearly shows the robustness of the model we proposed as well as its better performance. Furthermore, the successful convergent (near-convergent) case study utilizing the CGPGA in Tongzhou Newtown, Beijing, China evinces the capability and potential of CGPGA in solving land use allocation optimization problems with better efficiency and effectiveness than GGA.     

基于遗传算法的CSAMT最小构造反演

利用遗传算法进行不考虑近场校正的全场资料CSAMT反演研究.遗传算法属于全局最优化方法,具有对初始模型依赖小,不易陷入局部极值的优点,然而,当未知数较多时,多解性仍是该方法的瓶颈.为了减小多层反演的多解性,在反演中引入最小构造约束,针对CSAMT的遗传算法反演问题定义了最小构造目标函数,经过模型试验找到了其具体表达式,并找到了适合CSAMT资料反演的拉格朗日乘子的最佳取值μ=0.5,实现了基于遗传算法的CSAMT最小构造反演.利用H、A、K、Q和HKH、KHA模型对方法进行了数值试验,在无噪和加入10％噪声情况下,反演结果与模型一致;加入20％噪声后,反演仍取得良好结果,与理论模型基本吻合.将该方法用于水平层状地层和横向变化地层的实测资料反演,结果与地质资料吻合.不同的计算实例表明了该方法的有效性.     

An improved shuffled frog leaping algorithm and its application in the optimization of cascade reservoir operation

ABSTRACT

A new improved shuffled frog leaping algorithm (SFLA), the chaos catfish effect SFLA (CCESFLA), is proposed by coupling a local “refine search” mechanism and a “global incentive adjustment” mechanism. Chaotic technology is introduced in the local “refine search” mechanism to improve local search ability, by implementing more refined local search around the optimal individuals. The catfish effect mechanism is adopted in the “global incentive adjustment” mechanism to improve global convergence, by motivating the frogs to “jump out” of the local steady state. The operation optimization by the CCESFLA is carried out taking the Li Xianjiang cascade reservoirs in China as an example. Compared with SFLA, particle swarm optimization, immune SFLA and cloud SFLA, the average annual power generation using the CCESFLA can be increased by 6.7, 7.5, 3.0 and 0.8%, respectively. The convergence process of the CCESFLA is more stable, and its execution time is the least of the three improved SFLAs.     

波动方程反演的全局优化方法研究

复杂介质波动方程反演是地球物理研究中的重要问题,通常表述为特定目标函数最优化,难点是多参数、非线性和不适定性.局部和全局优化方法都不能实现快速全局优化.本文概述了地震波勘探反演问题的理论基础和研究进展,阐述了反演中优化问题的解决方法和面临的困难,并提出了一种确定性全局优化的新方法.通过在优化参数空间识别并划分局部优化解及其附近区域,只需有限次参数空间划分过程就能发现所有局部解（集合）;基于复杂目标函数多尺度结构分析,提出多尺度参数空间分区优化方法的研究方向.该方法收敛速度快,优化结果不依赖初始解的选取,是对非线性全局优化问题的一个新探索.     

Nonlinear Rayleigh wave inversion based on the shuffled frog-leaping algorithm

At present, near-surface shear wave velocities are mainly calculated through Rayleigh wave dispersion-curve inversions in engineering surface investigations, but the required calculations pose a highly nonlinear global optimization problem. In order to alleviate the risk of falling into a local optimal solution, this paper introduces a new global optimization method, the shuffle frog-leaping algorithm (SFLA), into the Rayleigh wave dispersion-curve inversion process. SFLA is a swarm-intelligence-based algorithm that simulates a group of frogs searching for food. It uses a few parameters, achieves rapid convergence, and is capability of effective global searching. In order to test the reliability and calculation performance of SFLA, noise-free and noisy synthetic datasets were inverted. We conducted a comparative analysis with other established algorithms using the noise-free dataset, and then tested the ability of SFLA to cope with data noise. Finally, we inverted a real-world example to examine the applicability of SFLA. Results from both synthetic and field data demonstrated the effectiveness of SFLA in the interpretation of Rayleigh wave dispersion curves. We found that SFLA is superior to the established methods in terms of both reliability and computational efficiency, so it offers great potential to improve our ability to solve geophysical inversion problems.     

团体粒子群与最大能量串行融合算法转换波静校正

估计转换波的静校正量是一个复杂的非线性问题,常规的线性静校正方法无法取得好的效果.粒子群算法是一种很好的非线性全局最优化方法,但其缺点是"早熟"现象严重.最大能量法是一种常规求取静校正量的方法,局部寻优能力强且收敛速度快是其优点,但是当地震记录含有大的静校正量时易收敛于局部极值.本文在标准粒子群算法的基础上发展出了一种改进的粒子群算法:团体粒子群算法.并且通过对Rastrigin函数的寻优实验证明了其全局寻优能力优于标准粒子群算法.同时为了解决转换波静校正问题串行融合了团体粒子群算法和最大能量法.最后,建立了含一个水平反射层的模型并合成地震记录,加入随机值作为检波点静校正量.对合成的地震数据分别利用团体粒子群和最大能量的串行融合算法、标准粒子群算法和最大能量法求取静校正量并进行静校正.结果证明串行融合算法得到的静校正量与理论值误差很小,静校正后的叠加剖面连续性较好.     

基于单台加速度记录的混合全局优化HVSR反演场地浅层速度结构

利用水平与竖向谱比（HVSR）方法反演场地速度结构是国际上迅速发展的研究领域.HVSR反演计算实质是一个土层场地模型空间搜索的全局优化问题,当模型搜索空间的复杂程度增大时,目前常用的搜索算法收敛速度慢,计算效率较低.本文实现了一种结合遗传和模拟退火方法优点的混合全局优化HVSR反演算法,通过理论模型和竖向台阵实测数据的检验,表明该算法能获得很好的反演效果,较好地解决了蒙特卡罗方法收敛速度慢,遗传算法收敛早熟和模拟退火算法搜索效率低的问题.本文在此基础上讨论了单台加速度S波记录用于场地速度结构HVSR反演的适用性,为基于单个地震台的地震观测记录反演浅层速度结构提供了一种高效且较为准确的反演方法.

     

二阶精度广义非线性全局最优的偏移速度反演方法(英文)

如何快速、精确地利用叠前深度偏移进行偏移速度分析是勘探地震学的一项重要研究内容,针对该问题,本文提出一种二阶精度广义非线性全局最优的偏移速度反演方法。我们将首先去掉速度模型修正量与成象深度差呈线性关系的假设,推导出具有二阶精度的速度模型修正量计算公式,使每一次迭代得到的速度模型尽可能地接近实际模型;然后采用广义非线性反演方法反演获得对所有道集的全局最优的速度模型修正量,不仅极大地加快了收敛速度,而且反演过程中陷入局部极小的可能性也减小了。理论模型和Marmousi模型的处理结果表明:本方法精度高、处理速度快,提高了偏移速度分析方法的实用性和对复杂构造成像的准确性。     

基于局部优化粒子群算法的背景噪声反演

从背景噪声中提取瑞雷波频散曲线并通过反演获得地下横波速度结构已被广泛应用于大尺度的地下结构探测和小尺度的工程勘探中.基于频散函数的反演目标函数可以有效解决多阶模频散曲线联合反演的模式误判问题, 然而其广泛分布的局部极值导致更为严重的多解性, 在大范围的参数搜索空间下很难获得最优解, 需要搭配全局搜索性能强的优化算法.本文提出局部优化粒子群算法(PSOG), 通过粒子迭代过程中引入局部优化方法提高种群多样性, 避免陷入局部极值并加快收敛速度.为验证新算法的有效性, 结合基于久期函数的目标函数对理论合成数据进行反演, 结果表明, 局部优化粒子群算法比传统算法的稳定性与准确性都有显著提高.处理了上海苏州河地区的背景噪声数据, 成功地对古河道切割造成的软弱层进行成像.PSOG算法与新型反演目标函数的结合在背景噪声勘探的工程应用上具有巨大潜力.

     

A Stochastic Inversion Method for Potential Field Data: Ant Colony Optimization

Simulating natural ants’ foraging behavior, the ant colony optimization (ACO) algorithm performs excellently in combinational optimization problems, for example the traveling salesman problem and the quadratic assignment problem. However, the ACO is seldom used to inverted for gravitational and magnetic data. On the basis of the continuous and multi-dimensional objective function for potential field data optimization inversion, we present the node partition strategy ACO (NP-ACO) algorithm for inversion of model variables of fixed shape and recovery of physical property distributions of complicated shape models. We divide the continuous variables into discrete nodes and ants directionally tour the nodes by use of transition probabilities. We update the pheromone trails by use of Gaussian mapping between the objective function value and the quantity of pheromone. It can analyze the search results in real time and promote the rate of convergence and precision of inversion. Traditional mapping, including the ant-cycle system, weaken the differences between ant individuals and lead to premature convergence. We tested our method by use of synthetic data and real data from scenarios involving gravity and magnetic anomalies. The inverted model variables and recovered physical property distributions were in good agreement with the true values. The ACO algorithm for binary representation imaging and full imaging can recover sharper physical property distributions than traditional linear inversion methods. The ACO has good optimization capability and some excellent characteristics, for example robustness, parallel implementation, and portability, compared with other stochastic metaheuristics.     

Comparing state-of-the-art evolutionary multi-objective algorithms for long-term groundwater monitoring design

This study compares the performances of four state-of-the-art evolutionary multi-objective optimization (EMO) algorithms: the Non-Dominated Sorted Genetic Algorithm II (NSGAII), the Epsilon-Dominance Non-Dominated Sorted Genetic Algorithm II (ε-NSGAII), the Epsilon-Dominance Multi-Objective Evolutionary Algorithm (εMOEA), and the Strength Pareto Evolutionary Algorithm 2 (SPEA2), on a four-objective long-term groundwater monitoring (LTM) design test case. The LTM test case objectives include: (i) minimize sampling cost, (ii) minimize contaminant concentration estimation error, (iii) minimize contaminant concentration estimation uncertainty, and (iv) minimize contaminant mass estimation error. The 25-well LTM design problem was enumerated to provide the true Pareto-optimal solution set to facilitate rigorous testing of the EMO algorithms. The performances of the four algorithms are assessed and compared using three runtime performance metrics (convergence, diversity, and ε-performance), two unary metrics (the hypervolume indicator and unary ε-indicator) and the first-order empirical attainment function. Results of the analyses indicate that the ε-NSGAII greatly exceeds the performance of the NSGAII and the εMOEA. The ε-NSGAII also achieves superior performance relative to the SPEA2 in terms of search effectiveness and efficiency. In addition, the ε-NSGAII’s simplified parameterization and its ability to adaptively size its population and automatically terminate results in an algorithm which is efficient, reliable, and easy-to-use for water resources applications.     

Applying a real‐coded multi‐population genetic algorithm to multi‐reservoir operation

The primary objective of this study is to propose a real‐coded hypercubic distributed genetic algorithm (HDGA) for optimizing reservoir operation system. A conventional genetic algorithm (GA) is often trapped into local optimums during the optimization procedure. To prevent premature convergence and to obtain near‐global optimal solutions, the HDGA is designed to have various subpopulations that are processed using separate and parallel GAs. The hypercubic topology with a small diameter spreads good solutions rapidly throughout all of the subpopulations, and a migration mechanism, which exchanges chromosomes among the subpopulations, exchanges information during the joint optimization to maintain diversity and thus avoid a systematic premature convergence toward a single local optimum. Three genetic operators, i.e. linear ranking selection, blend‐α crossover and Gaussian mutation, are applied to search for the optimal reservoir releases. First, a benchmark problem, the four‐reservoir operation system, is considered to investigate the applicability and effectiveness of the proposed approach. The results show that the known global optimal solution can be effectively and stably achieved by the HDGA. The HDGA is then applied in the planning of a multi‐reservoir system in northern Taiwan, considering a water reservoir development scenario to the year 2021. The results searched by an HDGA minimize the water deficit of this reservoir system and provide much better performance than the conventional GA in terms of obtaining lower values of the objective function and avoiding local optimal solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

实数编码遗传算法在大地电磁测深二维反演中的应用

作为全局非线性优化的新方法之一的遗传算法,近年来已从生物工程流行到大地电磁测深资料解释中.然而,大地电磁反演问题具有不适定性,解的非唯一性.通过结合求解不适定问题的Tikhonov正则化方法,本文采用实数编码遗传算法求解大地电磁二维反演问题.此算法在构建目标函数时引入正则化的思想,利用遗传算法求解最优化问题.常规的基于局部线性化的最优化反演方法易使解陷入局部极小值,而且严重的依赖初始模型的选择.与传统线性化的迭代反演方法相比,实数编码遗传算法能够克服传统方法的不足且能获得更好的反演结果.通过对大地电磁测深理论模型进行计算,结果表明:该算法具有收敛速度快、解的精度高和避免出现早熟等优点,可用于大地电磁资料解释.