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. © 2012 Springer-Verlag.
CITATION STYLE
Campos-Rodríguez, C., Moreno-Pérez, J. A., & Santos-Peñate, D. R. (2012). Particle swarm optimization with two swarms for the discrete (r|p)-centroid problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6927 LNCS, pp. 432–439). https://doi.org/10.1007/978-3-642-27549-4_55
Mendeley helps you to discover research relevant for your work.