Skip to main content
SpringerLink
Log in

Intelligent Optimization Algorithms for Disruptive Anti-covering Location Problem

  • Conference paper
  • First Online:
Distributed Computing and Intelligent Technology (ICDCIT 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13776))

  • 406 Accesses

Abstract

Given a set of potential sites for locating facilities, the disruptive anti-covering location problem (DACLP) seeks to find the minimum number of facilities that can be located on these sites in such a way that each pair of facilities are separated by a distance which is more than R from one another and no more facilities can be added. DACLP is closely related with anti-covering location problem (ACLP), which is concerned with finding the maximum number of facilities that can be located such that all the facilities are separated by a distance which is more than R from each other. The disruptive anti-covering location problem is so named because it prevents the “best or maximal” packing solution of the anti-covering location problem from occurring. DACLP is an \(\mathcal{N}\mathcal{P}\)-hard problem and plays an important role in solving many real world problems including but not limited to forest management, locating bank branches, nuclear power plants, franchise stores and military defence units. In contrast to ACLP, DACLP is introduced only recently and is a relatively under-studied problem. In this paper, two intelligent optimization approaches namely genetic algorithm (GA) and discrete differential evolution (DDE) are proposed to solve the DACLP. These approaches are the first heuristic approaches for this problem. We have tested the proposed approaches on a total of 80 DACLP instances containing a maximum of 1577 potential sites. The effectiveness of the proposed approaches can be observed from the results on these instances.

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 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Notes

  1. 1.

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

  2. 2.

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

References

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

    Article  MATH  Google Scholar 

  2. Chappidi, E., Singh, A.: Discrete differential evolution-based solution for anti-covering location problem. In: Tiwari, A., Ahuja, K., Yadav, A., Bansal, J.C., Deep, K., Nagar, A.K. (eds.) Soft Computing for Problem Solving. AISC, vol. 1392, pp. 607–620. Springer, Singapore (2021). https://doi.org/10.1007/978-981-16-2709-5_46

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  4. Chaudhry, S.S., McCormick, S.T., Moon, I.D.: Locating independent facilities with maximum weight: greedy heuristics. Omega 14(5), 383–389 (1986)

    Article  Google Scholar 

  5. Chaurasia, S.N., Singh, A.: A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl. Intell. 43(3), 512–529 (2015). https://doi.org/10.1007/s10489-015-0654-1

    Article  Google Scholar 

  6. Church, R.L., Cohon, J.L.: Multiobjective location analysis of regional energy facility siting problems. Technical report, Brookhaven National Lab., Upton, NY (USA) (1976)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  10. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Grubesic, T.H., Murray, A.T., Pridemore, W.A., Tabb, L.P., Liu, Y., Wei, R.: Alcohol beverage distribution control, privatization and the geographic distribution of alcohol outlets. BMC Public Health 12, 1015 (2012)

    Article  Google Scholar 

  14. Khorjuvenkar, P.R., Singh, A.: 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), vol. 1, pp. 1–6. IEEE (2019)

    Google Scholar 

  15. Li, W., Wang, G.G., Gandomi, A.H.: A survey of learning-based intelligent optimization algorithms. Arch. Comput. Methods Eng. 28, 3781–3799 (2021)

    Article  MathSciNet  Google Scholar 

  16. Moon, I.D., Chaudhry, S.S.: An analysis of network location problems with distance constraints. Manag. Sci. 30(3), 290–307 (1984)

    Article  MATH  Google Scholar 

  17. Murray, A.T., Church, R.L.: Solving the anti-covering location problem using lagrangian relaxation. Comput. Oper. Res. 24(2), 127–140 (1997)

    Article  MATH  Google Scholar 

  18. Niblett, M.R., Church, R.L.: The disruptive anti-covering location problem. Eur. J. Oper. Res. 247(3), 764–773 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4), 795–816 (2008)

    Article  Google Scholar 

  20. Pandiri, V., Singh, A., Rossi, A.: Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput. Appl. 32(19), 15643–15663 (2020). https://doi.org/10.1007/s00521-020-04898-4

    Article  Google Scholar 

  21. Pham, D.T., Karaboga, D.: Intelligent Optimisation Techniques. Springer, London (2000). https://doi.org/10.1007/978-1-4471-0721-7

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

    Article  Google Scholar 

  23. Srivastava, G., Singh, A., Mallipeddi, R.: 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), pp. 652–659. IEEE (2021)

    Google Scholar 

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

    Article  Google Scholar 

  25. Tao, F., Laili, Y., Zhang, L.: Brief history and overview of intelligent optimization algorithms. In: Configurable Intelligent Optimization Algorithm. SSAM, pp. 3–33. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-08840-2_1

    Chapter  MATH  Google Scholar 

  26. Tasgetiren, M.F., Pan, Q.K., Suganthan, P.N., Liang, Y.C.: 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, pp. 251–258. IEEE (2007)

    Google Scholar 

  27. Valente, J., Moreira, M., Singh, A., Alves, R.: Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. Int. J. Adv. Manuf. Technol. 54, 251–265 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500046, India

    Edukondalu Chappidi & Alok Singh

  2. School of Electronics Engineering, Department of Artificial Intelligence, Kyungpook National University, Daegu, 41566, Republic of Korea

    Rammohan Mallipeddi

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

  3. Rammohan Mallipeddi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alok Singh .

Editor information

Editors and Affiliations

  1. Indian Statistical Institute, Kolkata, India

    Anisur Rahaman Molla

  2. Kent State University, Kent, OH, USA

    Gokarna Sharma

  3. Indian Institute of Management, Lucknow, India

    Pradeep Kumar

  4. Technology Innovation Institute, Abu Dhabi, United Arab Emirates

    Sanjay Rawat

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chappidi, E., Singh, A., Mallipeddi, R. (2023). Intelligent Optimization Algorithms for Disruptive Anti-covering Location Problem. In: Molla, A.R., Sharma, G., Kumar, P., Rawat, S. (eds) Distributed Computing and Intelligent Technology. ICDCIT 2023. Lecture Notes in Computer Science, vol 13776. Springer, Cham. https://doi.org/10.1007/978-3-031-24848-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-24848-1_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-24847-4

  • Online ISBN: 978-3-031-24848-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation