模糊自适应遗传算法及其在化工中的应用

Considering that the performance of a genetic algorithm (GA) is affected by many factors and their rela-tionships are complex and hard to be described,a novel fuzzy-based adaptive genetic algorithm (FAGA) combined a new artificial immune system with fuzzy system theory is proposed due to the fact fuzzy theory can describe high complex problems.In FAGA,immune theory is used to improve the performance of selection operation.And,crossover probability and mutation probability are adjusted dynamically by fuzzy inferences,which are developed according to the heuristic fuzzy relationship between algorithm performances and control parameters.The experi-ments show that FAGA can efficiently overcome shortcomings of GA,i.e.,premature and slow,and obtain better results than two typical fuzzy GAs.Finally,FAGA was used for the parameters estimation of reaction kinetics model and the satisfactory result was obtained.     

基于多智体免疫网络算法的精馏装置板效率估计(英文)

Based on the immune mechanics and multi-agent technology, a multi-agent artificial immune network (Maopt-aiNet) algorithm is introduced. Maopt-aiNet makes use of the agent ability of sensing and acting to overcome premature problem, and combines the global and local search in the searching process. The performance of the proposed method is examined with 6 benchmark problems and compared with other well-known intelligent algorithms. The experiments show that Maopt-aiNet outperforms the other algorithms in these benchmark functions. Furthermore, Maopt-aiNet is applied to determine the Murphree efficiency of distillation column and satisfactory results are obtained.     

催化重整过程的多目标优化

In this article, a multiobjective optimization strategy for an industrial naphtha continuous catalytic reforming process that aims to obtain aromatic products is proposed. The process model is based on a 20-lumped kinetics reaction network and has been proved to be quite effective in terms of industrial application. The primary objectives include maximization of yield of the aromatics and minimization of the yield of heavy aromatics. Four reactor inlet temperatures, reaction pressure, and hydrogen-to-oil molar ratio are selected as the decision variables. A genetic algorithm, which is proposed by the authors and named as the neighborhood and archived genetic algorithm （NAGA）, is applied to solve this multiobjective optimization problem. The relations between each decision variable and the two objectives are also proposed and used for choosing a suitable solution from the obtained Pareto set.     

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy al constraints while meeting demand requirement of packed products from various product fam-ilies. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore, we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromo-somes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to de-termine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for com-parison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, al heuristics show the capability to solve large instances within reason-able computational time. In al problem instances, genetic algorithm averagely outperforms ant colony optimiza-tion and Tabu search with slightly longer computational time.     

基于免疫系统的自适应差分进化算法及在水银氧化动力学参数估计中的应用

A new version of differential evolution (DE) algorithm, in which immune concepts and methods are applied to determine the parameter setting, named immune self-adaptive differential evolution (ISDE), is proposed to improve the performance of the DE algorithm. During the actual operation, ISDE seeks the optimal parameters arising from the evolutionary process, which enable ISDE to alter the algorithm for different optimization problems and improve the performance of ISDE by the control parameters’ self-adaptation. The performance of the proposed method is studied with the use of nine benchmark problems and compared with original DE algorithm and other well-known self-adaptive DE algorithms. The experiments conducted show that the ISDE clearly outperforms the other DE algorithms in all benchmark functions. Furthermore, ISDE is applied to develop the kinetic model for homogeneous mercury (Hg) oxidation in flue gas, and satisfactory results are obtained.     

基于遗传算法求解以最大利润为目标的间歇生产过程调度问题

The optimal scheduling of multi-product batch process is studied and a new mathematics model targeting the maximum profit is proposed, which can be solved by the modified genetic algorithm (MGA) with mixed coding (sequence coding and decimal coding) developed by us. In which, the partially matched cross over (PMX) and reverse mutation are used for the sequence coding, whereas the arithmetic crossover and heteropic mutation are used for the decimal coding. In axidition, the relationship between production scale and production cost is analyzed and the maximum profit is always a trade-off of the production scale and production cost. Two examples are solved to demonstrate the effectiveness of the method.     

A new retrofit approach for heat exchanger networks——improved genetic algorithm

Inspired by genetic algorithm(GA),an improved genetic algorithm(IGA)is proposed.It inherits the main idea of evolutionary computing,avoids the process of coding and decoding inorder to probe the solution in the state space directly and has distributed computing version.Soit is faster and gives higher precision.Aided by IGA,a new optimization strategy for theflexibility analysis and retrofitting of existing heat exchanger networks is presented.A case studyshows that IGA has the ability of finding the global optimum with higher speed and better preci-sion.     

一种改进的混合遗传算法及在化工过程动态优化中的应用(英文)

The solutions of dynamic optimization problems are usually very difficult due to their highly nonlinear and multidimensional nature. Genetic algorithm (GA) has been proved to be a feasible method when the gradient is difficult to calculate. Its advantage is that the control profiles at all time stages are optimized simultaneously, but its convergence is very slow in the later period of evolution and it is easily trapped in the local optimum. In this study, a hybrid improved genetic algorithm (HIGA) for solving dynamic optimization problems is proposed to overcome these defects. Simplex method (SM) is used to perform the local search in the neighborhood of the optimal solution. By using SM, the ideal searching direction of global optimal solution could be found as soon as possible and the convergence speed of the algorithm is improved. The hybrid algorithm presents some improvements, such as protecting the best individual, accepting immigrations, as well as employing adaptive crossover and Gaussian mutation operators. The efficiency of the proposed algorithm is demonstrated by solving several dynamic optimization problems. At last, HIGA is applied to the optimal production of secreted protein in a fed batch reactor and the optimal feed-rate found by HIGA is effective and relatively stable.     

基于一种改进的自适应遗传算法估算环已烷自催化氧化反应动力学参数

A modified genetic algorithm of multiple selection strategies, crossover strategies and adaptive operator is constructed, and it is used to estimate the kinetic parameters in autocatalytic oxidation of cyclohexane. The influences of selection strategy, crossover strategy and mutation strategy on algorithm performance are discussed. This algorithm with a specially designed adaptive operator avoids the problem of local optimum usually associated with using standard genetic algorithm and simplex method. The kinetic parameters obtained from the modified genetic algorithm are credible and the calculation results using these parameters agree well with experimental data. Furthermore, a new kinetic model of cyclohexane autocatalytic oxidation is established and the kinetic parameters are estimated by using the modified genetic algorithm.     

一种求解阻塞型流水车间调度的离散人工蜂群算法(英文)

A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.     

非线性蒸汽动力系统参数优化新方法——改进遗传算法

针对蒸汽动力系统参数优化的整数非线性规划问题（ＮＬＰ）提出一种改进的遗传算法。该算法对连续变量采用连续化遗传算子进行处理,使得算法与原问题的对应更加自然有效。针对常见的提前收敛或局部最小现象提出几种算子。实例表明本方法能对蒸汽动力系统参数准确、迅速地进行优化。     

A genetic‐algorithm‐based optimal scheduling system for full‐filled tanks in the processing of starting materials for alumina production

Due to the instability of mine sources and the uncertainty of the composition of returned lye and waste liquid, there exists a significant fluctuation of raw slurry quality in the blending process of starting materials for sintering. The expected slurry was obtained through the mixing of starting materials in full‐filled tanks. In this article, an optimal scheduling model of full‐filled tanks is developed based on material balance principle and expert experiences subject to technological requirements. To solve such optimization problem, an improved genetic algorithm (IGA) is proposed, in which the intervention strategy is introduced into the random process of population initialization to obtain the well‐proportioned initial population and the probabilities of crossover and mutation are changed according to the difference between the fitness value of the best solution and the average fitness value of the better solutions as well as the difference between the fitness value of the best solution and the average fitness value of the current population to prevent premature convergence. The IGA‐based optimization system was applied to the processing of raw slurry for alumina production and the actual running results show that the composition fluctuation in mixed raw slurry decreased significantly, effectively improving the eligibility rate of the mixed raw slurry and contributing to the stabilization of the subsequent process of alumina production.     

一种新的DNA遗传算法及其在参数估计中的应用

化工过程的参数估计是十分棘手的问题,为此常将这类问题转化为非线性优化问题来解决。遗传算法是一种适应性强的全局搜索方法,常被用于解决非线性系统的参数估计问题。但其局部搜索能力较差,易早熟。针对遗传算法的缺点,提出了一种新的DNA遗传算法。该方法使用碱基对个体进行四进制编码,受DNA分子操作启发设计了新的交叉和变异算子。两个经典测试函数的计算结果表明,该算法的搜索能力相对于其他两种算法有了明显提高。使用该算法来估计重油热解三集总模型中的参数,结果表明所建模型拟合精度高。     

迭代遗传算法及其用于生物反应器补料优化

针对化工动态优化的数值求解问题,提出将迭代思想与遗传操作相结合,构建迭代遗传算法.算法首先对时间区间和控制搜索域实施离散化,进而应用遗传操作搜索离散问题的最优控制策略.逐步收缩搜索域并迭代以消减离散化带来的偏差,不断改善寻优结果,增强算法的稳健性.实例测试表明该算法简便、可行、高效,已成功地应用于Lee-Ramirez生物反应器补料流率的优化,运算结果优于文献值,显示了迭代遗传算法的优越性.迭代遗传算法尤其适用于系统的梯度信息不可得的情况.     

An improved genetic algorithm based on a novel selection strategy for nonlinear programming problems

Genetic algorithm is a heuristic population-based search method that incorporates three primary operators: crossover, mutation and selection. Selection operator plays a crucial role in finding optimal solution for constrained optimization problems. In this paper, an improved genetic algorithm (IGA) based on a novel selection strategy is presented to handle nonlinear programming problems. Each individual in selection process is represented as a three-dimensional feature vector composed of objective function value, the degree of constraints violations and the number of constraints violations. We can distinguish excellent individuals through two indices according to Pareto partial order. Additionally, IGA incorporates a local search (LS) process into selection operation so as to find feasible solutions located in neighboring areas of some infeasible solutions. Experimental results over a set of benchmark problems demonstrate that proposed IGA has better robustness, effectiveness and stableness than other algorithm reported in literature.     

大规模过程系统能量优化综合的遗传模拟退火算法

为求解一般优化算法难以解决的大规模化工系统全过程用能优化综合问题,根据过程用能一致性原则,将其转换为一个大规模虚拟换热网络的求解问题．本文将改进的遗传算法和模拟退火算法有效地结合,增强了遗传算法的搜索能力,预防了传统遗传算法提前收敛的缺陷．数值计算表明,此算法显著优于求解优化问题的遗传算法和模拟退火算法,可处理热、冷流股数超过100的大规模过程系统的用能优化问题,取得了满意的结果．     

A hybrid DNA based genetic algorithm for parameter estimation of dynamic systems

Inspired by the evolutionary strategy and the biological DNA mechanism, a hybrid DNA based genetic algorithm (HDNA-GA) with the population update operation and the adaptive parameter scope operation is proposed for solving parameter estimation problems of dynamic systems. The HDNA-GA adopts the nucleotides based coding and some molecular operations. In HDNA-GA, three new crossover operators, replacement operator, transposition operator and reconstruction operator, are designed to improve the population diversity, and the mutation operator with adaptive mutation probability is applied to guarantee against stalling at local peak. Besides, the simulated annealing based selection operator is used to guide the evolution direction. In order to overcome the premature convergence drawbacks of GAs and enhance the algorithm global and local search abilities, the population update operator and the adaptive parameter scope operator are suggested. Numerous comparative experiments on benchmark functions and real-world parameter estimation problems in dynamic systems are conducted and the results demonstrate the effectiveness and efficiency of the HDNA-GA.