道路交通拥堵自动检测的改进加州算法及仿真

本文研究了高速公路交通拥堵自动检测算法.利用改进的加州算法,获得了用VISSIM软件对高速公路车流量情况的仿真数据及结果,仿真结果表明改进加州算法的检测结果良好.     

A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems

Spatial planning is an important and complex activity. It includes land use planning and resource allocation as basic components. An abundance of papers can be found in the literature related to each one of these two aspects separately. On the contrary, a much smaller number of research reports deal with both aspects simultaneously. This paper presents an innovative evolutionary algorithm for treating combined land use planning and resource allocation problems. The new algorithm performs optimization on a cellular automaton domain, applying suitable transition rules on the individual neighbourhoods. The optimization process is multi-objective, based on non-domination criteria and self-organizing. It produces a Pareto front thus offering an advantage to the decision maker, in comparison to methods based on weighted-sum objective functions. Moreover, the present multi-objective self-organizing algorithm (MOSOA) can handle both local and global spatial constraints. A combined land use and water allocation problem is treated, in order to illustrate the cellular automaton optimization approach. Water is allocated after pumping from an aquifer, thus contributing a nonlinearity to the objective function. The problem is bi-objective aiming at (a) the minimization of soil and groundwater pollution and (b) the maximization of economic profit. An ecological and a socioeconomic constraint are imposed: (a) Groundwater levels at selected places are kept above prescribed thresholds. (b) Land use quota is predefined. MOSOA is compared to a standard multi-objective genetic algorithm and is shown to yield better results both with respect to the Pareto front and to the degree of compactness. The latter is a highly desirable feature of a land use pattern. In the land use literature, compactness is part of the objective function or of the constraints. In contrast, the present approach renders compactness as an emergent result.     

The equilibrium generalized assignment problem and genetic algorithm

The well-known generalized assignment problem (GAP) is to minimize the costs of assigning n jobs to m capacity constrained agents (or machines) such that each job is assigned to exactly one agent. This problem is known to be NP-hard and it is hard from a computational point of view as well. In this paper, follows from practical point of view in real systems, the GAP is extended to the equilibrium generalized assignment problem (EGAP) and the equilibrium constrained generalized assignment problem (ECGAP). A heuristic equilibrium strategy based genetic algorithm (GA) is designed for solving the proposed EGAP. Finally, to verify the computational efficiency of the designed GA, some numerical experiments are performed on some known benchmarks. The test results show that the designed GA is very valid for solving EGAP.     

Spectral analytic comparisons for data augmentation

The sandwich algorithm (SA) is an alternative to the data augmentation (DA) algorithm that uses an extra simulation step at each iteration. In this paper, we show that the sandwich algorithm always converges at least as fast as the DA algorithm, in the Markov operator norm sense. We also establish conditions under which the spectrum of SA dominates that of DA. An example illustrates the results.     

Parameter identification and optimization algorithm in microbial continuous culture

In this study, a novelty mathematical model is established to formulate the continuous culture of glycerol to 1,3-Propanediol (1,3-PD) by Klebsiella pneumoniae, in which the inhibition of 3-hydroxypropionaldehyde (3-HPA) to cells growth and activity of some enzymes (such as glycerol dehydratase (GDHt) and 1,3-PD oxidoreductase (PDOR)), and the passive diffusion and active transport of glycerol and 1,3-PD across cell membrane are all taken into consideration. Taking the mean relative error between the experimental data and calculated values as the performance index, a parameter identification model involving multiple nonlinear dynamic systems is presented. The identifiability of the parameter identification model is also proved. Finally, an improved particle swarm optimization (PSO) algorithm is constructed to find the optimal parameters for the systems under substrate limitation and excess conditions, respectively. Numerical results not only show that the established model can be used to describe the continuous fermentation reasonably, but also the improved PSO algorithm is valid.     

局部Z-空间和Z-连续空间

对于一般广义子集系统Z,引入了局部Z-空间和Z-连续空间的概念,讨论了局部Z-空间的基本性质;基于收敛网,给出了局部Z-空间的等价刻画,证明了X为Z-连续空间当且仅当X为局部Z-空间。     

带有潜伏期的狂犬病模型及控制策略研究

研究建立了狗与人两个群体的SEIR狂犬病模型,把狂犬病潜伏期阶段的传染性加入到模型中,利用遗传算法对1996年到2015年的数据进行拟合,估出了中国狂犬病的基本再生数R0≈1.66,证明了狂犬病无病平衡点的全局稳定性以及模型的一致持续性.根据数值模拟结果,发现处于潜伏期的犬类对人类狂犬病造成威胁.因此控制狂犬病的一个关键措施就是要做好犬的管理,减少与犬只的接触,这对抑制狂犬病的爆发有着重要的作用,也为我国狂犬病的控制提供了可靠的理论依据.     

基于正弦控制因子的Lateral变异鲨鱼优化算法

针对传统鲨鱼优化算法在求解高维目标函数时,易早熟收敛,陷入局部最优的缺陷.提出一种基于正弦控制因子的Lateral变异鲨鱼优化算法.通过正弦曲线的特性和自适应惯性权重,改善了传统鲨鱼优化算法中由于随机选取控制因子数值大小可能导致算法在迭代后期全局搜索能力降低的问题,提高了算法在迭代后期的全局收敛能力,并对最佳鲨鱼位置引入Lateral变异策略,加强了算法跳出局部最优的可能性.改进后的算法对多个shifted单峰,多峰以及固定维测试函数进行求解,实验结果表明,对比多种不同优化算法而言,本文所提LSSO算法具有更高的收敛精度和搜索速度.     

新组合模型在光电功率预测中的应用

为提高光伏预测要求的精准性,文章提出一种新算法将神经网络和ARMA算法改进组合,构成NEW ARMA-BP模型算法.以某30兆瓦的光伏电站采集的输出功率为输入样本,基于ARMA和BP神经网络算法在Matlab环境下依次搭建了相应的预测模型,预估光伏短期输出量.采用"误差正态检验图"判断基于两种不同算法的误差水平,依据两种单模型预测误差,运用所提出的新方法计算权值并获得新的预测值.基于Matlab的仿真结论验证了组合预测在光伏输出预测领域的适用性.     

广义鞍点问题的改进的类SOR算法

针对广义鞍点问题,本文提出了一个改进的类逐次超松弛迭代算法,在较弱的条件下,分析了算法的收敛性及线性收敛率.新算法的每步计算量与已有的算法类似,都是需要（近似）求解线性方程组,但新算法有更好的灵活度通过合适地选取参数矩阵,每一步子问题可以容易地求解,甚至可以有闭式解（closed-form solution）.数值实验结果显示了新算法的有效性.