A dynamic clustering based differential evolution algorithm for global optimization
From MaRDI portal
Publication:2370329
DOI10.1016/j.ejor.2006.10.053zbMath1128.90049OpenAlexW2164264071MaRDI QIDQ2370329
Yong-Jun Wang, Gai-Ying Zhang, Jiang-She Zhang
Publication date: 25 June 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.053
Related Items
Modified differential evolution with locality induced genetic operators for dynamic optimization, A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem, Evolutionary algorithm-based learning of fuzzy neural networks. II: Recurrent fuzzy neural networks
Cites Work
- Optimization by Simulated Annealing
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions
- Differential evolution with preferential crossover
- Global optimization and simulated annealing
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
- Application of chaos in simulated annealing
- Population set-based global optimization algorithms: some modifications and numerical studies
- A differential free point generation scheme in the differential evolution algorithm
- Improved particle swarm optimization combined with chaos
- A fuzzy adaptive differential evolution algorithm
- Taboo Search: An Approach to the Multiple Minima Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Cluster Analysis Using Seed Points and Density-Determined Hyperspheres as an Aid to Global Optimization
- A hybrid evolutionary programming method for circuit optimization
- Pattern Search Algorithms for Bound Constrained Minimization
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- A continuous genetic algorithm designed for the global optimization of multimodal functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
