Skip to main content
SpringerLink
Log in

Particle Swarm Optimization with Two Swarms for the Discrete (r|p)-Centroid Problem

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2011 (EUROCAST 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6927))

Included in the following conference series:

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.

Partially financed by the Spanish Government, grants ECO2008-05589 and TIN2008-06872-C04-01.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A.: Heuristic and Exact Methods for the Discrete (r|p)-Centroid Problem. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 11–22. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. 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 

  3. Bhadury, J., Eiselt, H.A., Jaramillo, J.H.: An alternating Heuristic for Medianoid and Centroid Problems in the Plane. Computers & Operations Research 30, 553–565 (2003)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  5. Correa, E.S., Freitas, A.A., Johnson, C.G.: A new discrete particle swarm algorithm applied to attribute selection in a bioinformatic data set. In: Proceedings of GECCO 2006, pp. 35–42 (2006)

    Google Scholar 

  6. Campos-Rodríguez, C., Santos-Peñate, D.R., Moreno-Pérez, J.A.: An Exact Procedure and LP Formulations for the Leader-Follower Problem. TOP 18(1) (2010)

    Google Scholar 

  7. Campos-Rodrríguez, C., Moreno-Pérez, J.A., Notelmeier, H., Santos-Peñate, D.R.: Two-Swarm PSO for Competitive Location. In: Krasnogor, N., Melián-Batista, M.B., Pérez, J.A.M., Moreno-Vega, J.M., Pelta, D.A. (eds.) NICSO 2008. SCI, vol. 236, pp. 115–126. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Consoli, S., Moreno Pérez, J.A., Maldenovic, N., Darby-Dowman, K.: Discrete Particle Swarm Optimization for the Minimum Labelling Spanning Tree Problem. Natural Computing 9(1), 29–46 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  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)

    Article  Google Scholar 

  13. Hakimi, S.L.: On Locating New Facilities in a Competitive Environment. European Journal of Operational Research 12, 29–35 (1983)

    Article  MathSciNet  MATH  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. Wiley, New York (1990)

    Google Scholar 

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

    Google Scholar 

  16. Kennedy, J., Eberhart, R.: Discrete Binary Version of the Particle Swarm Algorithm. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 5, pp. 4104–4108 (1997)

    Google Scholar 

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

    Google Scholar 

  18. Martínez, F.J., Moreno, J.A.: Discrete Particle Swarm Optimization for the p-Median Problem. In: Seventh Metaheuristic International Conference, MIC 2007, Montreal, Canada, pp. 25–29 (2007)

    Google Scholar 

  19. Plastria, F.: Static Competitive Facility Location: An Overview of Optimization Approaches. European Journal of Operational Research 129, 461–470 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. Poli, R.: Analysis of the Publications on the Applications of Particle Swarm Optimization. Journal of Artificial Evolution and Applications 4, 1–10 (2008)

    Google Scholar 

  21. Poli, R., Kennedy, J., Blackwell, T.: Particle Swarm Optimization. Swarm Intelligence 1(1), 33–57 (2007)

    Article  Google Scholar 

  22. Pugh, J., Martinoli, A.: Discrete multi-valued particle swarm optimization. In: Proceedings of IEEE Swarm Intelligence Symposium, vol. 1, pp. 103–110 (2006)

    Google Scholar 

  23. 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. Computational Optimization and Applications 45(1) (2010)

    Google Scholar 

  24. 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 

  25. 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  MathSciNet  MATH  Google Scholar 

  26. 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 

  27. 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)

    Chapter  Google Scholar 

  28. Spoerhase, J., Wirth, H.C.: (r|p)-Centroid Problems on Paths and Trees. Theoretical Computer Science 410, 5128–5137 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  29. 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  MATH  Google Scholar 

  30. Yang, S., Wang, M., Jiao, L.: A Quantum Particle Swarm Optimization. In: Proceedings of CEC 2004, the Congress on Evolutionary Computing, vol. 1, pp. 320–324 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Universitario de Desarrollo Regional, Universidad de La Laguna, Spain

    Clara Campos-Rodríguez & José A. Moreno-Pérez

  2. Dpto de Métodos Cuantitativos en Economía y Gestión, Universidad de Las Palmas de Gran Canaria, Spain

    Dolores R. Santos-Peñate

Authors
  1. Clara Campos-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José A. Moreno-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dolores R. Santos-Peñate
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Universitario de Ciencias y Tecnologías Cibernéticas, Universidad de Las Palmas de Gran Canaria, Campus de Tafira, 35017, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz  & Alexis Quesada-Arencibia  & 

  2. Institute of Systems Science, Johannes Kepler University Linz, Altenbergerstrasse 69, 4040, Linz, Austria

    Franz Pichler

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27549-4_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27549-4_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27548-7

  • Online ISBN: 978-3-642-27549-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation