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

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

基于状态设备网络的改进间歇生产调度模型

建立有效的间歇生产调度模型一直是生产调度问题研究的热点,基于特定事件点的连续时间建模方法是优化短期间歇生产调度问题的有效工具。基于状态设备网络和特定事件点概念,建立非线性的连续时间间歇生产调度模型。为了解决非线性引起的求解困难,该模型使用替代方法线性化模型中的双线性项,替代法不仅将建立的混合整数非线性规划模型转化为混合整数线性规划模型,且由于其不包含大M松弛项,能使模型搜索空间更紧凑,模型求解效率更高。通过3个实例对比实验表明了基于状态设备网络描述的改进间歇生产调度模型搜索高效性。另外,模型中还给出了不同存储条件下,基于状态设备网络描述的间歇生产调度模型约束,扩展了模型适用性。     

基于状态设备网络的改进间歇生产调度模型

建立有效的间歇生产调度模型一直是生产调度问题研究的热点,基于特定事件点的连续时间建模方法是优化短期间歇生产调度问题的有效工具。基于状态设备网络和特定事件点概念,建立非线性的连续时间间歇生产调度模型。为了解决非线性引起的求解困难,该模型使用替代方法线性化模型中的双线性项,替代法不仅将建立的混合整数非线性规划模型转化为混合整数线性规划模型,且由于其不包含大M松弛项,能使模型搜索空间更紧凑,模型求解效率更高。通过3个实例对比实验表明了基于状态设备网络描述的改进间歇生产调度模型搜索高效性。另外,模型中还给出了不同存储条件下,基于状态设备网络描述的间歇生产调度模型约束,扩展了模型适用性。     

改进生物地理学算法对正丁烷异构反应模型的优化

针对生物地理学优化（biogeography-based optimization,BBO）算法在寻优过程中容易陷入早熟的现象,提出了一种基于三维变异的生物地理学优化（three-dimensional variation biogeography-based optimization,Tdv-BBO）算法。该算法是在BBO算法的基础上,引入了三维变量的变异,解决了BBO算法后期搜索动力不足的问题,加快了BBO算法的寻优速度。同时,提出将改进的Tdv-BBO算法应用到正丁烷异构反应动力学模型的优化中,对反应动力学模型的参数进行了优化和整定。仿真实验表明：改进的Tdv-BBO算法提高了个体种群的多样性,增强了算法的搜索能力,加快了寻优速度。用该方法优化得到的反应动力学模型,模型精度较高,泛化能力强;可为正丁烷异构反应的建模提供一种有效的方法。     

改进生物地理学算法对正丁烷异构反应模型的优化

针对生物地理学优化(biogeography-based optimization,BBO)算法在寻优过程中容易陷入早熟的现象,提出了一种基于三维变异的生物地理学优化(three-dimensional variation biogeography-based optimization,Tdv-BBO)算法。该算法是在BBO算法的基础上,引入了三维变量的变异,解决了BBO算法后期搜索动力不足的问题,加快了BBO算法的寻优速度。同时,提出将改进的Tdv-BBO算法应用到正丁烷异构反应动力学模型的优化中,对反应动力学模型的参数进行了优化和整定。仿真实验表明:改进的Tdv-BBO算法提高了个体种群的多样性,增强了算法的搜索能力,加快了寻优速度。用该方法优化得到的反应动力学模型,模型精度较高,泛化能力强;可为正丁烷异构反应的建模提供一种有效的方法。     

一种求解过程动态优化问题的生物地理学习粒子群算法

智能优化算法具有适用性广泛、全局搜索能力强等优点,近年来在动态优化中的应用逐渐增多。通过混合生物地理优化与粒子群优化,提出了生物地理学习粒子群（biogeography-based learning particle swarm optimization,BLPSO）算法,并用于动态优化问题的求解。BLPSO采用了新型的生物地理学习方式,该方式根据粒子“排名”,即粒子的优劣,以维度为单位构造学习粒子,提高了学习的效率。针对动态优化问题,首先通过控制向量参数化将其转化为非线性规划问题,然后采用BLPSO算法进行求解。最后,将BLPSO应用于非可微、多峰、多变量等典型动态优化问题的求解,计算结果表明BLPSO具有较好的搜索精度和收敛速度。     

一种求解过程动态优化问题的生物地理学习粒子群算法

智能优化算法具有适用性广泛、全局搜索能力强等优点,近年来在动态优化中的应用逐渐增多。通过混合生物地理优化与粒子群优化,提出了生物地理学习粒子群(biogeography-based learning particle swarm optimization,BLPSO)算法,并用于动态优化问题的求解。BLPSO采用了新型的生物地理学习方式,该方式根据粒子"排名",即粒子的优劣,以维度为单位构造学习粒子,提高了学习的效率。针对动态优化问题,首先通过控制向量参数化将其转化为非线性规划问题,然后采用BLPSO算法进行求解。最后,将BLPSO应用于非可微、多峰、多变量等典型动态优化问题的求解,计算结果表明BLPSO具有较好的搜索精度和收敛速度。     

基于约束规划的无等待混合流水车间调度问题研究

针对k-阶段等速机无等待混合流水车间最小化最大完工期的调度问题,提出基于约束规划的模型和求解策略.模型利用约束规划自然地表达问题的优化目标和约束条件.求解策略包括采用有限深度偏离搜索例程、采用限定失败次数策略、综合运用离散资源、一元资源和替代资源约束表达工件在各阶段对设备要求等.通过数值实验验证了约束规划方法的有效性.整个方法能够很好地满足实际应用中对计算效率和效果的要求.     

基于局部搜索策略的混合算法同步综合换热网络

针对复杂换热网络混合整数非线性问题,提出了一种由混沌蚁群算法、局部搜索策略和结构进化策略组成的混合算法,同步综合换热网络。首先采用混沌蚁群算法初步优化换热网络,蚂蚁个体根据混沌搜索机制遍历整个求解域。随后引入Powell法作为局部搜索策略,加强蚂蚁个体的局部搜索能力。最后结合结构进化策略,限制算法的搜索空间,优化蚂蚁个体表示的换热网络结构,并将优化后的信息反馈。蚂蚁会根据自身、邻居和反馈的信息作进一步搜索,直到算法收敛于全局最优解。通过算例对算法进行验证,结果表明,混沌搜索机制使混合算法具有很好的全局搜索能力;Powell法加强了算法的局部搜索能力,提高了求解精度;结构进化策略能够有效地缩减搜索区间,提高搜索效率。所以混合算法能够很好地兼顾处理连续变量和整型变量,适用于换热网络综合。     

改进的差分进化算法及在聚丙烯牌号切换优化中的应用

针对差分进化算法早熟问题,提出一种改进差分进化算法,采用动态缩放因子解决优化过程中的变量约束问题,在进化过程中自动地调整控制参数取值以保证变量约束条件;引入聚集度作为参数评估种群分布的密集程度,增加一种新的变异算子在进化过程中根据聚集度情况对部分个体进行后续变异操作,适时调整种群分布,提高种群多样性,增强全局搜索能力。建立了聚丙烯牌号切换优化模型并将改进的差分进化算法应用于牌号切换优化模型的求解,仿真实验结果表明改进的差分进化算法在全局搜索能力和搜索效率两个方面有较大提高。     

Multi-objective modeling and optimization for scheduling of cracking furnace systems

Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usual y run in parallel. The scheduling of the entire cracking furnace system has great significance when multiple feeds are simultaneously processed in multiple cracking furnaces with the changing of operating cost and yield of product. In this paper, given the requirements of both profit and energy saving in actual production process, a multi-objective optimization model contains two objectives, maximizing the average benefits and minimizing the average coking amount was proposed. The model can be abstracted as a multi-objective mixed integer non-linear programming problem. Considering the mixed integer decision variables of this multi-objective problem, an improved hybrid encoding non-dominated sorting genetic algorithm with mixed discrete variables (MDNSGA-I ) is used to solve the Pareto optimal front of this model, the algorithm adopted crossover and muta-tion strategy with multi-operators, which overcomes the deficiency that normal genetic algorithm cannot handle the optimization problem with mixed variables. Finally, using an ethylene plant with multiple cracking furnaces as an example to illustrate the effectiveness of the scheduling results by comparing the optimization results of multi-objective and single objective model.     

Multiobjective evolutionary optimization of batch process scheduling under environmental and economic concerns

The simultaneous consideration of economic and environmental objectives in batch production scheduling is today a subject of major concern. However, it constitutes a complex problem whose solution necessarily entails production trade‐offs. Unfortunately, a rigorous multiobjective optimization approach to solve this kind of problem often implies high computational effort and time, which seriously undermine its applicability to day‐to‐day operation in industrial practice. Hence, this work presents a hybrid optimization strategy based on rigorous local search and genetic algorithm to efficiently deal with industrial scale batch scheduling problems. Thus, a deeper insight into the combined environmental and economic issues when considering the trade‐offs of adopting a particular schedule is provided. The proposed methodology is applied to a case study concerning a multiproduct acrylic fiber production plant, where product changeovers influence the problem results. The proposed strategy stands for a marked improvement in effectively incorporating multiobjective optimization in short‐term plant operation. © 2012 American Institute of Chemical Engineers AIChE J, 59: 429–444, 2013     

A THRESHOLD-ACCEPTING METAHEURISTIC METHOD FOR SCHEDULING THE OPERATIONS OF DEHYDRATION PLANTS

Dehydration plants are broadly characterized by a multi-product nature chiefly attributed to the utilization of different raw materials to be processed sequentially so that demand constraints are met. Processing of raw materials is implemented through a series of preprocessing operations that together with drying constitute the production procedure of a pre-specified programme. The core of the manufacturing system that a typical dehydration plant involves, is scheduling of operations so that demand is fulfilled within a pre-determined time horizon imposed by production planning. The typical scheduling operation that dehydration plants involve can be formulated as a general job shop scheduling problem. The aim of this study is to describe a new metaheuristic method for solving the job shop scheduling problem of dehydration plants, termed as the Backtracking Adaptive Threshold Accepting (BATA) method. Our effort focuses on developing an innovative method, which produces reliable and high quality solutions, requiring reasonable computing effort. The main innovation of this method, towards a typical threshold accepting algorithm, is that during the optimization process the value of the threshold is not only lowered, but also raised or backtracked according to how effective a local search is. BATA is described in detail while a characteristic job shop scheduling case study for dehydration plant operations is presented.     

A THRESHOLD-ACCEPTING METAHEURISTIC METHOD FOR SCHEDULING THE OPERATIONS OF DEHYDRATION PLANTS

ABSTRACT

Dehydration plants are broadly characterized by a multi-product nature chiefly attributed to the utilization of different raw materials to be processed sequentially so that demand constraints are met. Processing of raw materials is implemented through a series of preprocessing operations that together with drying constitute the production procedure of a pre-specified programme. The core of the manufacturing system that a typical dehydration plant involves, is scheduling of operations so that demand is fulfilled within a pre-determined time horizon imposed by production planning. The typical scheduling operation that dehydration plants involve can be formulated as a general job shop scheduling problem. The aim of this study is to describe a new metaheuristic method for solving the job shop scheduling problem of dehydration plants, termed as the Backtracking Adaptive Threshold Accepting (BATA) method. Our effort focuses on developing an innovative method, which produces reliable and high quality solutions, requiring reasonable computing effort. The main innovation of this method, towards a typical threshold accepting algorithm, is that during the optimization process the value of the threshold is not only lowered, but also raised or backtracked according to how effective a local search is. BATA is described in detail while a characteristic job shop scheduling case study for dehydration plant operations is presented.     

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

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.     

ENVIRONMENTALLY CONSCIOUS HOIST SCHEDULING FOR ELECTROPLATING FACILITIES

Hoist scheduling in electroplating operations has long been considered a key factor for improving the production rate. It has recently been recognized that hoist scheduling can also play an important role in waste minimization. In this work, a new hoist scheduling method is introduced for simultaneously achieving both the economic and environmental goals. A two-step dynamic optimization algorithm is introduced for identifying an optimal hoist schedule that can minimize the quantity and toxicity of wastewater streams from an electroplating line without loss of production rate. To improve computational efficiency, an engineering approach is adopted to reduce the number of binary decision variables in the optimization problem. An application to an actual electroplating process shows a significant reduction of both chemical and water consumption, which equates to a simultaneous realization of wastewater reduction and increase of profits.     

ENVIRONMENTALLY CONSCIOUS HOIST SCHEDULING FOR ELECTROPLATING FACILITIES

Hoist scheduling in electroplating operations has long been considered a key factor for improving the production rate. It has recently been recognized that hoist scheduling can also play an important role in waste minimization. In this work, a new hoist scheduling method is introduced for simultaneously achieving both the economic and environmental goals. A two-step dynamic optimization algorithm is introduced for identifying an optimal hoist schedule that can minimize the quantity and toxicity of wastewater streams from an electroplating line without loss of production rate. To improve computational efficiency, an engineering approach is adopted to reduce the number of binary decision variables in the optimization problem. An application to an actual electroplating process shows a significant reduction of both chemical and water consumption, which equates to a simultaneous realization of wastewater reduction and increase of profits.     

基于微粒群优化算法的不确定性调和调度

Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimization problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization （PSO） algorithm is developed for nonlinear optimization problems with both continuous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.     

一类流水车间调度问题的合作博弈

对多个客户参与的一类流水车间调度问题,研究客户之间以合作的方式建立联盟,通过加工任务重新排序节省生产成本。一般流水车间调度合作博弈是受限制的,提出一类加工时间和工序相关的流水车间调度问题,相应的合作博弈是平衡的,因而具有非空核。从合作博弈理论出发,以优化多客户线性成本为指标,构建了加工时间和工序相关的流水车间调度合作博弈模型。在获得最优调度排列后,提出了一种加权前后边际成本的客户成本分配的方法,证明了该分配方法是加工时间和工序相关的流水车间调度合作博弈的一个核分配。最后通过一个实例对所提出的基于合作博弈的加工时间和工序相关流水车间调度模型及成本分配方法进行了验证。     

具有零等待的flow shop问题的免疫调度算法

针对间歇过程中存在的具有零等待的flowshop调度问题,建立了相应的数学模型,并结合免疫算法的特点,提出一种新的解决此类问题的免疫调度算法。通过仿真试验,证明了算法的有效性。