共查询到19条相似文献，搜索用时 250 毫秒
1.
通过在格雷码遗传算法进化过程中加入单纯形搜索算子,并利用格雷码遗传算法和单纯形法所得到的优秀个体群,作为变量新的变化范围,逐步缩小搜索空间,自动向最优解收缩,提出了水环境模型参数识别的一种新方法——格雷码混合加速遗传算法(GCHAGA),给出了实施该算法的详细步骤。对GCHAGA的收敛性和全局优化性进行了理论和实例分析,并在确定河流横向扩散系数等参数识别问题中,GCHAGA得到了精度较高的全局最优解。与格雷码遗传算法(GCGA)和常规优化方法相比,GCHAGA具有精度高、速度快和适用性强等特点,是一种既可以较大概率搜索全局最优解,又能进行局部细致搜索的较好的非线性优化方法,可广泛应用于各种水环境优化问题中。 相似文献
2.
波阻抗反演中的全局寻优策略 总被引：1，自引：1，他引：1
针对常规基于模型的波阻抗反演方法严重依赖于初始模型的选择和易陷入局部最优等局限性，提出了一种新的全局寻优策略。该反演策略是在常规测井约束反演的框架中加入一定次数的遗传全局搜索机制。如果迭代过程一旦陷入局部最优解；就可以把已经形成的局部最优解作为寻优的新起点，在此基础上进行全局遗传寻优，搜索更优的反演结果。通过模型数值计算和实际资料处理，表明该反演策略具有跳出初始模型控制的优良性能和良好的实际反演效果。 相似文献
3.
在禁忌搜索和极限平衡分析的基础上,提出了全局确定边坡最小安全系数的禁忌搜索方法,并建立了响应的模型;该方法是一种启发式的全局搜索方法,可以搜索出全局最小安全系数,同时还能确定出与之对应的最危险滑动面。将该方法应用于不同几何形状和土层信息的边坡稳定分析中,结果表明,提出的方法能够避免局部最小解,并能搜索到全局最小安全系数。 相似文献
4.
边坡非圆弧临界滑动面搜索是边坡稳定计算中的一个关键问题,其实质为安全系数最小的滑动路径搜索问题,采用效果良好的路径搜索算法--蚁群算法是目前研究的热点。为了克服传统蚁群算法效率低、效果差的缺点,基于蚂蚁正反向搜索相遇形成完整路径的原理,提出了一种相遇蚁群算法。将该算法用于边坡非圆弧滑动面搜索问题,提出了一种非圆弧临界滑动面搜索的新方法。通过2个边坡的算例计算及一个水库岸坡的工程应用,验证了新算法的有效性。计算结果表明,相遇蚁群算法无论是整个搜索范围还是从某一点起的搜索范围都要比一般蚁群算法大,所以相遇蚁群算法在搜索边坡临界滑动面时所得到解的多样性也要比一般蚁群算法好,因此,相遇蚁群算法的搜索范围能以较大的概率包含全局最优解,算法最终也能以较大概率搜索到全局最优解。最终,相遇蚁群算法可以在更大的范围内以更快的速度找到边坡的临界滑动面。 相似文献
5.
确定边坡最危险滑动面并计算与之相对应的安全系数是边坡支护的重要任务。本文结合简化Bishop法,用一种新的智能优化算法混沌优化算法来搜索全局最优解。该方法利用混沌运动本身具有遍历性、随机性、规律性等内在特点,能在一定范围内按其自身规律不重复地遍历所有状态,易于跳出局部最优解,具有很强的全局搜索能力。通过坡高为12.3m的某电厂三层土质边坡的典型算例分析,并和遗传算法、枚举法计算结果对比可知,计算结果超于一致,其差值接近于0,因此混沌优化算法能在很高精度下搜索到全局最优解,能很好地解决边坡稳定性分析中的优化问题。 相似文献
6.
对于高度非线性、非凸的地下水管理模型,传统优化方法难以找到全局最优解。本文采用模拟退火遗传算法求解地下水管理模型,并从三个方面对算法进行改进:引入小生境技术,采用自适应交叉和变异概率,在选择过程中采用最优保存策略,从而提高算法的全局寻优能力和收敛速度。采用惩罚函数法处理约束条件。用Fortran 90语言编制了计算程序,并通过Schaffer测试函数验证了该算法不仅具有强大的全局寻优能力和局部搜索能力,而且具有较快的收敛速度和较高的优化精度。将该算法应用到某研究区地下水管理中,取得了较好的效果。 相似文献
7.
8.
水文地质参数的正确与否是构建地下水数值模型的根本,而参数寻优结果很大程度上取决于优化算法的选择。禁忌搜索算法是一种广泛应用于组合优化问题的启发式全局寻优算法,但在连续函数优化领域应用比较少。基于上述考虑,本文首先引入求解连续函数优化问题的连续禁忌搜索算法并对其进行改进,进而提出一种连续禁忌搜索改进算法(ICTS),最后将其与地下水模型耦合进行水文地质参数识别。算例研究表明,ICTS算法较其他算法(CTS,SGA,Micro-GA,PSO)求解效率提高1.87～4.64倍,求解精度提高1.08～12.86倍。因此ICTS算法在参数反演计算中求解精度高、收敛速度快、寻优性能强,是一种值得推广的水文地质参数识别方法。 相似文献
9.
应用现有典型算法求解灌溉制度优化设计模型时,由于各种算法本身存在着不足,可被接受的模型最优解往往不能够被成功搜索到。自由搜索(Free Search,FS)是一种新的优化算法,对其进行了适当改进,针对灌溉制度优化设计模型实例,在不同的可供水量下,应用FS算法对该模型进行求解。结果表明,FS算法表现出良好的稳健性和收敛性;与以往的动态规划逐次逼近法(DPSA)、遗传算法(GA)及混沌算法(CA)对该实例的寻优结果相比,FS算法提高了寻优精度。FS算法原理简单,操作简便,是一种较好的优化灌溉制度的新方法。 相似文献
10.
在传统遗传算法和模拟谐振子算法的基础上,结合两者的优点,提出了一种新型快速高效的谐振子遗传算法。通过一个理想的水资源管理模型的算例和一个华北平原典型区地下水资源优化的实际算例,从寻优结果和寻优效率两个方面对谐振子遗传算法、传统遗传算法和模拟谐振子算法进行了对比分析。在两个地下水管理模型中,与传统的遗传算法和模拟谐振子算法相比,新型的谐振子遗传算法搜索效率达到模拟谐振子算法搜索效率的2倍以上,得到的最优解比遗传算法所得到的最优解分别增加供水量1.1×103 m3/d和0.47×108 m3/a,说明谐振子遗传算法具有更强的全局搜索能力和更好的寻优效率。 相似文献
11.
Multiple-point statistics (MPS) provides a flexible grid-based approach for simulating complex geologic patterns that contain high-order statistical information represented by a conceptual prior geologic model known as a training image (TI). While MPS is quite powerful for describing complex geologic facies connectivity, conditioning the simulation results on flow measurements that have a nonlinear and complex relation with the facies distribution is quite challenging. Here, an adaptive flow-conditioning method is proposed that uses a flow-data feedback mechanism to simulate facies models from a prior TI. The adaptive conditioning is implemented as a stochastic optimization algorithm that involves an initial exploration stage to find the promising regions of the search space, followed by a more focused search of the identified regions in the second stage. To guide the search strategy, a facies probability map that summarizes the common features of the accepted models in previous iterations is constructed to provide conditioning information about facies occurrence in each grid block. The constructed facies probability map is then incorporated as soft data into the single normal equation simulation (snesim) algorithm to generate a new candidate solution for the next iteration. As the optimization iterations progress, the initial facies probability map is gradually updated using the most recently accepted iterate. This conditioning process can be interpreted as a stochastic optimization algorithm with memory where the new models are proposed based on the history of the successful past iterations. The application of this adaptive conditioning approach is extended to the case where multiple training images are proposed as alternative geologic scenarios. The advantages and limitations of the proposed adaptive conditioning scheme are discussed and numerical experiments from fluvial channel formations are used to compare its performance with non-adaptive conditioning techniques. 相似文献
12.
M. J. Alizadeh A. Shabani M. R. Kavianpour 《International Journal of Environmental Science and Technology》2017,14(11):2399-2410
A reliable prediction of dispersion coefficient can provide valuable information for environmental scientists and river engineers as well. The main objective of this study is to apply intelligence techniques for predicting longitudinal dispersion coefficient in rivers. In this regard, artificial neural network (ANN) models were developed. Four different metaheuristic algorithms including genetic algorithm (GA), imperialist competitive algorithm (ICA), bee algorithm (BA) and cuckoo search (CS) algorithm were employed to train the ANN models. The results obtained through the optimization algorithms were compared with the Levenberg–Marquardt (LM) algorithm (conventional algorithm for training ANN). Overall, a relatively high correlation between measured and predicted values of dispersion coefficient was observed when the ANN models trained with the optimization algorithms. This study demonstrates that the metaheuristic algorithms can be successfully applied to make an improvement on the performance of the conventional ANN models. Also, the CS, ICA and BA algorithms remarkably outperform the GA and LM algorithms to train the ANN model. The results show superiority of the performance of the proposed model over the previous equations in terms of DR, R 2 and RMSE. 相似文献
13.
14.
In this paper, an enhanced backtracking search algorithm (so-called MBSA-LS) for parameter identification is proposed with two modifications: (a) modifying the mutation of original backtracking search algorithm (BSA) considering the contribution of current best individual for accelerating convergence speed and (b) novelly incorporating an efficient differential evolution (DE) as local search for improving the quality of population. The proposed MBSA-LS is first validated with better performance than the original BSA and some other typical state-of-the-art optimization algorithms on a benchmark of soil parameter identification in terms of effectiveness, efficiency, and robustness. Then, the efficiency of the MBSA-LS is further illustrated by two representative cases: identifying soil parameters from both laboratory tests and field measurements. All comparisons demonstrate that the proposed MBSA-LS algorithm can give accurate results in a short time. Finally, to conveniently solve the problems of parameter identification, a practical tool ErosOpt for parameter identification is developed by integrating the proposed MBSA-LS and some other efficient algorithms for readers to conduct the parameter identification using optimisation algorithms. 相似文献
15.
Simultaneous Estimation of Geologic and Reservoir State Variables Within an Ensemble-Based Multiple-Point Statistic Framework 总被引：1，自引：1，他引：0
Liangping Li Sanjay Srinivasan Haiyan Zhou J. Jaime Gómez-Hernández 《Mathematical Geosciences》2014,46(5):597-623
Assessment of uncertainty due to inadequate data and imperfect geological knowledge is an essential aspect of the subsurface model building process. In this work, a novel methodology for characterizing complex geological structures is presented that integrates dynamic data. The procedure results in the assessment of uncertainty associated with the predictions of flow and transport. The methodology is an extension of a previously developed pattern search-based inverse method that models the spatial variation in flow parameters by searching for patterns in an ensemble of reservoir models. More specifically, the pattern-searching algorithm is extended in two directions: (1) state values (such as piezometric head) and parameters (such as conductivities) are simultaneously and sequentially estimated, which implies that real-time assimilation of dynamic data is possible as in ensemble filtering approaches; and (2) both the estimated parameter and state variables are considered when pattern searching is implemented. The new scheme results in two main advantages—better characterization of parameters, especially for delineating small scale features, and an ensemble of head states that can be used to update the parameter field using the dynamic data at the next instant, without running expensive flow simulations. An efficient algorithm for pattern search is developed, which works with a flexible search radius and can be optimized for the estimation of either large- or small-scale structures. Synthetic examples are employed to demonstrate the effectiveness and robustness of the proposed approach. 相似文献
16.
Libing Wang 《Mathematical Geology》1996,28(7):895-907
Large-scale reservoir architecture constitutes first-order reservoir heterogeneity and dietates to a large extent reservoir flow behavior. It also manifests geometric characteristics beyond the capability of traditional geostatistical models conditioned only on single-point and two-point statistics. Multiple-point statistics, as obtained by scanning a training image deemed representative of the actual reservoir, if reproduced properly provides stochastic models that better capture the essence of the heterogeneity. A growth algorithm, coupled with an optimization procedure, is proposed to reproduce target multiple-point histograms. The growth algorithm makes an analogy between geological accretion process and stochastic process and amounts to restricting the random path of sequential simulation at any given stage to a set of eligible nodes (immediately adjacent to a previously simulated node or sand grain). The proposed algorithm, combined with a multiple-grid approach, is shown to reproduce effectively the geometric essence of complex training images exhibiting long-range and curvilinear structures. Also, by avoiding a rigorous search for global minimum and accepting local minima, the proposed algorithm improves CPU time over traditional optimization procedures by several orders of magnitude. Average flow responses run on simulated realizations are shown to bracket correctly the reference responses of the training image. 相似文献
17.
Memory-Efficient Categorical Multi-point Statistics Algorithms Based on Compact Search Trees 总被引：1，自引：1，他引：0
Tuanfeng Zhang Stein Inge Pedersen Christen Knudby David McCormick 《Mathematical Geosciences》2012,44(7):863-879
Multi-point statistics (MPS) has emerged as an advanced geomodeling approach. A practical MPS algorithm named snesim (simple normal equations simulation), which uses categorical-variable training images, was proposed in 2001. The snesim algorithm generates a search tree to store the occurrence statistics of all patterns in the training image within a given set of search templates before the simulation proceeds. The snesim search tree concept makes MPS simulation central processing unit efficient but consumes large amounts of memory, particularly when three-dimensional training images contain complex patterns and when a large search template is required to ensure optimal reproduction of the image patterns. To crack the memory-restriction bottleneck, we have developed a compact search tree that contains the same information but reduces memory cost by one order of magnitude. Furthermore, the compact structure also accelerates MPS simulation significantly. Such remarkable improvement makes MPS a more practical tool to use in building the large and complex three-dimensional facies models required in the oil and gas industry. 相似文献
18.
Hassan Mohamed AbdelazimNegm Mahmoud Salah Kazuo Nadaoka Mohamed Zahran 《Arabian Journal of Geosciences》2017,10(2):42
Bathymetric information for shallow coastal/lake areas is essential for hydrological engineering applications such as sedimentary processes and coastal studies. Remotely sensed imagery is considered a time-effective, low-cost, and wide-coverage solution for bathymetric measurements. This study assesses the performance of three proposed empirical models for bathymetry calculations in three different areas: Alexandria port, Egypt, as an example of a low-turbidity deep water area with silt-sand bottom cover and a depth range of 10.5 m; the Lake Nubia entrance zone, Sudan, which is a highly turbid, unstable, clay bottom area with water depths to 6 m; and Shiraho, Ishigaki Island, Japan, a coral reef area with varied depths ranging up to 14 m. The proposed models are the ensemble regression tree-fitting algorithm using bagging (BAG), ensemble regression tree-fitting algorithm of least squares boosting (LSB), and support vector regression algorithm (SVR). Data from Landsat 8 and Spot 6 satellite images were used to assess the performance of the proposed models. The three models were used to obtain bathymetric maps using the reflectance of green, red, blue/red, and green/red band ratios. The results were compared with corresponding results yielded by two conventional empirical methods, the neural network (NN) and the Lyzenga generalised linear model (GLM). Compared with echosounder data, BAG, LSB, and SVR results demonstrate higher accuracy ranges from 0.04 to 0.35 m more than Lyzenga GLM. The BAG algorithm, producing the most accurate results, proved to be the preferable algorithm for bathymetry calculation. 相似文献
19.
针对目前深埋隧道围岩微震源定位难且精度不高等问题,采用启发式算法——引力搜索法（GSA）对隧道围岩微震源位置进行搜索,并将该算法与粒子群算法和单纯形法的搜索结果进行对比。发现在双速度模型和三速度模型下,引力搜索法相较于粒子群算法和单纯形法,都具有快速收敛、精度较高的优点,且与震源位置的距离能够控制在10 m以内。对双速度模型,引力搜索法的精度相对于单纯形法提高了83.71%,相对于粒子群算法提高了7.77%。对三速度模型,引力搜索法的精度相对于单纯形法提高了70.67%,相对于粒子群算法提高了39.36%。可见,该方法为深埋隧道微围岩震源定位提供了一种新思路。 相似文献