Particle swarm optimization with two swarms for the discrete (r|p)-centroid problem

Authors:
Clara Campos-Rodríguez;José A. Moreno-Pérez;Dolores R. Santos-Peñate
Affiliations:
Instituto Universitario de Desarrollo Regional, Universidad de La Laguna, Spain;Instituto Universitario de Desarrollo Regional, Universidad de La Laguna, Spain;Dpto de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de Gran Canaria, Spain
Venue:
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Year:
2011

Citing 8
Cited 0

Swarm intelligence

Swarm intelligence
An alternating heuristic for medianoid and centroid problems in the plane

Computers and Operations Research
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Analysis of the publications on the applications of particle swarm optimisation

Journal of Artificial Evolution and Applications - Regular issue
(r,p)-centroid problems on paths and trees

Theoretical Computer Science
Heuristics for the facility location and design (1|1)-centroid problem on the plane

Computational Optimization and Applications
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem

Natural Computing: an international journal
Heuristic and exact methods for the discrete (r|p)-centroid problem

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The (r|p)-centroid problem is a competitive location problem that consists of determining optimal strategies for two competing firms, the leader and the follower, which make decisions sequentially. We propose a particle swarm optimization procedure with two swarms to solve the discrete (r|p)-centroid problem. The proposed algorithm considers a swarm for each player in the location game.