Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/48232
Title: Particle swarm optimization with two swarms for the discrete (r|p)-centroid problem
Authors: Campos Rodriguez,Clara Margarita 
Moreno Pérez,José Andrés 
Santos Peñate, Dolores Rosa 
UNESCO Clasification: 530202 Modelos econométricos
Keywords: Localización de empresas
Modelos económetricos
Issue Date: 2012
Publisher: 0302-9743
Journal: Lecture Notes in Computer Science 
Conference: 13th International Conference on Computer Aided Systems Theory, EUROCAST 2011 
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.
URI: http://hdl.handle.net/10553/48232
ISBN: 9783642275487
ISSN: 0302-9743
DOI: 10.1007/978-3-642-27549-4_55
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)[ISSN 0302-9743],v. 6927 LNCS, p. 432-439
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

5
checked on Feb 28, 2021

Page view(s)

13
checked on Feb 28, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.