Skip to main content

Advertisement

SpringerLink
Log in

Solving maximal covering location problem using genetic algorithm with local refinement

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The maximal covering location problem (MCLP) deals with the problem of finding an optimal placement of a given number of facilities within a set of customers. Each customer has a specific demand and the facilities are to be placed in such a way that the total demand of the customers served by the facilities is maximized. In this article an improved genetic algorithm (GA)-based approach, which utilizes a local refinement strategy for faster convergence, is proposed to solve MCLP. The proposed algorithm is applied on several MCLP instances from literature and it is demonstrated that the proposed GA with local refinement gives better results in terms of percentage of coverage and computation time to find the solutions in almost all the cases. The proposed GA-based approach with local refinement is also found to outperform the other existing methods for most of the small as well as large instances of MCLP.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Adenso-Diaz B, Rodriguez F (1997) A simple search heuristic for the MCLP: application to the location of ambulance bases in a rural region. Omega 25(2):181–187

    Article  Google Scholar 

  • Atta S, Mahapatra PRS (2013) Genetic algorithm based approach for serving maximum number of customers using limited resources. Proced Technol 10:492–497

    Article  Google Scholar 

  • Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069–1072

  • Berman O, Drezner Z, Krass D (2010) Generalized coverage: new developments in covering location models. Comput Oper Res 37(10):1675–1687

    Article  MathSciNet  MATH  Google Scholar 

  • Chung CH (1986) Recent applications of the maximal covering location planning (MCLP) model. J Oper Res Soc 37(8):735–746

    Article  MATH  Google Scholar 

  • Church R, ReVelle C (1974) The maximal covering location problem. Pap Reg Sci 32(1):101–118

    Article  Google Scholar 

  • Davari S, Zarandi MHF, Hemmati A (2011) Maximal covering location problem (MCLP) with fuzzy travel times. Expert Syst Appl 38(12):14535–14541

    Article  Google Scholar 

  • de Assis Corrêa F, Lorena LAN, Ribeiro GM (2009) A decomposition approach for the probabilistic maximal covering location–allocation problem. Comput Oper Res 36(10):2729–2739

    Article  MathSciNet  MATH  Google Scholar 

  • de Berg M, Cabello S, Har-Peled S (2009) Covering many or few points with unit disks. Theory Comput Syst 45(3):446–469

    Article  MathSciNet  MATH  Google Scholar 

  • De Berg M, Van Kreveld M, Overmars M, Schwarzkopf OC (2000)Computational geometry: algorithms and applications. Springer. https://books.google.co.in/books?id=C8zaAWuOIOcC

  • Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Berlin

    MATH  Google Scholar 

  • Farahani RZ, Asgari N, Heidari N, Hosseininia M, Goh M (2012) Covering problems in facility location: a review. Comput Ind Eng 62(1):368–407

    Article  Google Scholar 

  • Fazel Zarandi M, Davari S, Haddad Sisakht S (2011) The large scale maximal covering location problem. Sci Iran 18(6):1564–1570

    Article  MATH  Google Scholar 

  • Galvão RD, Gonzalo Acosta Espejo L, Boffey B (2000) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124(2):377–389

    Article  MathSciNet  MATH  Google Scholar 

  • Galvão RD, ReVelle C (1996) A Lagrangean heuristic for the maximal covering location problem. Eur J Oper Res 88(1):114–123

    Article  MATH  Google Scholar 

  • García-Martínez C, Lozano M (2007) Local search based on genetic algorithms. In: Advances in metaheuristics for hard optimization. Springer, pp 199–221

  • Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness

  • Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, New York

    MATH  Google Scholar 

  • Hamacher HW, Drezner Z (2002) Facility location: applications and theory. Springer, New York

    MATH  Google Scholar 

  • Hillsman E (1984) The p-median structure as a unified linear model for location–allocation analysis. Environ Plan A 16:305–318

    Article  Google Scholar 

  • Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv 31(3):264–323

    Article  Google Scholar 

  • Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761–779. doi:10.1016/S0305-0548(01)00021-1

    Article  MathSciNet  MATH  Google Scholar 

  • Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31(9):1515–1526

    Article  MathSciNet  MATH  Google Scholar 

  • Karmakar A (2011) Location problems for covering demands: algorithms and applications. Ph.D. thesis, Indian Statistical Institute, Kolkata, India

  • Lee JM, Lee YH (2010) Tabu based heuristics for the generalized hierarchical covering location problem. Comput Ind Eng 58(4):638–645

    Article  Google Scholar 

  • Lorena LA, Pereira MA (2002) A Lagrangean/surrogate heuristic for the maximal covering location problem using Hillman’s edition. Int J Ind Eng 9:57–67

    Google Scholar 

  • Mahapatra PRS, Goswami PP, Das S (2007) Covering points by isothetic unit squares. In: CCCG, pp 169–172

  • Mahapatra PRS (2012) Studies on variations of enclosing problem using rectangular objects. Ph.D. thesis, University of Kalyani, Kalyani, West Bengal, India

  • Mahapatra PRS, Goswami PP, Das S (2015) Placing two axis-parallel squares to maximize the number of enclosed points. Int J Comput Geom Appl 25(04):263–282

    Article  MathSciNet  MATH  Google Scholar 

  • Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebraic Discrete Methods 4(2):253–261

    Article  MathSciNet  MATH  Google Scholar 

  • Mladenović N, Brimberg J, Hansen P, Moreno-Pérez JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3):927–939

    Article  MathSciNet  MATH  Google Scholar 

  • Moore GC, ReVelle C (1982) The hierarchical service location problem. Manag Sci 28(7):775–780

    Article  MATH  Google Scholar 

  • Mukhopadhyay A, Maulik U, Bandyopadhyay S (2015) A survey of multiobjective evolutionary clustering. ACM Comput Surv 47(4):61:1–61:46

    Article  Google Scholar 

  • Pereira MA, Coelho LC, Lorena LA, De Souza LC (2015) A hybrid method for the probabilistic maximal covering location–allocation problem. Comput Oper Res 57:51–59

    Article  MathSciNet  MATH  Google Scholar 

  • Preparata F, Shamos M (1993) Computational geometry: an introduction. Monographs in Computer Science. Springer, New York. https://books.google.co.in/books?id=gFtvRdUY09UC

  • Resende MG (1998) Computing approximate solutions of the maximum covering problem with GRASP. J Heuristics 4(2):161–177

    Article  MATH  Google Scholar 

  • ReVelle CS, Eiselt HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165(1):1–19

    Article  MathSciNet  MATH  Google Scholar 

  • Rodriguez FJ, Blum C, Lozano M, García-Martínez C (2012) Iterated greedy algorithms for the maximal covering location problem. In: European conference on evolutionary computation in combinatorial optimization. Springer, pp 172–181

  • Schilling DA, Jayaraman V, Barkhi R (1993) A review of covering problems in facility location. Location Sci 1(1):25–55

  • Spieker H, Hagg A, Gaier A, Meilinger S, Asteroth A (2016) Multi-stage evolution of single-and multi-objective MCLP. Soft Comput 1–14. doi:10.1007/s00500-016-2374-9

  • Weaver J, Church R (1984) A comparison of direct and indirect primal heuristic/dual bounding solution procedures for the maximal covering location problem. Unpublished paper

Download references

Acknowledgements

This work has been partially supported by DST-PURSE scheme, Government of India at University of Kalyani.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal, 741235, India

    Soumen Atta, Priya Ranjan Sinha Mahapatra & Anirban Mukhopadhyay

Authors
  1. Soumen Atta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priya Ranjan Sinha Mahapatra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anirban Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anirban Mukhopadhyay.

Ethics declarations

Conflict of interest

This section is to certify that we have no potential conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Atta, S., Sinha Mahapatra, P.R. & Mukhopadhyay, A. Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22, 3891–3906 (2018). https://doi.org/10.1007/s00500-017-2598-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2598-3

Keywords

Search

Navigation