Skip to main content

Two-Swarm PSO for Competitive Location Problems

  • Chapter

Part of the book series: Studies in Computational Intelligence ((SCI,volume 236))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benati, S., Laporte, G.: Tabu search algorithms for the (r|X p ) −medianoid and (r|p) −centroid problems. Location Science 2, 193–204 (1994)

    MATH  Google Scholar 

  2. Bhadury, J., Eiselt, H.A., Jaramillo, J.H.: An alternating heuristic for medianoid and centroid problems in the plane. Computers and Operations Research 30, 553–565 (2003)

    Article  MATH  Google Scholar 

  3. Brito, J., Martínez, F.J., Moreno, J.A.: Particle Swarm Optimization for the continuous p-median problem. In: 6th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics, CIMMACS 2007, December 14-16. Puerto de La Cruz, Tenerife (2007)

    Google Scholar 

  4. Clerc, M.: Particle Swarm Optimization. ISTE (International Scientific and Technical Encyclopaedia) (2006)

    Google Scholar 

  5. Devletoglou, N.E.: A dissenting view of duopoly and spatial competition. Economica 32, 140–160 (1965)

    Article  Google Scholar 

  6. Devletoglou, N.E., Demetriou, P.A.: Choice and threshold: A further experiment in spatial duopoly. Economica 34, 351–371 (1967)

    Article  Google Scholar 

  7. Dobson, G., Karmarkar, U.S.: Competitive location on a network. Operations Research 35, 565–574 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)

    Google Scholar 

  9. Eiselt, H.A., Laporte, G.: Competitive spatial models. European Journal of Operational Research 39, 231–242 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Eiselt, H.A., Laporte, G.: Sequential location problems. European Journal of Operational Research 96, 217–231 (1996)

    Article  Google Scholar 

  11. Eiselt, H.A., Laporte, G., Thisse, J.-F.: Competitive location models: A framework and bibliography. Transportation Science 27(1), 44–54 (1993)

    Article  MATH  Google Scholar 

  12. Friesz, T.L., Miller, T., Tobin, R.L.: Competitive network facility location models: A survey. Papers of the Regional Science Association 65, 47–57 (1988)

    Google Scholar 

  13. Hakimi, S.L.: On locating new facilities in a competitive environment. European Journal of Operational Research 12, 29–35 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hakimi, S.L.: Location with spatial interactions: Competitive locations and games. In: Mirchandani, P.B., Francis, R.L. (eds.) Discrete Location Theory, pp. 439–478. John Wiley & Sons, New York (1990)

    Google Scholar 

  15. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks, IV, pp. 1942–1948 (1995)

    Google Scholar 

  16. Kennedy, J., Eberhart, R.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  17. Plastria, F.: Static competitive facility location: An overview of optimization approaches. European Journal of Operational Research 129, 461–470 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Redondo, J.L., Fernández, J., García, I., Ortigosa, P.M.: Heuristics for the facility location and design (1|1)-centroid problem on the plane. In: Computational Optimization and Applications (2008), doi:10.1007/s10589-008-9170-0

    Google Scholar 

  19. ReVelle, C.: The Maximum Capture or Sphere of Influence Location Problem: Hotelling revisited on a network. Journal of Regional Science 26(2), 343–358 (1986)

    Article  Google Scholar 

  20. Serra, D., ReVelle, C.: Market capture by two competitors: the preemptive location problem. Journal of Regional Science 34(4), 549–561 (1994)

    Article  Google Scholar 

  21. Serra, D., ReVelle, C.: Competitive location in discrete space. In: Drezner, Z. (ed.) Facility location: A survey of applications and methods, pp. 367–386. Springer, Berlin (1995)

    Google Scholar 

  22. Santos-Peñate, D.R., Suárez-Vega, R., Dorta-González, P.: The leader-follower location model. Networks and Spatial Economics 7, 45–61 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  23. Spoerhase, J., Wirth, H.C.: (r,p)-centroid problems on paths and trees, Technical Report 441, Inst. Comp. Science, University of Würzburg (2008), http://www.informatik.uni-wuerzburg.de/

  24. Suárez-Vega, R., Santos-Peñate, D.R., Dorta-González, P.: Competitive multifacility location on networks: the (r|X p )-medianoid problem. Journal of Regional Science 44(3), 569–588 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rodríguez, C.M.C., Pérez, J.A.M., Noltemeier, H., Peñate, D.R.S. (2009). Two-Swarm PSO for Competitive Location Problems. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2008). Studies in Computational Intelligence, vol 236. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03211-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03211-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03210-3

  • Online ISBN: 978-3-642-03211-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics