Now showing items 1-10 of 10
Memory-saving memetic computing for path-following mobile robots
Multi-strategy coevolving aging particle optimization
(World Scientific, 2014)
Ockham's Razor in memetic computing: Three stage optimal memetic exploration
Memetic computing is a subject in computer science which considers complex structures as the combination of simple agents, memes, whose evolutionary interactions lead to intelligent structures capable of problem-solving. ...
Composed compact differential evolution
This paper proposes a novel algorithm for solving continuous complex optimization problems with a relatively low memory consumption. The proposed approach, namely Composed compact Differential Evolution, consists of a set ...
Parallel Memetic Structures
Memetic Computing (MC) structures are algorithms composed of heterogeneous operators (memes) for solving optimization problems. In order to address these problems, this study investigates and proposes a simple yet extremely ...
Compact particle swarm optimization
Disturbed exploitation compact differential evolution for limited memory optimization problems
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary ...