生物活性竹炭的制备及其对溶液中喹啉的去除

以自制活性竹炭(Activated Bamboo Charcoal,简称ABC)为基体,负载喹啉降解菌BC027制备了生物活性竹炭(Biological Activated Bamboo Charcoal,简称BABC),并研究了BABC去除目标污染物——喹啉的性能。结果表明:喹啉降解菌可以负载到ABC表面,且生长状态良好。与ABC相比,BABC去除喹啉的过程可分为三个阶段,其中降解期微生物作用明显;BABC去除喹啉的能力和溶液中OD值的大小相关,基体吸附性能仅在吸附期起作用。BABC的处理容量大于ABC,使用寿命长于ABC。     

A discrete artificial bee colony algorithm incorporating differential evolution for the flow-shop scheduling problem with blocking

A flow-shop scheduling problem with blocking has important applications in a variety of industrial systems but is underrepresented in the research literature. In this study, a novel discrete artificial bee colony (ABC) algorithm is presented to solve the above scheduling problem with a makespan criterion by incorporating the ABC with differential evolution (DE). The proposed algorithm (DE-ABC) contains three key operators. One is related to the employed bee operator (i.e. adopting mutation and crossover operators of discrete DE to generate solutions with good quality); the second is concerned with the onlooker bee operator, which modifies the selected solutions using insert or swap operators based on the self-adaptive strategy; and the last is for the local search, that is, the insert-neighbourhood-based local search with a small probability is adopted to improve the algorithm's capability in exploitation. The performance of the proposed DE-ABC algorithm is empirically evaluated by applying it to well-known benchmark problems. The experimental results show that the proposed algorithm is superior to the compared algorithms in minimizing the makespan criterion.     

Chemical process dynamic optimization based on the differential evolution algorithm with an adaptive scheduling mutation strategy

To solve chemical process dynamic optimization problems, a differential evolution algorithm integrated with adaptive scheduling mutation strategy (ASDE) is proposed. According to the evolution feedback information, ASDE, with adaptive control parameters, adopts the round-robin scheduling algorithm to adaptively schedule different mutation strategies. By employing an adaptive mutation strategy and control parameters, the real-time optimal control parameters and mutation strategy are obtained to improve the optimization performance. The performance of ASDE is evaluated using a suite of 14 benchmark functions. The results demonstrate that ASDE performs better than four conventional differential evolution (DE) algorithm variants with different mutation strategies, and that the whole performance of ASDE is equivalent to a self-adaptive DE algorithm variant and better than five conventional DE algorithm variants. Furthermore, ASDE was applied to solve a typical dynamic optimization problem of a chemical process. The obtained results indicate that ASDE is a feasible and competitive optimizer for this kind of problem.     

高斯变异差分进化算法及其应用研究

为平衡算法收敛速度和全局搜索能力,克服差分进化算法易“早熟”的缺陷,在分析引起种群多样性下降及个体进化停滞原因的基础上,通过引入高斯变异操作,提出了基于高斯变异改进的差分进化算法(modified differential evolution base on Gauss mutation, GMDE). 数值仿真及2个工程优化问题的求解结果表明本文算法能有效避免“早熟”收敛,且在算法收敛速度和全局搜索能力上取得了较好的平衡.     

基于离散差分进化算法的随机车辆路径问题

针对差分进化算法求解组合优化问题存在的局限性,引入计算机语言中的2种按位运算符,对差分进化算法的变异算子进行重新设计,用来求解不确定需求和旅行时间下同时取货和送货的随机车辆路径问题（SVRPSPD）。通过对车辆路径问题的benchmark问题和SVRPSPD问题进行路径优化,并同差分进化算法和遗传算法的计算结果进行比较,验证了离散差分进化算法的性能。结果表明,离散差分进化算法在解决复杂的SVRPSPD问题时,具有较好的优化性能,不仅能得到更好的优化结果,而且具有更快的收敛速度。     

Cloud Data Center Selection Using a Modified Differential Evolution

The interest in selecting an appropriate cloud data center is exponentially increasing due to the popularity and continuous growth of the cloud computing sector. Cloud data center selection challenges are compounded by ever-increasing users’ requests and the number of data centers required to execute these requests. Cloud service broker policy defines cloud data center’s selection, which is a case of an NP-hard problem that needs a precise solution for an efficient and superior solution. Differential evolution algorithm is a metaheuristic algorithm characterized by its speed and robustness, and it is well suited for selecting an appropriate cloud data center. This paper presents a modified differential evolution algorithm-based cloud service broker policy for the most appropriate data center selection in the cloud computing environment. The differential evolution algorithm is modified using the proposed new mutation technique ensuring enhanced performance and providing an appropriate selection of data centers. The proposed policy’s superiority in selecting the most suitable data center is evaluated using the CloudAnalyst simulator. The results are compared with the state-of-arts cloud service broker policies.     

A new modified differential evolution algorithm scheme-based linear frequency modulation radar signal de-noising

The main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isolated from noise distortion. The modified method showed significant improvements in performance over traditional de-noising techniques.     

增强差异演化算法及其应用

针对约束优化问题,提出一种适于约束优化的增强差异演化算法(enhanced differential evolution algorithm for constrained optimization, ECDE).在约束处理上采用不可行域与可行域更新规则的方法,避免了传统的惩罚函数方法中对惩罚因子的设置,使算法的实现变得简单.改进了DE算法的变异操作,对选择的3个父代个体进行操作遍历,产生6个候选解,取适应值最优的为变异操作的解,大大改善了算法的稳定性、鲁棒性和搜索性能.通过4个测试函数和1个设计实例仿真,表明所提出的算法具有较快的收敛速度和较好的稳定性和鲁棒性.     

基于微分进化神经网络的模拟电路故障诊断

BP神经网络已在模拟电路故障诊断领域得到广泛应用,但BP神经网络存在训练速度慢且容易陷入局部最优的问题.由此,本文提出了一种基于混合变异策略的微分进化改进算法,描述了利用微分进化改进算法进行神经网络权值训练的过程和方法,并将微分进化神经网络用于模拟电路故障诊断,文中还对微分进化神经网络与BP神经网络进行了比较.实验结果表明,微分进化神经网络的训练时间和训练精度均优于BP神经网络,其在模拟电路故障诊断中的准确度比BP神经网络提高了7%.     

A new improved artificial bee colony algorithm for ship hull form optimization

The artificial bee colony (ABC) algorithm is a relatively new swarm intelligence-based optimization algorithm. Its simplicity of implementation, relatively few parameter settings and promising optimization capability make it widely used in different fields. However, it has problems of slow convergence due to its solution search equation. Here, a new solution search equation based on a combination of the elite solution pool and the block perturbation scheme is proposed to improve the performance of the algorithm. In addition, two different solution search equations are used by employed bees and onlooker bees to balance the exploration and exploitation of the algorithm. The developed algorithm is validated by a set of well-known numerical benchmark functions. It is then applied to optimize two ship hull forms with minimum resistance. The tested results show that the proposed new improved ABC algorithm can outperform the ABC algorithm in most of the tested problems.     

A simulated weed colony system with subregional differential evolution for multimodal optimization

This article proposes a two-stage hybrid multimodal optimizer based on invasive weed optimization (IWO) and differential evolution (DE) algorithms for locating and preserving multiple optima of a real-parameter functional landscape in a single run. Both IWO and DE have been modified from their original forms to meet the demands of the multimodal problems used in this work. A p-best crossover operation is introduced in the subregional DEs to improve their exploitative behaviour. The performance of the proposed algorithm is compared with a number of state-of-the-art multimodal optimization algorithms over a benchmark suite comprising 21 basic multimodal problems and seven composite multimodal problems. Experimental results suggest that the proposed technique is able to provide better and more consistent performance over the existing well-known multimodal algorithms for the majority of test problems without incurring any serious computational burden.     

Improved artificial bee colony algorithm for crack identification in beam using natural frequencies only

An improved artificial bee colony algorithm (I-ABC) is proposed for crack identification in beam structures. ABC is a heuristic algorithm and swarm technique with simple structure, which is easy to implement but with slow convergence rate. In the I-ABC, the differential evolution (DE) mechanism is introduced to employed bee phase, roulette selection strategy is replaced by tournament selection strategy and a new formula is used to simulate onlooker bee’s behaviour. A discrete open crack is used for vibration analysis of the cracked beam and only the changes in the first few natural frequencies are utilized to establish the objective function of the optimization problem for crack identification. A numerical simulation and an experimental work are studied to illustrate the efficiency of the proposed method. Studies show that the present techniques can produce more accurate damage identification results when compared with original ABC, DE algorithm, particle swarm optimization and genetic algorithm.     

Model updating of a rotating machine using the self-adaptive differential evolution algorithm

Despite the good accuracy of finite element (FE) models to represent the dynamic behaviour of mechanical systems, practical applications show significant discrepancies between analytical predictions and experimental results, which are mostly due to uncertainties on the geometry configuration, imprecise material parameters and vague boundary conditions. Thereby, different approaches have been proposed to solve the inverse problems associated with the updating of FE models. Among them, the techniques based on minimization processes have shown to be some of the most promising ones. In this paper, a self-adaptive heuristic optimization method, namely the self-adaptive differential evolution (SADE), is evaluated. Differently from the canonical differential evolution (DE) algorithm, the SADE strategy is able to update dynamically the required parameters such as population size, crossover parameter and perturbation rate. This is done by considering a defined convergence rate on the evolution process of the algorithm in order to reduce the number of evaluations of the objective function. For illustration purposes, the SADE strategy is applied to the solution of typical mathematical functions. Additionally, the strategy is equally used to update the FE model of a rotating machine composed by a horizontal flexible shaft, two rigid discs and two unsymmetrical bearings. For comparison purposes, the canonical DE is also used. The results indicate that the SADE algorithm is a recommended technique for dealing with this kind of inverse problem.     

Modified differential evolution algorithm for simple assembly line balancing with a limit on the number of machine types

This article proposes the differential evolution algorithm (DE) and the modified differential evolution algorithm (DE-C) to solve a simple assembly line balancing problem type 1 (SALBP-1) and SALBP-1 when the maximum number of machine types in a workstation is considered (SALBP-1M). The proposed algorithms are tested and compared with existing effective heuristics using various sets of test instances found in the literature. The computational results show that the proposed heuristics is one of the best methods, compared with the other approaches.     

Two enhanced differential evolution algorithms for job shop scheduling problems

This paper proposes two new differential evolution algorithms (DE) for solving the job shop scheduling problem (JSP) that minimises two single objective functions: makespan and total weighted tardiness. The proposed algorithms aim to enhance the efficiency of the search by dynamically balancing exploration and exploitation ability in DE and avoiding the problem of premature convergence. The first algorithm allows DE population to simultaneously perform different mutation strategies in order to extract the strengths of various strategies and compensate for the weaknesses of each individual strategy to enhance the overall performance. The second algorithm allows the whole DE population to change the search behaviour whenever the solutions do not improve. This study also introduces a modified local mutation operation embedded in the two proposed DE algorithms to promote exploitation in different areas of the search space. In addition, a local search technique, called Critical Block (CB) neighbourhood, is applied to enhance the quality of solutions. The performances of the proposed algorithms are evaluated on a set of benchmark problems and compared with results obtained from an efficient existing Particle Swarm Optimisation (PSO) algorithm. The numerical results demonstrate that the proposed DE algorithms yield promising results while using shorter computing times and fewer numbers of function evaluations.     

A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems

Job shop scheduling problem (JSSP) is a typical NP-hard problem. In order to improve the solving efficiency for JSSP, a hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search is proposed in this paper, which combines the merits of Estimation of distribution algorithm and Differential evolution (DE). Meanwhile, to strengthen the searching ability of the proposed algorithm, a chaotic strategy is introduced to update the parameters of DE. Two mutation operators are adopted. A neighbourhood search (NS) algorithm based on blocks on critical path is used to further improve the solution quality. Finally, the parametric sensitivity of the proposed algorithm has been analysed based on the Taguchi method of design of experiment. The proposed algorithm was tested through a set of typical benchmark problems of JSSP. The results demonstrated the effectiveness of the proposed algorithm for solving JSSP.     

A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion

In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable parameter search (vpsDE) is developed to be compared to a well-known random key genetic algorithm (RKGA) from the literature. The motivation is due to the fact that a continuous DE can be very competitive for the problems where RKGAs are well suited. As an application area, we choose the NIPFS problem with the total tardiness criterion in which there is no literature on it to the best of our knowledge. The NIPFS problem is a variant of the well-known permutation flowshop (PFSP) scheduling problem where idle time is not allowed on machines. In other words, the start time of processing the first job on a given machine must be delayed in order to satisfy the no-idle constraint. The paper presents the following contributions. First of all, a continuous optimisation algorithm is used to solve a combinatorial optimisation problem where some efficient methods of converting a continuous vector to a discrete job permutation and vice versa are presented. These methods are not problem specific and can be employed in any continuous algorithm to tackle the permutation type of optimisation problems. Secondly, a variable parameter search is introduced for the differential evolution algorithm which significantly accelerates the search process for global optimisation and enhances the solution quality. Thirdly, some novel ways of calculating the total tardiness from makespan are introduced for the NIPFS problem. The performance of vpsDE is evaluated against a well-known RKGA from the literature. The computational results show its highly competitive performance when compared to RKGA. It is shown in this paper that the vpsDE performs better than the RKGA, thus providing an alternative solution approach to the literature that the RKGA can be well suited.     

基于差分进化的时变信道最大似然估计算法

研究了隧道环境下的通信信道估计。针对隧道环境的地铁列车与轨旁设备之间无线通信中无线传输信道快速变化的特点,提出了一种采用元胞差分进化(DE)方法实时获取时变信道的有效信道长度的新型最大似然(ML)信道估计算法——DE-ML算法。仿真结果表明该算法在使用较少导频信息的情况下,通过差分进化方法有效估计跟踪有效信道长度,其估计性能优于最小二乘(LS)、线性最小均方误差(LMMSE)、传统ML等经典信道估计算法。该算法能在提高系统传输效率的同时显著提高算法的估计精度,尤其在高速移动情况下也具有了非常良好的性能。     

Multiple trial vectors in differential evolution for engineering design

This article presents a modified version of the differential evolution algorithm to solve engineering design problems. The aim is to allow each parent vector in the population to generate more than one trial (child) vector at each generation and therefore to increase its probability of generating a better one. To deal with constraints, some criteria based on feasibility and a diversity mechanism to maintain infeasible solutions in the population are used. The approach is tested on a set of well-known benchmark problems. After that, it is used to solve engineering design problems and its performance is compared with those provided by typical penalty function approaches and also against state-of-the-art techniques.     

A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints

A production scheduling problem originating from a real rotor workshop is addressed in the paper. Given its specific characteristics, the problem is formulated as a re-entrant hybrid flow shop scheduling problem with machine eligibility constraints. A mixed integer linear programming model of the problem is provided and solved by the Cplex solver. In order to solve larger sized problems, a discrete differential evolution (DDE) algorithm with a modified crossover operator is proposed. More importantly, a new decoder addressing the machine eligibility constraints is developed and embedded to the algorithm. To validate the performance of the proposed DDE algorithm, various test problems are examined. The efficiency of the proposed algorithm is compared with two other algorithms modified from the existing ones in the literatures. A one-way ANOVA analysis and a sensitivity analysis are applied to intensify the superiority of the new decoder. Tightness of due dates and different levels of scarcity of machines subject to machine eligibility restrictions are discussed in the sensitivity analysis. The results indicate the pre-eminence of the new decoder and the proposed DDE algorithm.