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

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.     

基于改进GSO的裂解炉原料切换策略研究(英文)

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is pro-posed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the“excel-lent”infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Final y, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is 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.     

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.     

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

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.     

改进的自适应免疫算法及其在对二甲苯氧化燃烧副反应优化中的应用(英文)

In recent years, immune genetic algorithm (IGA) is gaining popularity for finding the optimal solution for non-linear optimization problems in many engineering applications. However, IGA with deterministic mutation factor suffers from the problem of premature convergence. In this study, a modified self-adaptive immune genetic algorithm (MSIGA) with two memory bases, in which immune concepts are applied to determine the mutation parameters, is proposed to improve the searching ability of the algorithm and maintain population diversity. Performance comparisons with other well-known population-based iterative algorithms show that the proposed method converges quickly to the global optimum and overcomes premature problem. This algorithm is applied to optimize a feed forward neural network to measure the content of products in the combustion side reaction of p-xylene oxidation, and satisfactory results are obtained.     

一种用于计算机辅助产物设计中基于BP-NN优化问题的求解方法

Because of the powerful mapping ability, back propagation neural network (BP-NN) has been employed in computer-aided product design (CAPD) to establish the property prediction model. The backward problem in CAPD is to search for the appropriate structure or composition of the product with desired property, which is an optimization problem. In this paper, a global optimization method of using the a BB algorithm to solve the backward problem is presented. In particular, a convex lower bounding function is constructed for the objective function formulated with BP-NN model, and the calculation of the key parameter a is implemented by recurring to the interval Hessian matrix of the objective function. Two case studies involving the design of dopamine β-hydroxylase (DβH) inhibitors and linear low density polyethylene (LLDPE) nano composites are investigated using the proposed method.     

一种针对原油调合过程的新型调度方法(英文)

For those refineries which have to deal with different types of crude oil, blending is an attractive solution to obtain a quality feedstock. In this paper, a novel scheduling strategy is proposed for a practical crude oil blending process. The objective is to keep the property of feedstock, mainly described by the true boiling point (TBP) data, consistent and suitable. Firstly, the mathematical model is established. Then, a heuristically initialized hybrid iterative (HIHI) algorithm based on a two-level optimization structure, in which tabu search (TS) and differential evolution (DE) are used for upper-level and lower-level optimization, respectively, is proposed to get the model solution. Finally, the effectiveness and efficiency of the scheduling strategy is validated via real data from a certain refinery.     

一种新颖的面向化工过程的实时优化方法(英文)

In this paper, a novel approach termed process goose queue (PGQ) is suggested to deal with real-time optimization (RTO) of chemical plants. Taking advantage of the ad-hoc structure of PGQ which imitates biologic nature of flying wild geese, a chemical plant optimization problem can be re-formulated as a combination of a multi-layer PGQ and a PGQ-Objective according to the relationship among process variables involved in the objective and constraints. Subsequently, chemical plant RTO solutions are converted into coordination issues among PGQs which could be dealt with in a novel way. Accordingly, theoretical definitions, adjustment rule and implementing procedures associated with the approach are explicitly introduced together with corresponding enabling algorithms. Finally, an exemplary chemical plant is employed to demonstrate the feasibility and validity of the contribution.     

A novel two-stage Lagrangian decomposition approach for refinery production scheduling with operational transitions in mode switching☆

To address large scale industrial processes, a novel Lagrangian scheme is proposed to decompose a refinery scheduling problem with operational transitions in mode switching into a production subproblem and a blending and delivery subproblem. To accelerate the convergence of Lagrange multipliers, some auxiliary constraints are added in the blending and delivery subproblem. A speed-up scheme is presented to increase the efficiency for solving the production subproblem. An initialization scheme of Lagrange multipliers and a heuristic algorithm to find feasible solutions are designed. Computational results on three cases with different lengths of time hori-zons and different numbers of orders show that the proposed Lagrangian scheme is effective and efficient.     

不确定条件下中间存储时间有限多产品间歇生产过程调度

针对产品处理时间不确定条件下中间存储时间有限多产品间歇生产过程调度问题, 采用三角模糊数描述处理时间的不确定性, 通过一种模糊排序的方法建立了以最小化模糊最大完工时间的值以及不确定度作为调度目标的数学模型, 提出一种基于改进粒子群和分布估计的混合算法(IPSO-EDA)。IPSO-EDA算法在粒子群更新公式中引入基于所有粒子自身最优位置的优质个体分布信息, 提高了算法的全局搜索能力, 同时采用NEH初始化获得理想的初始解, 采用NEH局部搜索提高算法的局部搜索能力。通过正交实验设计对算法的参数进行调节, 仿真结果表明了所提出算法的有效性和优越性。     

A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem

A new multi-skill multi-mode resource constrained project scheduling problem with three objectives is studied in this paper. The objectives are: (1) minimizing project's makespan, (2) minimizing total cost of allocating workers to skills, and (3) maximizing total quality of processing activities. A meta-heuristic algorithm called multi-objective invasive weeds optimization algorithm (MOIWO) with a new chromosome structure guaranteeing feasibility of solutions is developed to solve the proposed problem. Two other meta-heuristic algorithms called non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization algorithm (MOPSO) are used to validate the solutions obtained by the developed MOIWO. The parameters of the developed algorithms are calibrated using Taguchi method. The results of the experiments show that the MOIWO algorithm has better performance in terms of diversification metric, the MOPSO algorithm has better performance regarding mean ideal distance, while NSGA-II algorithm has better performance in terms of spread of non-dominance solution and spacing metrics.     

A novel search framework for multi‐stage process scheduling with tight due dates

This article improves the original genetic algorithm developed by He and Hui (Chem Eng Sci. 2007; 62:1504–1527) and proposes a novel global search framework (GSF) for the large‐size multi‐stage process scheduling problems. This work first constructs a comprehensive set of position selection rules according to the impact factors analysis presented by He and Hui (in this publication in 2007), and then selects suitable rules for schedule synthesis. In coping with infeasibility emerging during the search, a penalty function is adopted to force the algorithm to approach the feasible solutions. The large‐size problems with tight due dates are challenging to the current solution techniques. Inspired by the gradient used in numerical analysis, we treat the deviation existing among the computational tests of the algorithm as evolutionary gradient. Based on this concept, a GSF is laid out to fully utilize the search ability of the current algorithm. Numerical experiments indicate that the proposed search framework solves such problems with satisfactory solutions. © 2010 American Institute of Chemical Engineers AIChE J, 2010     

改进的生物地理学优化算法在混合流水车间调度中的应用

调度问题是将有限的资源分配给各项不同任务的决策过程,其目的是优化一个或多个目标,它广泛存在于当今大多数的制造和生产系统中。混合流水车间调度问题是一般流水车间调度问题的推广,更接近实际的生产过程。采用一种新型的算法--生物地理学优化算法求解混合流水车间调度问题,通过引入改进策略,增强了算法的全局搜索能力和局部搜索能力,并提高了算法的收敛速度。通过10个标准调度算例的仿真研究,并与遗传算法进行对比,验证了改进后的生物地理学优化算法在求解混合流水车间调度问题方面的优越性。     

基于邻域-克隆选择学习算法的分馏装置负荷优化

在免疫克隆选择和人工免疫网络算法基础上,采用了Agent的思想,提出了一种邻域-克隆选择学习全局优化算法(N-Clonalg)。不同于其他人工免疫算法,N-Clonalg定义了网格化的邻域操作环境,其主要搜索算子有N-克隆选择、N-竞争和自学习算子,能有机结合全局与局部搜索,多峰测试函数表明能较好地克服克隆选择算法(Clonalg)的早熟及人工免疫网络算法(Opt-aiNet)收敛速度慢问题。分馏装置负荷优化实例应用表明,算法具有较好的最优解搜索性能,能较好地实现化工中的寻优问题。     

单纯形遗传优化算法在陶瓷配方中应用

采用了遗传算法对Nelder-Mead单纯形法进行优化,提出了单纯形遗传优化算法,利用遗传算法的变异操作来增强单纯形法的全局搜索能力,并解决标准遗传算法局部搜索能力较弱的问题。将该算法应用于陶瓷配方设计,与单纯形法运算的结果进行了对比,实验结果验证了该算法的优越性。     

An iterative two‐step sequential phase partition (ITSPP) method for batch process modeling and online monitoring

Operating at different manufacturing steps, multiphase modeling and analysis of the batch process are advantageous to improving monitoring performance and understanding manufacturing processes. Although many phase partition algorithms have been proposed, they have some disadvantages and cause problems: (1) time sequence disorder, which requires elaborate post‐treatments; (2) a lack of quantitative index to indicate transition patterns; and (3) tunable parameters that cannot be quantitatively determined. To effectively overcome these problems, an iterative two‐step sequential phase partition algorithm is proposed in the present work. In the first step, initial phase partition results are obtained by checking changes of the control limit of squared prediction error. Sequentially, the fast search and find of density peaks clustering algorithm is employed to adjust the degradation degree and update the phase partition results. These two steps are iteratively executed until a proper degradation degree is found for the first phase. Then, the remaining phases are processed one by one using the same procedure. Moreover, a statistical index is quantitatively defined based on density and distance analysis to judge whether a process has transitions, and when the transition regions begin and end. In this way, the phases and transition patterns are quantitatively determined without ambiguity from the perspective of monitoring performance. The effectiveness of the proposed method is illustrated by a numerical example and a typical industrial case. Several typical phase partition algorithms are also employed for comprehensive comparisons with the proposed method. © 2016 American Institute of Chemical Engineers AIChE J, 62: 2358–2373, 2016     

改进生物地理学优化算法及其在汽油调合调度中的应用

汽油调合和调度优化问题中含有典型的非线性约束(NLP)问题。针对一般智能优化算法在解决此类优化问题中易陷于局部极值,提出了一种改进的生物地理学优化算法(HMBBO)。该算法设计了一种基于种群个体差异信息的启发式变异算子,弥补了Gauss变异、Cauchy变异算子缺乏启发式信息的不足,以解决原算法在局部搜索时易出现的早熟问题,提高算法的全局搜索能力,并且采用非线性物种迁移模型以适应不同的自然环境。采用4个测试函数进行仿真,结果表明:HMBBO算法与标准BBO算法、基于Gauss变异及基于Cauchy变异的BBO算法比较,其收敛速度和全局寻优能力有明显改善。汽油调合和调度优化实例表明,该算法能够快速有效地找到全局最优解。     

A decomposition algorithm for simultaneous scheduling and control of CSP systems

We present a decomposition algorithm to perform simultaneous scheduling and control decisions in concentrated solar power (CSP) systems. Our algorithm is motivated by the need to determine optimal market participation strategies at multiple timescales. The decomposition scheme uses physical insights to create surrogate linear models that are embedded within a mixed‐integer linear scheduling layer to perform discrete (operational mode) decisions. The schedules are then validated for physical feasibility in a dynamic optimization layer that uses a continuous full‐resolution CSP model. The dynamic optimization layer updates the physical variables of the surrogate models to refine schedules. We demonstrate that performing this procedure recursively provides high‐quality solutions of the simultaneous scheduling and control problem. We exploit these capabilities to analyze different market participation strategies and to explore the influence of key design variables on revenue. Our results also indicate that using scheduling algorithms that neglect detailed dynamics significantly decreases market revenues. © 2018 American Institute of Chemical Engineers AIChE J, 64: 2408–2417, 2018