Two-Swarm PSO for Competitive Location Problems

Competitive location problems consist of determining optimal strategies for competing firms which make location decisions. The standard problem is the leader-follower location problem which consists of determining optimal strategies for two competing firms, the leader and the follower, which make decisions sequentially. The follower has the objective of maximizing its market share, given the locations chosen by the leader. The leader optimization problem is to minimize the maximum market share that the follower can get. We propose a two-swarm particle swarm optimization procedure in which each swarm contains locations for one of the two firms. We analyze the application of this procedure to the (r|p)-centroid problem in the plane. It is the leader-follower problem where the leader chooses p points and then the follower chooses r points.

[1]  Gilbert Laporte,et al.  Competitive Location Models: A Framework and Bibliography , 1993, Transp. Sci..

[2]  R. Suárez-Vega,et al.  The Leader–Follower Location Model , 2007 .

[3]  M. Clerc,et al.  Particle Swarm Optimization , 2006 .

[4]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[5]  Horst A. Eiselt,et al.  An alternating heuristic for medianoid and centroid problems in the plane , 2003, Comput. Oper. Res..

[6]  D. Serra,et al.  Competitive location in discrete space , 1994 .

[7]  Charles ReVelle,et al.  THE MAXIMUM CAPTURE OR “SPHERE OF INFLUENCE” LOCATION PROBLEM: HOTELLING REVISITED ON A NETWORK* , 1986 .

[8]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[9]  Terry L. Friesz,et al.  COMPETITIVE NETWORK FACIUTY LOCATION MODELS: A SURVEY , 2005 .

[10]  Gilbert Laporte,et al.  Competitive spatial models , 1989 .

[11]  Inmaculada García,et al.  Heuristics for the facility location and design (1|1)-centroid problem on the plane , 2010, Comput. Optim. Appl..

[12]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[13]  R. Suárez-Vega,et al.  Competitive Multifacility Location on Networks: The (R|Xp)-Medianoid Problem , 2004 .

[14]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[15]  Hans-Christoph Wirth,et al.  (r, P)-centroid Problems on Paths and Trees , 2009, Theor. Comput. Sci..

[16]  Nicos E. Devletoglou,et al.  A Dissenting View of Duopoly and Spatial Competition , 1965 .

[17]  G Laporte,et al.  TABU SEARCH ALGORITHMS FOR THE (R/XP)-MEDIANOID AND (R/P)-CENTROID PROBLEMS , 1994 .

[18]  Julio Brito,et al.  Particle swarm optimization for the continuous p-median problem , 2007 .

[19]  Nicos E. Devletoglou,et al.  Choice and Threshold: A Further Experiment in Spatial Duopoly , 1967 .

[20]  Uday S. Karmarkar,et al.  Competitive Location on a Network , 1987, Oper. Res..

[21]  Frank Plastria,et al.  Static competitive facility location: An overview of optimisation approaches , 2001, Eur. J. Oper. Res..

[22]  D. Serra,et al.  Market capture by two competitors: The pre-emptive location problem , 1994 .

[23]  Gilbert Laporte,et al.  Sequential location problems , 1997 .

[24]  S. Hakimi.  On locating new facilities in a competitive environment , 1983 .