混合遗传算法在压水堆换料优化中的应用

针对遗传算法和禁忌搜索算法的优点与缺陷,提出了遗传算法与禁忌搜索算法相结合的混合优化算法.该混合优化算法结合了遗传算法在全局搜索上的优点和禁忌搜索算法在局部搜索方面的优点,与标准遗传算法相比,在搜索能力和收敛速度上都有较大提高.为验证其优越性,使用国际原子能机构IAEA公布的Kalinin 5核电厂WWER 1000型堆芯第二循环换料基准题以及秦山第六循环堆芯换料问题进行了优化计算比较与校验.结果表明,遗传算法和禁忌搜索相结合的混合优化算法比单独使用遗传算法能够获得更好的堆芯布置方案,获得了更大的适应值,循环寿期增加了20 d,并且收敛速度也有所提高.

层状介质参数反演的混合最优化法

波动方程反演是典型的非线性反问题 .本文提出了用混合最优化法反演层状介质参数 .混合最优化法将广义模拟退火与局部最优化方法结合 ,能较好地利用两者的优点 .在本文中 ,局部最优化算法采用线性化迭代算法 .通过数值结果表明反演方法的正确有效性 .

2D multi-scale hybrid optimization method for geophysical inversion and its application

Local and global optimization methods are widely used in geophysical inversion but each has its own advantages and disadvantages. The combination of the two methods will make it possible to overcome their weaknesses. Based on the simulated annealing genetic algorithm （SAGA） and the simplex algorithm, an efficient and robust 2-D nonlinear method for seismic travel-time inversion is presented in this paper. First we do a global search over a large range by SAGA and then do a rapid local search using the simplex method. A multi-scale tomography method is adopted in order to reduce non-uniqueness. The velocity field is divided into different spatial scales and velocities at the grid nodes are taken as unknown parameters. The model is parameterized by a bi-cubic spline function. The finite-difference method is used to solve the forward problem while the hybrid method combining multi-scale SAGA and simplex algorithms is applied to the inverse problem. The algorithm has been applied to a numerical test and a travel-time perturbation test using an anomalous low-velocity body. For a practical example, it is used in the study of upper crustal velocity structure of the A＇nyemaqen suture zone at the north-east edge of the Qinghai-Tibet Plateau. The model test and practical application both prove that the method is effective and robust.

钢管混凝土徐变效应随机性灵敏度分析

针对钢管混凝土徐变的随机性,利用支持向量机回归拟合钢管混凝土徐变效应的显式函数计算随机变量的灵敏度系数,并结合蒙特卡洛法进行随机性分析;采用自适应混合粒子群法优化支持向量机相关参数的取值以提高计算效率;对2个钢管混凝土徐变模型试验构件进行徐变随机性分析,并将计算结果与蒙特卡洛法计算结果进行对比验证了该方法的可行性;同时分析了钢管混凝土徐变效应各影响因素的灵敏度。结果表明:基于支持向量机与蒙特卡洛法对钢管混凝土轴压构件徐变随机性的分析结果与蒙特卡洛法分析结果相比相对误差较小;钢管混凝土徐变效应呈现随机性,概率密度曲线近似于正态分布。

HYBRID MULTI-OBJECTIVE GRADIENT ALGORITHM FOR INVERSE PLANNING OF IMRT

The intelligent optimization of a multi-objective evolutionary algorithm is combined with a gradient algorithm. The hybrid multi-objective gradient algorithm is framed by the real number. Test functions are used to analyze the efficiency of the algorithm. In the simulation case of the water phantom, the algorithm is applied to an inverse planning process of intensity modulated radiation treatment （IMRT）. The objective functions of planning target volume （PTV） and normal tissue （NT） are based on the average dose distribution. The obtained intensity profile shows that the hybrid multi-objective gradient algorithm saves the computational time and has good accuracy, thus meeting the requirements of practical applications.

南航机组排班系统的研究与应用

简要介绍了南方航空公司引进开发的机组管理系统的功能,重点阐述了计算机辅助机组排班模块中所采用的混合整数优化法的数学模型和应用技术,实用结果表明,该优化方法的航线自动配对成功率达到90%以上。

A new hybrid algorithm for global optimization and slope stability evaluation

A new hybrid optimization algorithm was presented by integrating the gravitational search algorithm （GSA） with the sequential quadratic programming （SQP）, namely GSA-SQP, for solving global optimization problems and minimization of factor of safety in slope stability analysis. The new algorithm combines the global exploration ability of the GSA to converge rapidly to a near optimum solution. In addition, it uses the accurate local exploitation ability of the SQP to accelerate the search process and find an accurate solution. A set of five well-known benchmark optimization problems was used to validate the performance of the GSA-SQP as a global optimization algorithm and facilitate comparison with the classical GSA. In addition, the effectiveness of the proposed method for slope stability analysis was investigated using three ease studies of slope stability problems from the literature. The factor of safety of earth slopes was evaluated using the Morgenstern-Price method. The numerical experiments demonstrate that the hybrid algorithm converges faster to a significantly more accurate final solution for a variety of benchmark test functions and slope stability problems.

Modeling and Optimization for Short-term Scheduling of Multipurpose Batch Plants

In the past two decades, short-term scheduling of multipurpose batch plants has received significant attention. Most scheduling problems are modeled using either state-task-network or resource-task-network(RTN) process representation. In this paper, an improved mixed integer linear programming model for short-term schedul-ing of multipurpose batch plants under maximization of profit is proposed based on RTN representation and unit-specific events. To solve the model, a hybrid algorithm based on line-up competition algorithm and linear programming is presented. The proposed model and hybrid algorithm are applied to two benchmark examples in literature. The simulation results show that the proposed model and hybrid algorithm are effective for short-term scheduling of multipurpose batch plants.

Optimization of projectile aerodynamic parameters based on hybrid genetic algorithm

Aerodynamic parameters are important factors that affect projectile flight movement. To obtain accurate aerodynamic parameters, a hybrid genetic algorithm is proposed to identify and optimize the aerodynamic parameters of projectile. By combining the traditional simulated annealing method that is easy to fall into local optimum solution but hard to get global parameters with the genetic algorithm that has good global optimization ability but slow local optimization ability, the hybrid genetic algo- rithm makes full use of the advantages of the two algorithms for the optimization of projectile aerodynamic parameters. The simulation results show that the hybrid genetic algorithm is better than a single algorithm.

Multi-objective coordination optimal model for new power intelligence center based on hybrid algorithm

In order to resolve the coordination and optimization of the power network planning effectively, on the basis of introducing the concept of power intelligence center (PIC), the key factor power flow, line investment and load that impact generation sector, transmission sector and dispatching center in PIC were analyzed and a multi-objective coordination optimal model for new power intelligence center (NPIC) was established. To ensure the reliability and coordination of power grid and reduce investment cost, two aspects were optimized. The evolutionary algorithm was introduced to solve optimal power flow problem and the fitness function was improved to ensure the minimum cost of power generation. The gray particle swarm optimization (GPSO) algorithm was used to forecast load accurately, which can ensure the network with high reliability. On this basis, the multi-objective coordination optimal model which was more practical and in line with the need of the electricity market was proposed, then the coordination model was effectively solved through the improved particle swarm optimization algorithm, and the corresponding algorithm was obtained. The optimization of IEEE30 node system shows that the evolutionary algorithm can effectively solve the problem of optimal power flow. The average load forecasting of GPSO is 26.97 MW, which has an error of 0.34 MW compared with the actual load. The algorithm has higher forecasting accuracy. The multi-objective coordination optimal model for NPIC can effectively process the coordination and optimization problem of power network.

Chemical process dynamic optimization based on hybrid differential evolution algorithm integrated with Alopex

To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.

A novel hybrid algorithm based on a harmony search and artificial bee colony for solving a portfolio optimization problem using a mean-semi variance approach

Portfolio selection is one of the major capital allocation and budgeting issues in financial management, and a variety of models have been presented for optimal selection. Semi-variance is usually considered as a risk factor in drawing up an efficient frontier and the optimal portfolio. Since semi-variance offers a better estimation of the actual risk portfolio, it was used as a measure to approximate the risk of investment in this work. The optimal portfolio selection is one of the non-deterministic polynomial(NP)-hard problems that have not been presented in an exact algorithm, which can solve this problem in a polynomial time. Meta-heuristic algorithms are usually used to solve such problems. A novel hybrid harmony search and artificial bee colony algorithm and its application were introduced in order to draw efficient frontier portfolios. Computational results show that this algorithm is more successful than the harmony search method and genetic algorithm. In addition, it is more accurate in finding optimal solutions at all levels of risk and return.

A Hybrid Algorithm Based on Differential Evolution and Group Search Optimization and Its Application on Ethylene Cracking Furnace

To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is based on the differential evolution(DE) and the group search optimization(GSO).The DEGSO combines the advantages of the two algorithms:the high computing speed of DE and the good performance of the GSO for preventing the best particle from converging to local optimum.A cooperative method is also proposed for switching between these two algorithms.If the fitness value of one algorithm keeps invariant in several generations and less than the preset threshold,it is considered to fall into the local optimization and the other algorithm is chosen.Experiments on benchmark functions show that the hybrid algorithm outperforms GSO in accuracy,global searching ability and efficiency.The optimization of ethylene and propylene yields is illustrated as a case by DEGSO.After optimization,the yield of ethylene and propylene is increased remarkably,which provides the proper operational condition of the ethylene cracking furnace.

Modified electromagnetism-like algorithm and its application to slope stability analysis

In the view of the disadvantages of complex method (CM) and electromagnetism-like algorithm (EM), complex electromagnetism-like hybrid algorithm (CEM) was proposed by embedding complex method into electromagnetism-like algorithm as local optimization algorithm. CEM was adopted to search the minimum safety factor in slope stability analysis and the results show that CEM holds advantages over EM and CM. It combines the merits of two and is more stable and efficient. For further improvement, two CEM hybrid algorithms based on predatory search (PS) strategies were proposed, both of which consist of modified algorithms and the search area of which is dynamically adjusted by changing restriction. The CEM-PS1 adopts theoretical framework of original predatory search strategy. The CEM-PS2 employs the idea of area-restricted search learned from predatory search strategy, but the algorithm structure is simpler. Both the CEM-PS1 and CEM-PS2 have been demonstrated more effective and efficient than the others. As for complex method which locates in hybrid algorithm, the optimization can be achieved at a convergence precision of 1×10-3, which is recommended to use.

A ROBUST PHASE-ONLY DIRECT DATA DOMAIN ALGORITHM BASED ON GENERALIZED RAYLEIGH QUOTIENT OPTIMIZATION USING HYBRID GENETIC ALGORITHM

A robust phase-only Direct Data Domain Least Squares (D3LS) algorithm based on gen- eralized Rayleigh quotient optimization using hybrid Genetic Algorithm (GA) is presented in this letter. The optimization efficiency and computational speed are improved via the hybrid GA com- posed of standard GA and Nelder-Mead simplex algorithms. First, the objective function, with a form of generalized Rayleigh quotient, is derived via the standard D3LS algorithm. It is then taken as a fitness function and the unknown phases of all adaptive weights are taken as decision variables. Then, the nonlinear optimization is performed via the hybrid GA to obtain the optimized solution of phase-only adaptive weights. As a phase-only adaptive algorithm, the proposed algorithm is sim- pler than conventional algorithms when it comes to hardware implementation. Moreover, it proc- esses only a single snapshot data as opposed to forming sample covariance matrix and operating matrix inversion. Simulation results show that the proposed algorithm has a good signal recovery and interferences nulling performance, which are superior to that of the phase-only D3LS algorithm based on standard GA.

A Hybrid Model Predictive Control for Handling Infeasibility and Constraint Prioritization

A hybrid approach using MLD (mixed logical dynamical) framework to handle infeasibility and constraint prioritization issues in MPC (model predictive control) based on input-output model is introduced. By expressing constraint priorities as propositional logics and by transforming the propositional logics into inequalities,the infeasibility and constraint prioritization issues are solved in the MPC. Constraints with higher priorities are met first, and then these with lower priorities are satisfied as much as possible. This new approach is illustrated in the control of a heavy oil fractionator-Shell column. The overall control performance has been significantly improved through the infeasibility and control priorities handling.

An Improved Hybrid Genetic Algorithm for Chemical Plant Layout Optimization with Novel Non-overlapping and Toxic Gas Dispersion Constraints

New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm (GA) based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.

An optimizing algorithm of static task scheduling problem based on hybrid genetic algorithm

To reduce resources consumption of parallel computation system, a static task scheduling opti- mization method based on hybrid genetic algorithm is proposed and validated, which can shorten the scheduling length of parallel tasks with precedence constraints. Firstly, the global optimal model and constraints are created to demonstrate the static task scheduling problem in heterogeneous distributed computing systems（HeDCSs）. Secondly, the genetic population is coded with matrix and used to search the total available time span of the processors, and then the simulated annealing algorithm is introduced to improve the convergence speed and overcome the problem of easily falling into local minimum point, which exists in the traditional genetic algorithm. Finally, compared to other existed scheduling algorithms such as dynamic level scheduling （ DLS）, heterogeneous earliest finish time （HEFr）, and longest dynamic critical path（ LDCP）, the proposed approach does not merely de- crease tasks schedule length, but also achieves the maximal resource utilization of parallel computa- tion system by extensive experiments.

STUDY ON THE METEOROLOGICAL PREDICTION MODEL USING THE LEARNING ALGORITHM OF NEURAL ENSEMBLE BASED ON PSO ALGORITHMS

Because of the difficulty in deciding on the structure of BP neural network in operational meteorological application and the tendency for the network to transform to an issue of local solution, a hybrid Particle Swarm Optimization Algorithm based on Artificial Neural Network (PSO-BP) model is proposed for monthly mean rainfall of the whole area of Guangxi. It combines Particle Swarm Optimization (PSO) with BP, that is, the number of hidden nodes and connection weights are optimized by the implementation of PSO operation. The method produces a better network architecture and initial connection weights, trains the traditional backward propagation again by training samples. The ensemble strategy is carried out for the linear programming to calculate the best weights based on the "east sum of the error absolute value" as the optimal rule. The weighted coefficient of each ensemble individual is obtained. The results show that the method can effectively improve learning and generalization ability of the neural network.

Prediction of Flash Point Temperature of Organic Compounds Using a Hybrid Method of Group Contribution ＋ Neural Network ＋ Particle Swarm Optimization

The flash points of organic compounds were estimated using a hybrid method that includes a simple group contribution method (GCM) implemented in an artificial neural network (ANN) with particle swarm optimization (PSO). Different topologies of a multilayer neural network were studied and the optimum architecture was determined. Property data of 350 compounds were used for training the network. To discriminate different substances the molecular structures defined by the concept of the classical group contribution method were given as input variables. The capabilities of the network were tested with 155 substances not considered in the training step. The study shows that the proposed GCM+ANN+PSO method represent an excellent alternative for the estimation of flash points of organic compounds with acceptable accuracy (AARD = 1.8%; AAE = 6.2 K).