A Differential Evolution Algorithm With Adaptive Niching and K-Means Operation for Data Clustering | IEEE Journals & Magazine | IEEE Xplore PSO-based K-Means clustering with enhanced cluster matching for gene expression data | SpringerLink
differential evolutionresonance frequenciesscattered signalSummary: This paper presents a differential evolution algorithm in order to find unique resonance frequencies of an electromagnetic target in the resonance scattering region. These frequencies are estimated from the roots of Laplace transform of a ...
Section II briefly reviews the differential evolution algorithm, then describes the definition and constraints of the three-dimensional packing problem and the expression of a feasible solution to the packing problem. The ternary tree model and its steps for solving the 3D-CLP are presented in this...
In this paper, a Bilevel Differential Evolution (BiDE) algorithm to solve a FAL scheduling problem is proposed. The BiDE algorithm optimizes the performance of the FAL with respect to two criteria: the weighted sum of Earliness/Tardiness (E/T) penalties and the balance of the FAL. The ...
The differential evolution (DE) algorithm is a notably powerful evolutionary algorithm that has been applied in many areas. Therefore, the question of how to improve the algorithm's performance has attracted considerable attention from researchers. The mutation operator largely impacts the performance of...
关键词: Power Generation Workload Optimization Memetic Algorithm Differential Evolution Local Search 会议名称: 11th International Conference on Hybrid Intelligent Systems, HIS 2011, Melacca, Malaysia, December 5-8, 2011 会议时间: 05 January 2012 主办单位: IEEE ...
(2022). PAIDDE: A permutation-archive information directed differential evolution algorithm.IEEE Access,10, 50384-50402. [9]ZHANG, B., YANG, H., ZHENG, T., WANG, R. L., & GAO, S. (2023). A Non-Revisiting Equilibrium Optimizer Algorithm.IEICE Transactions on Information and Systems,106...
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. F... M.,Fatih,Tasgetiren,... -...
Therefore, a one-pixel adversarial perturbations generation method based on a differential evolution algorithm is proposed. The attack only needs the classification probability label output by the model and does not need internal information such as the network structure of the model, so this method ...
Line-up competition Differential Evolution algorithm for the GAP is proposed. The algorithm uses integer-coding structure, and introduces the idea of line-up competition. The experimental results indicates that, compared with other algorithms, this algorithm has the characteristics of quick convergence ...