Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Evolutionary approaches for the weighted anti-covering location problem

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

Given a set of potential facility location sites along with a positive weight associated with each site as per its importance, the anti-covering location problem (ACLP) is about locating a set of facilities at some of these potential locations such that no two facilities are closer than a given distance from each other and sum of weights of chosen locations is as large as possible. This \(\mathcal {NP}\)-hard problem has several important real-world applications such as telecommunications equipment siting, locating military units, locating franchise outlets, locating obnoxious facilities, forest management and DNA sequence matching. There are weighted and unweighted versions of ACLP. The unweighted version of ACLP is widely studied in the literature. However, the weighted version did not receive much attention despite several real-world applications. In this paper, we have proposed two evolutionary approaches based on genetic algorithm (GA) and discrete differential evolution (DDE) to solve the weighted version of the ACLP. The proposed approaches are used to solve the 80 ACLP instances with upto 1577 potential sites. Computational results show the effectiveness of our approaches.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability statement

All the test instances used in this paper can be obtained through e-mail from the corresponding author.

Notes

  1. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/esteininfo.html.

  2. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsp/index.html.

  3. https://mathcracker.com/wilcoxon-signed-ranks.php.

References

  1. Barahona F, Weintraub A, Epstein R (1992) Habitat dispersion in forest planning and the stable set problem. Oper Res 40(1-supplement-1):S14–S21

  2. Carrizosa E, Boglárka G, et al. (2015) Anti-covering problems. In: Location science. Springer, pp 115–132

  3. Chaudhry SS (2006) A genetic algorithm approach to solving the anti-covering location problem. Exp Syst 23(5):251–257

    Article  Google Scholar 

  4. Chaudhry SS, McCormick ST, Moon ID (1986) Locating independent facilities with maximum weight: greedy heuristics. Omega 14(5):383–389

    Article  Google Scholar 

  5. Chaurasia SN, Singh A (2015) A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl Intell 43(3):512–529

    Article  Google Scholar 

  6. Church RL, Cohon JL (1976) Multiobjective location analysis of regional energy facility siting problems. Tech. rep., Brookhaven National Lab., Upton, NY (USA)

  7. Church RL, Garfinkel RS (1978) Locating an obnoxious facility on a network. Transp Sci 12(2):107–118

    Article  MathSciNet  Google Scholar 

  8. Current JR, Storbeck JE (1994) A multiobjective approach to design franchise outlet networks. J Oper Res Soc 45(1):71–81

    Article  MATH  Google Scholar 

  9. Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4–31

    Article  Google Scholar 

  10. Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York

    Google Scholar 

  11. Dimitrijević B, Teodorović D, Simić V, Šelmić M (2011) Bee colony optimization approach to solving the anticovering location problem. J Comput Civ Eng 26(6):759–768

    Article  MATH  Google Scholar 

  12. Erkut E (1990) The discrete p-dispersion problem. Eur J Oper Res 46(1):48–60

    Article  MathSciNet  MATH  Google Scholar 

  13. Erkut E, ReVelle C, Ülküsal Y (1996) Integer-friendly formulations for the r-separation problem. Eur J Oper Res 92(2):342–351

    Article  MATH  Google Scholar 

  14. Garey MR, Johnson DS (2002) Computers and intractability, vol 29. WH Freeman New York

  15. Joseph D, Meidanis J, Tiwari P (1992) Determining dna sequence similarity using maximum independent set algorithms for interval graphs. In: Proceedings of the Scandinavian workshop on algorithm theory. Springer, pp 326–337

  16. Khorjuvenkar PR, Singh A (2019) A hybrid swarm intelligence approach for anti-covering location problem. In: Proceedings of the 2019 IEEE international conference on innovations in power and advanced computing technologies (i-PACT 2019). IEEE, vol 1, pp 1–6

  17. Moon ID, Chaudhry SS (1984) An analysis of network location problems with distance constraints. Manage Sci 30(3):290–307

    Article  MATH  Google Scholar 

  18. Murray AT, Church RL (1997) Solving the anti-covering location problem using lagrangian relaxation. Comput Ope Res 24(2):127–140

    Article  MATH  Google Scholar 

  19. Pan QK, Tasgetiren MF, Liang YC (2008) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Indus Eng 55(4):795–816

    Article  Google Scholar 

  20. Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32(19):15643–15663

    Article  Google Scholar 

  21. Rossi A, Singh A, Sevaux M (2021) Focus distance-aware lifetime maximization of video camera-based wireless sensor networks. J Heuristics 27(1–2):5–30

    Article  Google Scholar 

  22. Singh A, Rossi A, Sevaux M (2013) Matheuristic approaches for Q-coverage problem versions in wireless sensor networks. Eng Optim 45(5):609–626

    Article  Google Scholar 

  23. Srivastava G, Venkatesh P, Singh A (2020) An evolution strategy based approach for cover scheduling problem in wireless sensor networks. Int J Mach Learn Cybern 11(9):1981–2006

    Article  Google Scholar 

  24. Srivastava G, Singh A, Mallipeddi R (2021) A hybrid discrete differential evolution approach for the single machine total stepwise tardiness problem with release dates. In: Proceedings of the 2021 IEEE congress on evolutionary computation (CEC 2021). IEEE, pp 652–659

  25. Srivastava G, Singh A, Mallipeddi R (2021) NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. Expert Syst Appl 176:114779

    Article  Google Scholar 

  26. Tasgetiren MF, Pan QK, Suganthan PN, Liang YC (2007) A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion. In: Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (SCIS 07), IEEE, pp 251–258

  27. Wilcoxon F, Katti S, Wilcox RA (1970) Critical values and probability levels for the wilcoxon rank sum test and the wilcoxon signed rank test. Selected Tables Math Stat 1:171–259

    MATH  Google Scholar 

Download references

Acknowledgements

Authors are grateful to two anonymous reviewers for their valuable comments and suggestions which helped in improving the quality of this manuscript. The second author acknowledges the support of the research grant no. MTR/2017/000391 received under MATRICS scheme from the Science and Engineering Research Board (SERB), Government of India.

Author information

Authors and Affiliations

  1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, Telangana, 500 046, India

    Edukondalu Chappidi & Alok Singh

Authors
  1. Edukondalu Chappidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alok Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alok Singh.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chappidi, E., Singh, A. Evolutionary approaches for the weighted anti-covering location problem. Evol. Intel. 16, 891–901 (2023). https://doi.org/10.1007/s12065-022-00701-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-022-00701-6

Keywords

Search

Navigation