There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
Abstract. We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to mul...
Abstract. They appeared in our life some years ago with the awakening of the PC and now the are everywhere : computers have become ubiquitous and, almost, irreplaceable. Classical ...
Ant colony optimisation is a constructive metaheuristic that successively builds solutions from problem-specific components. A parameterised model known as pheromone--an analogue o...
Abstract. In this paper we present an estimation of distribution particle swarm optimization algorithm that borrows ideas from recent developments in ant colony optimization. In th...