Niching-Based Feature Selection with Multi-tree Genetic Programming for Dynamic Flexible Job Shop SchedulingFeature selectionFlexible job shop schedulingDynamic schedulingGenetic programmingHyper heuristicsGenetic programming has been explored in recent works to evolve hyper-heuristics for dynamic flexib...
Here we employ the nearest-better clustering basin identification method derived in a previous chapter for setting up two niching evolutionary algorithms. After doing parameter testing, we investigate how these algorithms perform in comparison to other recent methods for the all-global and one-global ...
Toward Fast Niching Evolutionary Algorithms: A Locality Sensitive Hashing-Based Approach YH Zhang,YJ Gong,HX Zhang,... - IEEE 被引量: 0发表: 2017年 Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach Evolutionary algorithms (EAs) are often well-suited ...
The proposed method adopted a Niching-based multiple points sampling method to simultaneously search out the locations of multiple local minima of the EI function, which did not rely on the starting points and avoided converging to the same local minima. Moreover, it would check the neighborhood ...
SOLVING SYSTEMSALGORITHMROOTSSolving nonlinear equation systems (NESs) remains a challenging task in the numerical optimization community due to the multi-root nature of NESs. To locate multiple roots of NESs in a single run, an adaptive dual niching-based differential evolution with resource ...
This paper presents a niching-based evolutionary algorithm for optimizing multi-modal optimization function. Provided that the potential optima are characterized by a relatively smaller objective value than their neighbors and by a relatively large distance from points with smaller objective values, we ...
In this paper, we propose a niching Lin-Kernighan-Helsgaun (LKH) based ant colony system (ACS), named nLKH-ACS, taking advantage of LKH’s ability to solve large-scale TSPs, ACS’s search efficiency, and the niching technique for diversity preservation. Specifically, first, ...
Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the ...
To remedy this drawback, we propose a generic framework of memetic niching-based EA, referred to as MENI-EA. The main features of the framework are: i) the numerical method for a NES is integrated into an EA to obtain highly accurate roots; ii) the niching technique is employed to ...
A niching-based brain storm optimization with two archives (NBSO2A) algorithm is proposed to solve DMMOPs. The two niching methods, i.e. , neighborhood-based speciation (NS), and nearest-better clustering (NBC), are incorporated into a BSO algorithm to generate new solutions. The two ...