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

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.