Earticle

The joint replenishment problem with deterministic resource restriction is considered. We present a differential evolution (DE) algorithm that uses indirect grouping strategy to solve constrained joint replenishment. The procedure and structure of the DE algorithm is proposed. Extensive computational experiments are performed to compare the performances of the DE algorithm with results of genetic algorithm (GA) and heuristic algorithm CRAND. The experimental results indicate that the DE algorithm performs relative to CRAND and superior to GA.

To solve the slow convergence speed, low precision in later period and tedious parameter setting of differential evolution when applied to complex optimization functions, an improved differential evolution algorithm (dn-DADE) based on dynamic adaptive strategy is proposed. Firstly, the elite solutions of current population are utilized in the new mutation strategy (DE/current-to-dnbest/1) to guide the search direction, and then these optional elite solutions tend to the global optimal solution in the late stage of evolution to balance the diversity of population and convergence speed. Secondly, the adaptive update strategies of scaling factor and crossover factor are designed for control parameter values self-adapting at different search stages, thus improve the stability and robustness of the algorithm. A set of 14 benchmark functions is adopted to test the performance of the proposed algorithm. The results show that dn-DADE algorithm has the advantages of remarkable optimizing ability, higher search precision, faster convergence speed and outperforms several state-of-the-art improved differential evolution algorithms in terms of the main performance indexes.

Differential evolution (DE) algorithms have been extensively and frequently applied to solve optimizationproblems. Theoretical analyses of their properties are important to understand the underlying mechanismsand to develop more efficient algorithms. In this paper, firstly, we introduce an absorbing Markovsequence to model a DE algorithm. Secondly, we propose and prove two theorems that provide sufficientconditions for DE algorithm to guarantee converging to the global optimality region. Finally, we design two DE algorithms that satisfy the preconditions of the two theorems, respectively. The two proposed algorithmsare tested on the CEC2013 benchmark functions, and compared with other existing algorithms.Numerical simulations illustrate the converge, effectiveness and usefulness of the proposed algorithms.

In order to improve the problem of premature convergence and computational efficiency of traditional differential evolution algorithm in solving high-dimensional problems, an improved differential evolution (HMSDE) algorithm based on combing elite synergy strategy, multi-population strategy and dynamic adaptive strategy is proposed in this paper. In the proposed HMSDE algorithm, the population is dynamically divided into multi-populations in order to keep the diversity of the population, elite synergy strategy is used to achieve information exchange among different sub-populations, and dynamic adaptive strategy is used to dynamically control the parameter values of scaling factor and crossover factor in order to improve the stability and robustness of the HMSDE algorithm. In order to test the performance of the HMSDE algorithm, a set of 10 benchmark functions are selected in here. The results show that the HMSDE algorithm takes on remarkable optimized ability, faster convergence speed and higher search accuracy. And the HMSDE algorithm can avoid the premature convergence and outperforms several state-of-the-art performances.

The optimal test sequence design for fault diagnosis is a challenge NP-complete problem. An improved Differential Evolution algorithm with additional inertial weighting item (inertial velocity) is proposed to solve the Optimal Test sequence Problem (OTP) in complicated electronic system. The proposed algorithm called Inertial Velocity Differential Evolution (IVDE) is constructed based on an adaptive differential evolution algorithm. IVDE combined with a new individual fitness function optimizes the test sequence sets with the index of fault isolation rate satisfied in top-down to generate diagnostic decision tree to decrease the test cost and the number of tests used. The simulation results show that IVDE algorithm can cut down the test cost under the satisfied fault isolation rate requirement. Compared with the other algorithm such as PSO (particle swarm optimizer)and GA(genetic algorithm), IVDE can get better solution of the OTP.

DE\BBO is the combination of differential evolution and biogeography based optimization algorithm to get a better optimization algorithm in terms of convergence speed. In DE\BBO, constant crossover rate has been used which sometimes affect the performance of the hybrid algorithm leading to increase in convergence speed. To cope up with this problem, variable crossover rate has been introduced in the hybrid algorithm helping in removing the problem of constant crossover rate. Modified algorithm has been named as DE\BBO\L in which local search mutation and variable crossover rate are used. Testing of BBO, DE\BBO\rand\1 and DE\BBO\L has been performed on different test functions. The results reveal that DE\BBO\L with variable crossover rate is better than DE\BBO with constant crossover rate.

To further improve the performance of artificial bee colony algorithm (ABC), an improved ABC (IABC) algorithm is proposed for global optimization via employing orthogonal initialization method. Furthermore, to balance the exploration and exploitation abilities, a new search mechanism is also designed. The performance of this algorithm is verified by using 27 benchmark functions. And the comparison analyses are given between the proposed algorithm and other nature-inspired algorithms. Numerical results demonstrate that the proposed algorithm outperforms the original ABC algorithm and other algorithms for global optimization problems.

This paper proposes a Modified Differential Evolution (MDE) for solving multi-objective load dispatch (MOLD) problem where transmission power losses are considered. MDE is an improved version of conventional Differential Evolution (CDE) in which the mutation operation of the CDE is improved by using five differential solutions instead of three ones similar to CDE. In the MOLD problem, three cases of dispatch including economic dispatch, emission dispatch and multi-objective dispatch are carried out by considering fuel cost function, emission function and both fuel cost and emission functions. In the third case of dispatch, there is a price penalty factor employed to determine the best compromise solution instead of using Fuzzy-based mechanism similar to other studies. The performance of MDE is verified by testing on two systems with three units and one system with six units. In the two systems, the fuel cost and emission from MDE are compared to those from CDE and other existing meta-heuristic algorithms, and the analysis on the result comparison indicates that the MDE is a promising algorithm for solving the MOLD problem.

Tracking articulated hand motion from visual observations is challenging mainly due to the high dimensionality of the state space. Dense sampling is difficult to be performed in such high-dimensional space, so the traditional particle filtering can’t track articulated motion well. In this paper, we propose a new algorithm by combining differential evolution with a particle filter, to track the articulated motion of a hand from single depth images captured by a Kinect sensor. Through the optimization procedure of differential evolution, the particles are moved to the regions with a high likelihood. Only single depth information is used as the input, so our method is immune to illumination and background changes. The tracking system is developed with OpenSceneGraph (OSG). Experiments based on both synthetic and real image sequences demonstrate that the proposed method is capable of tracking articulated hand motion accurately and robustly.

Heuristic evolutionary optimization algorithms are the solutions to many engineering optimization problems. Differential evolution (DE) is a real stochastic evolutionary parameter optimization in current use.DE does not require more control parameters compared to other evolutionary algorithms. Master Production Scheduling (MPS) is posed as one of multi objective parameter optimization problems and often require an optimal solution for the success of a business organization by balancing demand and supply. This work reviews some of the fundamental theory of differential evolution, the methodology for master production scheduling calculation and most important results. The results available for the existing algorithms are compared with results obtained by the proposed evolutionary algorithm. The analysis reveals that the DE algorithm provides a better solution with reasonable computational time.

DE is a topic of current interest in the optimization field. It is the most capable evolutionary algorithm based on biological theory of evolution because of its ease and competence in solving variety of problems, like multi-objective, multi-modal, dynamic optimization problems. But premature convergence or stagnation is a main problem with it. So In order to improve the performance of DE, significant number of DE variants has been proposed by many researchers over the last few decades. Mutation is one of the key tasks of DE. It appreciably influences the performance of DE. In this paper, DE variants with four different mutation techniques- DE/rand/1, DE/local-to-best, DE/either-or and MODE are studied and implemented. Comparison of DE having these mutation strategies is made for variety of dimension and population size and results shows that DE/local-to-best performs best on all the benchmark functions where as MODE also show significant performance.

DE is a topic of current interest in the optimization field. It is the most capable evolutionary algorithm based on biological theory of evolution because of its ease and competence in solving variety of problems, like multi-objective, multi-modal, dynamic optimization problems. But premature convergence or stagnation is a main problem with it. So In order to improve the performance of DE, significant number of DE variants has been proposed by many researchers over the last few decades. Mutation is one of the key tasks of DE. It appreciably influences the performance of DE. In this paper, DE variants with four different mutation techniques- DE/rand/1, DE/local-to-best, DE/either-or and MODE are studied and implemented. Comparison of DE having these mutation strategies is made for variety of dimension and population size and results shows that DE/local-to-best performs best on all the benchmark functions where as MODE also show significant performance.

In order to improve the weak situation of the global search ability, the stability and time consuming of optimization of differential evolution(DE) algorithm in solving high dimensional optimization problem, an improved differential evolution algorithm with multi- population and multi-strategy(MPMSIDE) is proposed to solve high dimensional optimization problem. Firstly, the different DE mutation strategies are studied. Then the MPMSIDE algorithm divides the population into several sub-populations, which evolve independently and communicate with each other at regular intervals by using different DE strategies, in order to save the computation time. And the improved mutation strategy and local optimization strategy are introduced to raise and balance the global searching ability and local searching ability, and improve the optimization efficiency. The selfadaptive update strategy is used to adjust the scaling factor and crossover factor for making the parameter sensitivity of DE algorithm and improving the stability and robustness. Finally, the proposed MPMSIDE algorithm is applied to standard test function optimization for verifying the effectiveness. The experimental results show that the proposed MPMSIDE algorithm has a relatively better optimization performance for solving complex optimization problem, and takes on remarkable optimizing ability, higher searching accuracy and faster convergence speed.

In order to improve the optimum speed, crease the diversity of the population and overcome the premature convergence problem in differential evolution(DE) algorithm for solving the complex optimization problems, the chaotic optimization algorithm with powerful local searching capacity and multi- strategy are introduced into the DE algorithm in order to propose an improved adaptive differential evolution(COMSIADE) algorithm in solving function optimization problems. In the COMSIADE algorithm, the ergodicity, regularity and internal randomness of the chaotic sequence are used to overcome the shortcoming of premature local optimum to improve the global searching capacity of the DE algorithm. The multi-population with parallel evolution is used to preserve the diversity of the population at the initial generation. The self-adaptive crossover operator probability is used to improve the global convergence ability, the stability and robustness. Finally, in order to test and verify the effectiveness of the COMSIADE algorithm, several benchmark functions are selected in this paper. The experimental results indicate that the proposed COMSIADE algorithm can improve the global searching capacity and avoid falling into local optimum. And it takes on the higher searching precision and faster convergence speed in solving the complex optimization problem.

In order to improve the global searching ability of differential evolution algorithm in solving complex optimization problem, an improved differential evolution (SMDE) algorithm based on the self-adaptive method and multi-population is proposed in this paper. In the proposed SMDE algorithm, the population is divided into multi-populations in order to keep the diversity, then the self-adaptive method is used to control the parameters of differential evolution algorithm in order to balance the local search and global search ability. Finally, several complex benchmark functions are selected to validate the efficiency of the SMDE algorithm. The experiment results show that the proposed SMDE algorithm is better at the global convergence ability and the searching precision.

In this paper we propose a novel differential evolution algorithm based on self-learning, in order to improve the environment adaptive ability of the population in dynamic optimization. The proposed algorithm can monitor the environment changes using re-evaluation of individuals. We direct the population evolution based on the current best individual and another two random individuals, so that the convergence speed is faster and the diversity of the population is maintained. In this way we may reduce the influence from the frequent environment changes. Testing on six dynamic functions, we study the influences caused by period and dimensions. We also compared the proposed algorithm with existing algorithms, the experimental results show that our algorithm has a better environment adaptive ability and achieves better optimization result.

For the shortcomings of differential evolution algorithm(DE), such as the low convergence rate in the late evolution, easy to trap into the local optimal solution, and weak situation of the global search ability and the stability of optimization, an improved differential evolution algorithm based on multi-population and dynamic local search(MPDLSDE) is proposed in this paper. In the MPDLSDE algorithm, different populations select different mutation operation model in order to obtain superiority reciprocity between different models in the process of evolution. And the random selected method and small probability perturbation are used to increase the diversity of population and balance the exploitation ability and exploration ability of the algorithm. Then dynamic local search method is used to solve the current optimal solution in order to speed up the convergence rate. Several well-known benchmark functions are selected to validate the efficiency of the MPDLSDE algorithm. The simulation experiment and comparative analysis results show that the MPDLSDE algorithm can enhance the global convergence ability and get the high accuracy solution in high dimensional complex optimization problems.

A novel hybrid Bat Algorithm (BA) with the Differential Evolution (DE) strategy using the feasibility-based rules, namely BADE is proposed to deal with the constrained optimization problems. The sound interferences induced by other things are inevitable for the bats which rely on the echolocation to detect and localize the things. Through integration of the DE strategy with BA, the insects’ interferences for the bats can be effectively mimicked by BADE. Moreover, the bats swarm’ mean velocity is simulated as the other bats’ effects on each bat. Having considered the living environments the bats inhabit, the virtual bats can be lifelike. Experiments on some benchmark problems and engineering designs demonstrate that BADE performs more efficient, accurate, and robust than the original BA, DE, and some other optimization methods.

In standard group search optimizer (GSO) algorithm, scroungers will converge to the similar position if the producer cannot find a better position than the old one in a number of successive iterations and the group may suffer from the premature convergence. In this paper, a hybrid GSO with differential evolution (DE) operator named DEGSO is proposed to enhance the diversity of standard group search optimizer. In this method, the standard GSO algorithm and the DE operator alternate at the odd iterations and at the even iterations. The results of the experiments indicate that DEGSO is competitive to some other evolutionary computation (EA) algorithms.