A hybrid evolutionary algorithm with importance sampling for multi-dimensional optimization
A hybrid evolutionary algorithm with importance sampling method is proposed for multi-dimensional optimization problems in this paper. In order to make use of the information provided in the search process, a set of visited solutions is selected to give scores for intervals in each dimension, and they are updated as algorithm proceeds. Those intervals with higher scores are regarded as good intervals, which are used to estimate the joint distribution of optimal solutions through an interaction between the pool of good genetics, which are the individuals with smaller fitness values. And the sampling probabilities for good genetics are determined through an interaction between those estimated good intervals. It is a cross validation mechanism which determines the sampling probabilities for good intervals and genetics, and the resulted probabilities are used to design crossover, mutation and other stochastic operators with importance sampling method. As the selection of genetics and intervals is not directly dependent on the values of fitness, the resulted offsprings may avoid the trap of local optima. And a purely random EA is also combined into the proposed algorithm to maintain the diversity of population. 30 benchmark test functions are used to evaluate the performance of the proposed algorithm, and it is found that the proposed hybrid algorithm is an efficient algorithm for multi-dimensional optimization problems considered in this paper.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
EvoSampling: A Granular Ball-based Evolutionary Hybrid Sampling with Knowledge Transfer for Imbalanced Learning
Class imbalance would lead to biased classifiers that favor the majority class and disadvantage the minority class. Unfortunately, from a practical perspective, the minority class is of importance in many real-life appli…
Multi-Task LearningTransfer LearningThe Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization
A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploits the complementary character of the tw…
Evolutionary AlgorithmsMultiobjective OptimizationSOM-Guided Evolutionary Search for Solving MinMax Multiple-TSP
Multiple-TSP, also abbreviated in the literature as mTSP, is an extension of the Traveling Salesman Problem that lies at the core of many variants of the Vehicle Routing problem of great practical importance. The current…
Evolutionary AlgorithmsTraveling Salesman ProblemSolving Linear Equations Using a Jacobi Based Time-Variant Adaptive Hybrid Evolutionary Algorithm
Large set of linear equations, especially for sparse and structured coefficient (matrix) equations, solutions using classical methods become arduous. And evolutionary algorithms have mostly been used to solve various opt…
Evolutionary AlgorithmsEnsemble-Based Annealed Importance Sampling
Sampling from a multimodal distribution is a fundamental and challenging problem in computational science and statistics. Among various approaches proposed for this task, one popular method is Annealed Importance Samplin…