Real-time obstacle avoidance for manipulators and mobile robots
International Journal of Robotics Research
Self-organizing maps
The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Journal of Global Optimization
Evolution Strategy with Neighborhood Attraction Using a Neural Gas Approach
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
JADE: adaptive differential evolution with optional external archive
IEEE Transactions on Evolutionary Computation
Self-organizing potential field network: a new optimization algorithm
IEEE Transactions on Neural Networks
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
IEEE Transactions on Evolutionary Computation
A multiagent genetic algorithm for global numerical optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Constrained motion control using vector potential fields
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Self-organizing nets for optimization
IEEE Transactions on Neural Networks
Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Inspired by the local cooperation behavior in the real world, a new evolutionary algorithm Contour Gradient Optimization algorithm CGO is proposed for solving optimization problems. CGO is a new type of global search algorithm that emulates the cooperation among neighbors. Each individual in CGO evolves in its neighborhood environment to find a better region. Each individual moves with a velocity measured by the field of its nearest individuals. The field includes the attractive forces from its better neighbor in the higher contour level and the repulsive force from its worse neighbor in the lower contour level. Intensive simulations were performed and the results show that CGO is able to solve the tested multimodal optimization problems globally. In this paper, CGO is thoroughly compared with six different widely used optimization algorithms under sixteen different benchmark functions. The comparative analysis shows that CGO is comparatively better than these algorithms in the respect of accuracy and effectiveness.