Skip to main content
SpringerLink
Log in

Solving the facility location and design (1∣1)-centroid problem via parallel algorithms

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Several parallel strategies for solving a centroid problem are presented. In the competitive location problem considered in this paper, the aim is to maximize the profit obtained by a chain (the leader) knowing that a competitor (the follower) will react by locating another single facility after the leader locates its own facility. A global optimization memetic algorithm called UEGO_cent.SASS was proposed to cope with this hard-to-solve optimization problem. Now, five parallel implementations of the optimization algorithm have been developed. The use of several processors, and hence more computational resources, allows us to solve bigger problems and to implement new methods which increase the robustness of the algorithm at finding the global optimum. A computational study comparing the new parallel methods in terms of efficiency and effectiveness has been carried out.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Drezner Z, Hamacher H (2002) Facility location. Applications and theory. Springer, Berlin

    Book  MATH  Google Scholar 

  2. Hakimi S (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12(1):29–35

    Article  MathSciNet  MATH  Google Scholar 

  3. Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6(5):443–462

    Article  Google Scholar 

  4. Redondo J, Fernández J, García I, Ortigosa P (2008) Parallel algorithms for continuous competitive location problems. Optim Methods Softw 23(5):779–791

    Article  MathSciNet  MATH  Google Scholar 

  5. Redondo J, Fernández J, García I, Ortigosa P (2009) Parallel algorithms for multifacilities continuous competitive location problems. J Global Optim. doi:10.1007/s10898-009-9455-6

  6. Redondo J, Fernández J, García I, Ortigosa P (2010) Heuristics for the facility location and design (1∣1)-centroid problem on the plane. Comput Optim Appl 45:111–141

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. Computer Architecture and Electronics, University of Almería, Almería, Spain

    J. L. Redondo & P. M. Ortigosa

  2. Dpt. Computer Architecture and Electronics, University of Málaga, Málaga, Spain

    I. García

  3. Dpt. Statistics and Operations Research, University of Murcia, Murcia, Spain

    J. Fernández

Authors
  1. J. L. Redondo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. I. García
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. M. Ortigosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. L. Redondo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Redondo, J.L., Fernández, J., García, I. et al. Solving the facility location and design (1∣1)-centroid problem via parallel algorithms. J Supercomput 58, 420–428 (2011). https://doi.org/10.1007/s11227-011-0605-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0605-5

Keywords

Search

Navigation