带混合时间窗的多目标危险化学品运输路径优化

为降低危险化学品运输风险,使路径选择更加科学、切合实际,从责任主体、社会影响等方面综合考虑危险化学品运输相关主体,根据各主体目标对影响运输路径选择的指标进行重新识别和细分,提出5大指标体系。应用熵权法计算出各指标权重,建立混合时间窗条件下的多目标危化品运输路径优化模型,通过改进的多目标遗传算法求出Pareto最优解。结果表明,不同时间点出发会产生不同的Pareto最优解,并且可得到每条最优路径的出发时间窗,每个最优解代表了某项指标达到相对最优时的路径。混合时间窗较符合实际情况,基于出发时间窗及生成的多条最优路径,决策者可根据决策偏好及关注重点以较高效率选出最合适的路径。     

融合控制策略在污水处理曝气过程中的应用

针对污水处理过程的复杂性,提出了一种融合控制策略。探讨了基于融合的工程控制策略和控制算法。仿真实验结果表明:该工程控制算法的控制精度高,鲁棒性强,对污水处理过程的控制是可行和有效的。     

Definition and calculation of uncertainty in ecological process models

We present a method of multi-criteria assessment for the analysis of process model uncertainty that combines analysis of model structure, parameters and data requirements. There are three components in calculation and definition of uncertainty.

(1)

Assessment criteria: Uncertainty in a process model is reduced as the model can simultaneously simulate an increased number of assessment criteria selected to test specific aspects of the theory being investigated, and within acceptable limits set for those criteria. This reduces incomplete specification of the model—the characteristic that a model may explain some, but not all, of the observed features of a phenomenon. The calculation required is computation of the Pareto set which provides the list of simultaneously achieved criteria within specified ranges.     

基于遗传神经网络的化工企业安全评价

基于化工企业特点,建立了比较合理的安全评价指标结构,并构建了以遗传神经网络为基础的评价模型。通过建立训练样本,确定BP神经网络的网络结构,运用遗传算法（GA ）去优化BP网络的初始权值和阈值,再把优化之后的权值和阈值赋给BP神经网络,然后对其进行训练,训练完毕后将所建立的模型通过实例评价进行了验证,结果表明此模型在化工企业安全评价中具有较好的应用价值。     

基于GA与最长路径并联通路法优化通风网络图绘制

针对矿井通风网络图分支交叉的问题,基于最长路径对网络图节点分层,以遗传算法优化节点排序,主要采用堆积木的组合思想来进行层间交叉与层内交叉操作,提高层次图的质量（减少分支交叉数）,并以重心定位启发式算法来增强遗传算法的局部搜索能力,提高遗传算法的搜索质量。最后,以改进的最长路径并联通路法绘制出较优的通风网络图。     

上海市突发环境污染事故风险区划

环境风险区划是区域布局型环境风险管理及环境风险分区管理的重要手段.本研究在环境风险系统理论的指导下,借鉴“自上而下”和“自下而上”传统区划方对上海市突发环境风险进行区划研究.上海市突发环境风险区划中“自上而下”环境风险一级区的划分是依据上海市1990~2008年突发污染事故历史时空格局获得;而“自下而上”是通过构建上海市风险区划指标体系,在对指标进行概念模型量化的基础上,运用基于遗传算法的K均值聚类在最小区划单元进行聚类区划,并依据上海市政府宏观规划对聚类后的图斑碎块进行科学性和实用性调整,获得上海市突发环境污染事故风险亚区和小区;将上海市突发环境风险一级区及亚区和小区集成分析,实现上海市突发环境污染事故风险综合区划.结果表明:上海市突发环境污染事故风险区划包含2个风险一级区,5个风险亚区和21个风险小区,客观揭示了上海市突发环境污染事故风险的空间分布规律.针对上海市布局型环境风险和不同风险区提出相应的管理措施,为上海市综合减灾降险和风险管理决策提供科学依据.     

基于PSO优化BP神经网络的钻井动态风险评估方法

传统钻井动态风险评估严重依赖于专家主观判断、结果大多是定性或半定量,无法满足深井复杂地层钻井安全需求。针对该问题,研究建立了基于PSO优化BP神经网络的钻井动态风险评估方法。通过对录井资料的监测分析,实时判断井下风险发生的类型并定量计算风险发生概率,可以在风险发生的早期给出预警信息,及时指导风险调控措施的开展。海上BD气田的实例分析表明,基于构建的动态风险评估模型得到的风险预测结果与实际风险发生情况相符合,说明建立的模型是合理可行的。该模型对于钻井作业过程中动态风险评估具有一定的参考价值。     

基于MFOA-SVR露天矿边坡变形量预测研究

为实现边坡危险性及时预警预报,以露天矿边坡变形量为研究对象,提出采用七项影响指标作为边坡位移变形量的响应参数,建立支持向量机回归预测模型(SVR)。引入修正的果蝇优化算法(MFOA)对模型参数进行优化,构建基于MFOA-SVR露天矿边坡变形量协同预测模型,并以实际监测数据进行模型仿真预测。结果表明:该模型平均绝对误差为0.9167mm,平均相对误差为4.2737%,较其他模型预测精度高,综合性能好,将其运用于露天矿边坡变形量预测研究具有较好的适用性和可靠性。     

基于自适应调整蚁群-RBF神经网络模型的中长期径流预测

径流预测历来是水利部门的一项重要工作,针对水库和河流中长期径流预测精度不高,提出了自适应调节人工蚁群算法(ARACS),对RBF神经网络参数进行优化,建立了自适应调节人工蚁群-RBF神经网络组合算法(ARACS-RBF)预测模型,综合考虑影响径流预变化因素,对安康水库进行中长期径流预测。对预测效果进行检验,结果证实该模型可真实地反映河川径流变化的总体趋势, 并为判断时间序列数据的非线性提供了一种新方法。与RBF神经网络模型、人工蚁群-RBF神经网络模型预测结果进行对比,结果表明,应用ARACS-RBF模型对中长期径流量进行预测,预测精度更高、效果更好。该方法克服了RBF神经网络和人工蚁群算法易陷于局部极值、搜索质量差和精度不高的缺点,改善了RBF神经网络的泛化能力,收敛速度快,输出稳定性好,提高了径流预测的精度,置信度为98%时的预测相对误差小于6.5%。可有效用于水库和河川中长期径流预测。     

Conservation decision-making in large state spaces

When looking for the best course of management decisions to efficiently conserve metapopulation systems, a classic approach in the ecology literature is to model the optimisation problem as a Markov decision process and find an optimal control policy using exact stochastic dynamic programming techniques. Stochastic dynamic programming is an iterative procedure that seeks to optimise a value function at each timestep by evaluating the benefits of each of the actions in each state of the system defined in the Markov decision process.Although stochastic dynamic programming methods provide an optimal solution to conservation management questions in a stochastic world, their applicability in metapopulation problems has always been limited by the so-called curse of dimensionality. The curse of dimensionality is the problem that adding new state variables inevitably results in much larger (often exponential) increases in the size of the state space, which can make solving superficially small problems impossible. The high computational requirements of stochastic dynamic programming methods mean that only simple metapopulation management problems can be analysed. In this paper we overcome the complexity burden of exact stochastic dynamic programming methods and present the benefits of an on-line sparse sampling algorithm proposed by Kearns, Mansour and Ng (2002). The algorithm is particularly attractive for problems with large state spaces as the running time is independent of the size of the state space of the problem. This appealing improvement is achieved at a cost: the solutions found are no longer guaranteed to be optimal.We apply the algorithm of Kearns et al. (2002) to a hypothetical fish metapopulation problem where the management objective is to maximise the number of occupied patches over the management time horizon. Our model has multiple management options to combat the threats of water abstraction and waterhole sedimentation. We compare the performance of the optimal solution to the results of the on-line sparse sampling algorithm for a simple 3-waterhole case. We find that three look-ahead steps minimises the error between the optimal solution and the approximation algorithm. This paper introduces a new algorithm to conservation management that provides a way to avoid the effects of the curse of dimensionality. The work has the potential to allow us to approximate solutions to much more complex metapopulation management problems in the future.