耦合优化蚁群算法与P-Median model的选址模型设计

为节省城建部门对于公共体育设施的投入成本以及提高城市人民生活质量,以运动场所优化选址为例,提出一种新型设施选址模型。该模型主要基于P-Median model(最小化阻抗模型)根据需求点数量从全部候选设施选址中选择设施空间位置,让用户达到离自己最近设施距离成本总和最小的目的,对选址的基本原则和实际情况提出要求,构造目标函数用于优化后蚁群算法求解进行选址工作。优化蚁群算法实现基于Python语言模块,通过改进蚁群原始信息素,提升原有算法的收敛速度,求出目标函数最优解,可以很好地模拟对于运动场所的选址。用二者耦合进行优势互补所设计的选址模型来搜寻研究区蚁群信息素浓度残留最大的栅格像元,从而确定未被已有设施点服务半径覆盖的最佳设施点建立位置。实验结果表明,该新型选址模型相较于最小化阻抗模型与最大化覆盖模型,新增优化设施点使整体服务半径覆盖率分别高出10.42%和6.95%,适合求解较为精确且小规模空间下的选址问题。

Local Bifurcation Analysis of a Delayed Fractional-order Dynamic Model of Dual Congestion Control Algorithms

In this paper, we propose a delayed fractional-order congestion control model which is more accurate than the original integer-order model when depicting the dual congestion control algorithms. The presence of fractional orders requires the use of suitable criteria which usually make the analytical work so harder. Based on the stability theorems on delayed fractionalorder differential equations, we study the issue of the stability and bifurcations for such a model by choosing the communication delay as the bifurcation parameter. By analyzing the associated characteristic equation, some explicit conditions for the local stability of the equilibrium are given for the delayed fractionalorder model of congestion control algorithms. Moreover, the Hopf bifurcation conditions for general delayed fractional-order systems are proposed. The existence of Hopf bifurcations at the equilibrium is established. The critical values of the delay are identified, where the Hopf bifurcations occur and a family of oscillations bifurcate from the equilibrium. Same as the delay,the fractional order normally plays an important role in the dynamics of delayed fractional-order systems. It is found that the critical value of Hopf bifurcations is crucially dependent on the fractional order. Finally, numerical simulations are carried out to illustrate the main results.

Research on a Fog Computing Architecture and BP Algorithm Application for Medical Big Data

Although the Internet of Things has been widely applied,the problems of cloud computing in the application of digital smart medical Big Data collection,processing,analysis,and storage remain,especially the low efficiency of medical diagnosis.And with the wide application of the Internet of Things and Big Data in the medical field,medical Big Data is increasing in geometric magnitude resulting in cloud service overload,insufficient storage,communication delay,and network congestion.In order to solve these medical and network problems,a medical big-data-oriented fog computing architec-ture and BP algorithm application are proposed,and its structural advantages and characteristics are studied.This architecture enables the medical Big Data generated by medical edge devices and the existing data in the cloud service center to calculate,compare and analyze the fog node through the Internet of Things.The diagnosis results are designed to reduce the business processing delay and improve the diagnosis effect.Considering the weak computing of each edge device,the artificial intelligence BP neural network algorithm is used in the core computing model of the medical diagnosis system to improve the system computing power,enhance the medical intelligence-aided decision-making,and improve the clinical diagnosis and treatment efficiency.In the application process,combined with the characteristics of medical Big Data technology,through fog architecture design and Big Data technology integration,we could research the processing and analysis of heterogeneous data of the medical diagnosis system in the context of the Internet of Things.The results are promising:The medical platform network is smooth,the data storage space is sufficient,the data processing and analysis speed is fast,the diagnosis effect is remarkable,and it is a good assistant to doctors’treatment effect.It not only effectively solves the problem of low clinical diagnosis,treatment efficiency and quality,but also reduces the waiting time of patients,effectively solves the contradiction between doctors and patients,and improves the medical service quality and management level.

Model algorithm control using neural networks for input delayed nonlinear control system

The performance of the model algorithm control method is partially based on the accuracy of the system＇s model. It is difficult to obtain a good model of a nonlinear system, especially when the nonlinearity is high. Neural networks have the ability to ＂learn＂the characteristics of a system through nonlinear mapping to represent nonlinear functions as well as their inverse functions. This paper presents a model algorithm control method using neural networks for nonlinear time delay systems. Two neural networks are used in the control scheme. One neural network is trained as the model of the nonlinear time delay system, and the other one produces the control inputs. The neural networks are combined with the model algorithm control method to control the nonlinear time delay systems. Three examples are used to illustrate the proposed control method. The simulation results show that the proposed control method has a good control performance for nonlinear time delay systems.

Finite Element Model Updating of Bridge Structures Based on Sensitivity Analysis and Optimization Algorithm

The dynamic characteristics of bridge structures, such as the natural frequencies, mode shapes and model damping ratio, are the basis of structural dynamic computation, seismic analysis, vibration control and structural health condition monitoring. In this paper, a three-dimensional finite-element model is established for a highway bridge over a railway on No.312 National Highway and the ambient test is carried out in site, the dynamic characteristics of the bridge are studied using the finite-element analysis and ambient vibration measurements. Comparison between the theoretical and experimental results shows that the frequency differences of the modes range between 0.44% and 8.77%. If the measurement is more reliable, the finite element model updating is necessary. Thus, a set of design variables is selected based on sensitivity analysis, then the finite element model of the bridge is updated based on optimization algorithm. The results of model updating show that the proposed updating method in this paper is more simple and effective, the updated finite element model can reflect the dynamic characteristics of the bridge better, the analytical results can provide the theoretical basis for damage identification and health condition monitoring of the bridge.

Multiple model tracking algorithms based on neural network and multiple process noise soft switching

A multiple model tracking algorithm based on neural network and multiple-process noise soft-switching for maneuvering targets is presented.In this algorithm, the＂current＂statistical model and neural network are running in parallel.The neural network algorithm is used to modify the adaptive noise filtering algorithm based on the mean value and variance of the＂current＂statistical model for maneuvering targets, and then the multiple model tracking algorithm of the multiple processing switch is used to improve the precision of tracking maneuvering targets.The modified algorithm is proved to be effective by simulation.

Nonlinear Model Algorithmic Control of a pH Neutralization Process

Control of pH neutralization processes is challenging in the chemical process industry because of their inherent strong nonlinearity. In this paper, the model algorithmic control (MAC) strategy is extended to nonlinear processes using Hammerstein model that consists of a static nonlinear polynomial function followed in series by a linear impulse response dynamic element. A new nonlinear Hammerstein MAC algorithm (named NLH-MAC) is presented in detail. The simulation control results of a pH neutralization process show that NLH-MAC gives better control performance than linear MAC and the commonly used industrial nonlinear propotional plus integral plus derivative (PID) controller. Further simulation experiment demonstrates that NLH-MAC not only gives good control response, but also possesses good stability and robustness even with large modeling errors.

RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM

In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.

A genetic Gaussian process regression model based on memetic algorithm

Gaussian process(GP)has fewer parameters,simple model and output of probabilistic sense,when compared with the methods such as support vector machines.Selection of the hyper-parameters is critical to the performance of Gaussian process model.However,the common-used algorithm has the disadvantages of difficult determination of iteration steps,over-dependence of optimization effect on initial values,and easily falling into local optimum.To solve this problem,a method combining the Gaussian process with memetic algorithm was proposed.Based on this method,memetic algorithm was used to search the optimal hyper parameters of Gaussian process regression(GPR)model in the training process and form MA-GPR algorithms,and then the model was used to predict and test the results.When used in the marine long-range precision strike system(LPSS)battle effectiveness evaluation,the proposed MA-GPR model significantly improved the prediction accuracy,compared with the conjugate gradient method and the genetic algorithm optimization process.

Research on Data Routing Model Based on Ant Colony Algorithms

Improved traditional ant colony algorithms,a data routing model used to the data remote exchange on WAN was presented.In the model,random heuristic factors were introduced to realize multi-path search.The updating model of pheromone could adjust the pheromone concentration on the optimal path according to path load dynamically to make the system keep load balance.The simulation results show that the improved model has a higher performance on convergence and load balance.

Research on Initialization on EM Algorithm Based on Gaussian Mixture Model

The EM algorithm is a very popular maximum likelihood estimation method, the iterative algorithm for solving the maximum likelihood estimator when the observation data is the incomplete data, but also is very effective algorithm to estimate the finite mixture model parameters. However, EM algorithm can not guarantee to find the global optimal solution, and often easy to fall into local optimal solution, so it is sensitive to the determination of initial value to iteration. Traditional EM algorithm select the initial value at random, we propose an improved method of selection of initial value. First, we use the k-nearest-neighbor method to delete outliers. Second, use the k-means to initialize the EM algorithm. Compare this method with the original random initial value method, numerical experiments show that the parameter estimation effect of the initialization of the EM algorithm is significantly better than the effect of the original EM algorithm.

A genetic algorithm based stochastic programming model for air quality management

This paper presents a model that can aid planners in defining the total allowable pollutant discharge in the planning region, accounting for the dynamic and stochastic character of meteorological conditions. This is accomplished by integrating Monte Carlo simulation and using genetic algorithm to solve the model. The model is demonstrated by using a realistic air urban scale SO 2 control problem in the Yuxi City of China. To evaluate effectiveness of the model, results of the approach are shown to compare with those of the linear deterministic procedures. This paper also provides a valuable insight into how air quality targets should be made when the air pollutant will not threat the residents' health. Finally, a discussion of the areas for further research are briefly delineated.

QTPV Data Model and Algorithm and Its Application to Geological Exploration Engineering

D spatial data model and simulating are the core of 3D GIS can be adopted in different domains. A data model based on Quasi Tri-Prism Volume (QTPV) has been proposed. QTPV definition and its special cases have been discussed. Using QTPV and its special cases, irregular natural geological bodies and regular subsurface engineering can be described efficiently. The proposed model is composed of five primitives and six objects. Data structures and topological relationship of the fives primitives and three objects describing stratigraphy are designed in detail. Some schemes are designed for the QTPV modelling of stratigraphy and subsurface engineering according to modelling data. The model manipulation method of QTPV cutting by an arbitrary plane is discussed. Using VC ++ 6.0 programming language integrated with SQL database and OpenGL graphic library under windows environment, a system prototype 3DGeoMV has been developed. The experiment result shows that the QTPV model is feasible and efficient in modelling subsurface engineering.

Preset model of bending force for 6-high reversing cold rolling mill based on genetic algorithm

The hydraulic roll-bending device was studied,which was widely used in modern cold rolling mills to regulate the strip flatness.The loaded roll gap crown mathematic model and the strip crown mathematic model of the reversing cold rolling process were established,and the deformation model of roll stack system of the 6-high 1 250 mm high crown (HC) reversing cold rolling mill was built by slit beam method.The simulation results show that,the quadratic component of strip crown decreases nearly linearly with the increase of the work roll bending force,when the shifting value of intermediate roll is determined by the rolling process.From the first pass to the fifth pass of reversing rolling process,the crown controllability of bending force is gradually weakened.Base on analyzing the relationship among the main factors associated with roll-bending force in reversing multi-pass rolling,such as strip width and rolling force,a preset mathematic model of bending force is developed by genetic algorithm.The simulation data demonstrate that the relative deviation of flatness criterions in each rolling pass is improved significantly and the mean relative deviation of all five passes is decreased from 25.1% to 1.7%.The model can keep good shape in multi-pass reversing cold rolling process with the high prediction accuracy and can be used to guide the production process.

A Class of Generalized Approximate Inverse Solvers for Unsymmetric Linear Systems of Irregular Structure Based on Adaptive Algorithmic Modelling for Solving Complex Computational Problems in Three Space Dimensions

A class of general inverse matrix techniques based on adaptive algorithmic modelling methodologies is derived yielding iterative methods for solving unsymmetric linear systems of irregular structure arising in complex computational problems in three space dimensions. The proposed class of approximate inverse is chosen as the basis to yield systems on which classic and preconditioned iterative methods are explicitly applied. Optimized versions of the proposed approximate inverse are presented using special storage (k-sweep) techniques leading to economical forms of the approximate inverses. Application of the adaptive algorithmic methodologies on a characteristic nonlinear boundary value problem is discussed and numerical results are given.

Use of genetic algorithm in new approach to modeling of flood routing

The hydrological models and simpli?ed methods of Saint-venant equations are used extensively in hydrological modeling, in particular for the simulation of the ?ood routing. These models require speci?c and extensive data that usually makes the study of ?ood propagation an arduous practice. We present in this work a new model, based on a transfer function, this function is a function of parametric probability density, having a physical meaning with respect to the propagation of a hydrological signal. The inversion of the model is carried out by an optimization technique called Genetic Algorithm. It consists of evolving a population of parameters based primarily on genetic recombination operators and natural selection to?nd the minimum of an objective function that measures the distance between observed and simulated data. The precision of the simulations of the proposed model is compared with the response of the Hayami model and the applicability of the model is tested on a real case, the N'Fis basin river, located in the High Atlas Occidental, which presents elements that appear favorable to the study of the propagation. The results obtained are very satisfactory and the simulation of the proposed model is very close to the response of the Hayami model.

Parameter Estimation of a Distributed Hydrological Model Using a Genetic Algorithm

Water is a vital resource, and can also sometimes be a destructive force. As such, it is important to manage this resource. The prediction of stream flows is an important component of this management. Hydrological models are very useful in accomplishing this task. The objective of this study is to develop and apply an optimization method useful for calibrating a deterministic model of the daily flows of the Miramichi River watershed (New Brunswick). The model used is the CEQUEAU model. The model is calibrated by applying a genetic algorithm. The Nash-Sutcliffe efficiency criterion, modified to penalize physically unrealistic results, was used as the objective function. The model was calibrated using flow data (1975-2000) from a gauging station on the Southwest Miramichi River (catchment area of 5050 km2), obtaining a Nash-Sutcliffe criterion of 0.83. Model validation was performed using flow data (2001-2009) from the same station (Nash-Sutcliffe criterion value of 0.80). This suggests that the model calibration is sufficiently robust to be used for future predictions. A second model validation was performed using data from three other measuring stations on the same watershed. The model performed well in all three additional locations (Nash-Sutcliffe criterion values of 0.77, 0.76 and 0.74), but was performing less well when applied to smaller sub-basins. Nonetheless, the relatively strong performance of the model suggests that it could be used to predict flows anywhere in the watershed, but caution is suggested for applications in small sub-basins. The performance of the CEQUEAU model was also compared to a simple benchmark model (average of each calendar day). A sensitivity analysis was also performed.

The Application of Genetic Algorithms and Multidimensional Distinguishing Model in Forecasting and Evaluating Credits for Mobile Clients

To solve the arrearage problem that puzzled most of the mobile corporations, we propose an approach to forecast and evaluate the credits for mobile clients, devising a method that is of the coalescence of genetic algorithm and multidimensional distinguishing model. In the end of this paper, a result of a testing application in Zhuhai Branch, GMCC was provided. The precision of the forecasting and evaluation of the client’s credit is near 90%. This study is very significant to the mobile communication corporation at all levels. The popularization of the techniques and the result would produce great benefits of both society and economy.

HIGH RESOLUTION PARAMETRIC MODELLING FOR TWO-DIMENSIONAL RADAR TARGET USING PRONY ALGORITHM

On the conditions of low-resolution radar, a parametric model for two-dimensional radar target is described here according to the theory of electromagnetic scattering and the geometrical theory of diffraction. A high resolution estimation algorithm to extract the model parameters is also developed by building the relation of the scattering model and Prony model. The analysis of Cramer-Rao bound and simulation show that the method here has better statistical performance. The simulated analysis also indicates that the accurate extraction of the diffraction coefficient of scattering center is restricted by signal to noise ratio, radar center frequency and radar bandwidth.

Numerical algorithm of distributed TOPKAPI model and its application

The TOPKAPI （TOPographic Kinematic APproximation and Integration） model is a physically based rainfall-runoff model derived from the integration in space of the kinematic wave model. In the TOPKAPI model, rainfall-runoff and runoff routing processes are described by three nonlinear reservoir differential equations that are structurally similar and describe different hydrological and hydraulic processes. Equations are integrated over grid cells that describe the geometry of the catchment, leading to a cascade of nonlinear reservoir equations. For the sake of improving the model＇s computation precision, this paper provides the general form of these equations and describes the solution by means of a numerical algorithm, the variable-step fourth-order Runge-Kutta algorithm. For the purpose of assessing the quality of the comprehensive numerical algorithm, this paper presents a case study application to the Buliu River Basin, which has an area of 3 310 km^2, using a DEM （digital elevation model） grid with a resolution of 1 km. The results show that the variable-step fourth-order Runge-Kutta algorithm for nonlinear reservoir equations is a good approximation of subsurface flow in the soil matrix, overland flow over the slopes, and surface flow in the channel network, allowing us to retain the physical properties of the original equations at scales ranging from a few meters to 1 km.