Combinations of Estimation of Distribution Algorithms and Other Techniques

This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search.

Archimedean copula estimation of distribution algorithm based on artificial bee colony algorithm

The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.

An improved estimation of distribution algorithm for multi-compartment electric vehicle routing problem

The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process,are employed.A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost,distribution cost,time window penalty cost and charging service cost.To solve the problem,an estimation of the distribution algorithm based on Lévy flight(EDA-LF)is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum.Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm.In addition,when comparing with existing algorithms,the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances.Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

Gaussian process assisted coevolutionary estimation of distribution algorithm for computationally expensive problems

In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.

Estimation of Distribution Algorithm with Multivariate <i>T</i>-Copulas for Multi-Objective Optimization

Estimation of distribution algorithms are a class of evolutionary optimization algorithms based on probability distribution model. In this article, a Pareto-based multi-objective estimation of distribution algorithm with multivariate T-copulas is proposed. The algorithm employs Pareto-based approach and multivariate T-copulas to construct probability distribution model. To estimate joint distribution of the selected solutions, the correlation matrix of T-copula is firstly estimated by estimating Kendall’s tau and using the relationship of Kendall’s tau and correlation matrix. After the correlation matrix is estimated, the degree of freedom of T-copula is estimated by using the maximum likelihood method. Afterwards, the Monte Carte simulation is used to generate new individuals. An archive with maximum capacity is used to maintain the non-dominated solutions. The Pareto optimal solutions are selected from the archive on the basis of the diversity of the solutions, and the crowding-distance measure is used for the diversity measurement. The archive gets updated with the inclusion of the non-dominated solutions from the combined population and current archive, and the archive which exceeds the maximum capacity is cut using the diversity consideration. The proposed algorithm is applied to some well-known benchmark. The relative experimental results show that the algorithm has better performance and is effective.

Improved Estimation of Distribution Algorithm for Solving Unrelated Parallel Machine Scheduling Problem

Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively.

An effective estimation of distribution algorithm for parallel litho machine scheduling with reticle constraints

In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.

A unified Minorization-Maximization approach for estimation of general mixture models

The mixed distribution model is often used to extract information from heteroge-neous data and perform modeling analysis.When the density function of mixed distribution is complicated or the variable dimension is high,it usually brings challenges to the parameter es-timation of the mixed distribution model.The application of MM algorithm can avoid complex expectation calculations,and can also solve the problem of high-dimensional optimization by decomposing the objective function.In this paper,MM algorithm is applied to the parameter estimation problem of mixed distribution model.The method of assembly and decomposition is used to construct the substitute function with separable parameters,which avoids the problems of complex expectation calculations and the inversion of high-dimensional matrices.

2-D distributed pose estimation of multi-agent systems using bearing measurements

This article studies distributed pose(orientation and position)estimation of leader–follower multi-agent systems over𝜅-layer graphs in 2-D plane.Only the leaders have access to their orientations and positions,while the followers can measure the relative bearings or(angular and linear)velocities in their unknown local coordinate frames.For the orientation estimation,the local relative bearings are used to obtain the relative orientations among the agents,based on which a distributed orientation estimation algorithm is proposed for each follower to estimate its orientation.For the position estimation,the local relative bearings are used to obtain the position constraints among the agents,and a distributed position estimation algorithm is proposed for each follower to estimate its position by solving its position constraints.Both the orientation and position estimation errors converge to zero asymptotically.A simulation example is given to verify the theoretical results.

Optimization by Estimation of Distribution with DEUM Framework Based on Markov Random Fields

This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields （DEUM）. DEUM is a subclass of estimation of distribution algorithms （EDAs） where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are： 1） use of MRF models, 2） fitness modeling approach to estimating the parameter of the model and 3） Monte Carlo approach to sampling from the model.

Dynamic threshold for SPWVD parameter estimation based on Otsu algorithm

Time-frequency-based methods are proven to be effective for parameter estimation of linear frequency modulation （LFM） signals. The smoothed pseudo Winger-Ville distribution （SPWVD） is used for the parameter estimation of multi-LFM signals, and a method of the SPWVD binarization by a dynamic threshold based on the Otsu algorithm is proposed. The proposed method is effective in the demand for the estimation of different parameters and the unknown signal-to-noise ratio （SNR） circumstance. The performance of this method is confirmed by numerical simulation.

State simulation of water distribution networks based on DFP algorithm

The improved weighted-least-square model was used for state simulation of water distribution networks. And DFP algorithm was applied to get the model solution. In order to fit DFP algorithm,the initial model was transformed into a non-constrained optimization problem using mass conservation. Then,through one dimensional optimization and scale matrix establishment,the feasible direction of iteration was obtained,and the values of state variables could be calculated. After several iterations,the optimal estimates of state variables were worked out and state simulation of water distribution networks was achieved as a result. A program of DFP algorithm is developed with Delphi 7 for verification. By running on a designed network,which is composed of 55 nodes,94 pipes and 40 loops,it is proved that DFP algorithm can quickly get the convergence. After 36 iterations,the root mean square of all nodal head errors is reduced by 90.84% from 5.57 to 0.51 m,and the maximum error is only 1.30 m. Compared to Marquardt algorithm,the procedure of DFP algorithm is more stable,and the initial values have less influences on calculation accuracy. Therefore,DFP algorithm can be used for real-time simulation of water distribution networks.

Statistical Inference for the Parameter of Rayleigh Distribution Based on Progressively Type-I Interval Censored Sample

In this paper, the estimation of parameters based on a progressively type-I interval censored sample from a Rayleigh distribution is studied. Different methods of estimation are discussed. They include mid-point approximation estima- tor, the maximum likelihood estimator, moment estimator, Bayes estimator, sampling adjustment moment estimator, sampling adjustment maximum likelihood estimator and estimator based on percentile. The estimation procedures are discussed in details and compared via Monte Carlo simulations in terms of their biases.

Adaptive Multisensor Tracking Fusion Algorithm for Air－borne Distributed Passive Sensor Network

Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new error analysis method for two passive sensor tracking system is presented and the error equations are deduced in detail. Based on the equations, we carry out theoretical computation and Monte Carlo computer simulation. The results show the correctness of our error computation equations. With the error equations, we present multiple 'two station'fusion algorithm using adaptive pseudo measurement equations. This greatly enhances the tracking performance and makes the algorithm convergent very fast and not sensitive to initial conditions.Simulation results prove the correctness of our new algorithm.

Simulation on an optimal combustion control strategy for 3-D temperature distributions in tangentially pc-fired utility boiler furnaces

The control of 3-D temperature distribution in a utility boiler furnace is essential for the safe, economic and clean operation of pc-fired furnace with multi-burner system. The development of the visualization of 3-D temperature distributions in pc-fired furnaces makes it possible for a new combustion control strategy directly with the furnace temperature as its goal to improve the control quality for the combustion processes. Studied in this paper is such a new strategy that the whole furnace is divided into several parts in the vertical direction, and the average temperature and its bias from the center in every cross section can be extracted from the visualization results of the 3-D temperature distributions. In the simulation stage, a computational fluid dynamics(CFD) code served to calculate the 3-D temperature distributions in a furnace, then a linear model was set up to relate the features of the temperature distributions with the input of the combustion processes, such as the flow rates of fuel and air fed into the furnaces through all the burners. The adaptive genetic algorithm was adopted to find the optimal combination of the whole input parameters which ensure to form an optimal 3-D temperature field in the furnace desired for the operation of boiler. Simulation results showed that the strategy could soon find the factors making the temperature distribution apart from the optimal state and give correct adjusting suggestions.

Inference and Properties of Mixture Two Extreme Lower Bound Distributions

In this paper, we discuss the mixture model of two extreme lower bound distributions. First, some properties we obtain of the model with hazard function are discussed. In addition, the estimates of the unknown parameters via the EM algorithm are obtained. The performance of the findings in the paper is showed by demonstrating some numerical illustrations through Monte Carlo simulation.

Distributed computations for large-scale networked systems using belief propagation

This paper introduces several related distributed algorithms,generalised from the celebrated belief propagation algorithm for statistical learning.These algorithms are suitable for a class of computational problems in largescale networked systems,ranging from average consensus,sensor fusion,distributed estimation,distributed optimisation,distributed control,and distributed learning.By expressing the underlying computational problem as a sparse linear system,each algorithm operates at each node of the network graph and computes iteratively the desired solution.The behaviours of these algorithms are discussed in terms of the network graph topology and parameters of the corresponding computational problem.A number of examples are presented to illustrate their applications.Also introduced is a message-passing algorithm for distributed convex optimisation.

Histogram-Based Estimation of Distribution Algorithm:A Competent Method for Continuous Optimization

Designing efficient estimation of distribution algorithms for optimizing complex continuous problems is still a challenging task. This paper utilizes histogram probabilistic model to describe the distribution of population and to generate promising solutions. The advantage of histogram model, its intrinsic multimodality, makes it proper to describe the solution distribution of complex and multimodal continuous problems. To make histogram model more efficiently explore and exploit the search space, several strategies are brought into the algorithms： the surrounding effect reduces the population size in estimating the model with a certain number of the bins and the shrinking strategy guarantees the accuracy of optimal solutions. Furthermore, this paper shows that histogram-based EDA （Estimation of distribution algorithm） can give comparable or even much better performance than those predominant EDAs based on Gaussian models.

Estimation of distribution algorithm enhanced particle swarm optimization for water distribution network optimization

The optimization of a water distribution network （WDN） is a highly nonlinear, multi-modal, and constrained combinatorial problem. Particle swarm opti- mization （PSO） has been shown to be a fast converging algorithm for WDN optimization. An improved estimation of distribution algorithm （EDA） using historic best positions to construct a sample space is hybridized with PSO both in sequential and in parallel to improve population diversity control and avoid premature conver- gence. Two water distribution network benchmark exam- ples from the literature are adopted to evaluate the performance of the proposed hybrid algorithms. The experimental results indicate that the proposed algorithms achieved the literature record minimum （6.081 MS） for the small size Hanoi network. For the large size Balerma network, the parallel hybrid achieved a slightly lower minimum （1.921M） than the current literature reported best minimum （1.923MC）. The average number of evaluations needed to achieve the minimum is one order smaller than most existing algorithms. With a fixed, small number of evaluations, the sequential hybrid outperforms the parallel hybrid showing its capability for fast convergence. The fitness and diversity of the populations were tracked for the proposed algorithms. The track record suggests that constructing an EDA sample space with historic best positions can improve diversity control significantly. Parallel hybridization also helps to improve diversity control yet its effect is relatively less significant.