Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this pr...Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.展开更多
The traditional prediction methods of element yield rate can be divided into experience method and data-driven method.But in practice,the experience formulae are found to work only under some specific conditions,and t...The traditional prediction methods of element yield rate can be divided into experience method and data-driven method.But in practice,the experience formulae are found to work only under some specific conditions,and the sample data that are used to establish data-driven models are always insufficient.Aiming at this problem,a combined method of genetic algorithm(GA) and adaptive neuro-fuzzy inference system(ANFIS) is proposed and applied to element yield rate prediction in ladle furnace(LF).In order to get rid of the over reliance upon data in data-driven method and act as a supplement of inadequate samples,smelting experience is integrated into prediction model as fuzzy empirical rules by using the improved ANFIS method.For facilitating the combination of fuzzy rules,feature construction method based on GA is used to reduce input dimension,and the selection operation in GA is improved to speed up the convergence rate and to avoid trapping into local optima.The experimental and practical testing results show that the proposed method is more accurate than other prediction methods.展开更多
The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into loca...The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.展开更多
Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The ...Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The grid optimization method is always used to find proper initial matrix for off-line estimation.However,the grid method has the draw back being time consuming hence,coarse grid followed by a fine grid method is adopted.To further improve efficiency without the loss of estimation accuracy,we propose a genetic algorithm for the coarse grid optimization in this paper.It is recognized that the crossover rate and mutation rate are the main influencing factors for the performance of the genetic algorithm,so sensitivity experiments for these two factors are carried out and a set of genetic algorithm parameters with good adaptability were selected by testing with several gyros’experimental data.Experimental results show that the proposed algorithm has higher efficiency and better estimation accuracy than the traversing grid algorithm.展开更多
机械钻速(rate of penetration,ROP)是钻井作业优化和减少成本的关键因素,钻井时有效地预测ROP是提升钻进效率的关键。由于井下钻进时复杂多变的情况和地层的非均质性,通过传统的ROP方程和回归分析方法来预测钻速受到了一定的限制。为...机械钻速(rate of penetration,ROP)是钻井作业优化和减少成本的关键因素,钻井时有效地预测ROP是提升钻进效率的关键。由于井下钻进时复杂多变的情况和地层的非均质性,通过传统的ROP方程和回归分析方法来预测钻速受到了一定的限制。为了实现对钻速的高精度预测,对现有BP (back propagation)神经网络进行优化,提出了一种新的神经网络模型,即动态自适应学习率的粒子群优化BP神经网络,利用录井数据建立目标井预测模型来对钻速进行预测。在训练过程中对BP神经网络进行优化,利用启发式算法,即附加动量法和自适应学习率,将两种方法结合起来形成动态自适应学习率的BP改进算法,提高了BP神经网络的训练速度和拟合精度,获得了更好的泛化性能。将BP神经网络与遗传优化算法(genetic algorithm,GA)和粒子群优化算法(particle swarm optimization,PSO)结合,得到优化后的动态自适应学习率BP神经网络。研究利用XX8-1-2井的录井数据进行实验,对比BP神经网络、PSO-BP神经网络、GA-BP神经网络3种不同的改进后神经网络的预测结果。实验结果表明:优化后的PSO-BP神经网络的预测性能最好,具有更高的效率和可靠性,能够有效的利用工程数据,在有一定数据采集量的区域提供较为准确的ROP预测。展开更多
Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow conver...Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow convergence when the solution is close to the optimum solution.This paper presents an improved real-coded genetic algorithm to increase the computation efficiency and avoid prematurity,especially in the optimization of multi-modal function.In this method,mutation operation and crossover operation are improved.Examples are given to demonstrate its com p utation efficiency and robustness.展开更多
基金the National Natural Science Foundation of China(Nos.60574071 and70771080)
文摘Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems. Various methods are proposed for solving this problem. Of all the algorithms, the ge- netic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes maybe infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.
基金Projects(2007AA041401,2007AA04Z194) supported by the National High Technology Research and Development Program of China
文摘The traditional prediction methods of element yield rate can be divided into experience method and data-driven method.But in practice,the experience formulae are found to work only under some specific conditions,and the sample data that are used to establish data-driven models are always insufficient.Aiming at this problem,a combined method of genetic algorithm(GA) and adaptive neuro-fuzzy inference system(ANFIS) is proposed and applied to element yield rate prediction in ladle furnace(LF).In order to get rid of the over reliance upon data in data-driven method and act as a supplement of inadequate samples,smelting experience is integrated into prediction model as fuzzy empirical rules by using the improved ANFIS method.For facilitating the combination of fuzzy rules,feature construction method based on GA is used to reduce input dimension,and the selection operation in GA is improved to speed up the convergence rate and to avoid trapping into local optima.The experimental and practical testing results show that the proposed method is more accurate than other prediction methods.
文摘The convergence of genetic algorithm is mainly determined by its core operation crossover operation. When the objective function is a multiple hump function, traditional genetic algorithms are easily trapped into local optimum, which is called premature conver- gence. In this paper, we propose a new genetic algorithm with improved arithmetic crossover operation based on gradient method. This crossover operation can generate offspring along quasi-gradient direction which is the Steepest descent direction of the value of objective function. The selection operator is also simplified, every individual in the population is given an opportunity to get evolution to avoid complicated selection algorithm. The adaptive mutation operator and the elitist strategy are also applied in this algorithm. The case 4 indicates this algorithm can faster converge to the global optimum and is more stable than the conventional genetic algorithms.
文摘Extended Kalman Filter(EKF)algorithm is widely used in parameter estimation for nonlinear systems.The estimation precision is sensitively dependent on EKF’s initial state covariance matrix and state noise matrix.The grid optimization method is always used to find proper initial matrix for off-line estimation.However,the grid method has the draw back being time consuming hence,coarse grid followed by a fine grid method is adopted.To further improve efficiency without the loss of estimation accuracy,we propose a genetic algorithm for the coarse grid optimization in this paper.It is recognized that the crossover rate and mutation rate are the main influencing factors for the performance of the genetic algorithm,so sensitivity experiments for these two factors are carried out and a set of genetic algorithm parameters with good adaptability were selected by testing with several gyros’experimental data.Experimental results show that the proposed algorithm has higher efficiency and better estimation accuracy than the traversing grid algorithm.
文摘Real-coded genetic algorithm（RGA）usually meets the demand of consecutive space problem.However,compared with simple genetic algorithm（SGA）RGA also has the inherent disadvantages such as prematurity and slow convergence when the solution is close to the optimum solution.This paper presents an improved real-coded genetic algorithm to increase the computation efficiency and avoid prematurity,especially in the optimization of multi-modal function.In this method,mutation operation and crossover operation are improved.Examples are given to demonstrate its com p utation efficiency and robustness.
