iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/s00521-020-04898-4
Two hybrid metaheuristic approaches for the covering salesman problem | Neural Computing and Applications Skip to main content

Advertisement

Springer Nature Link
Log in

Two hybrid metaheuristic approaches for the covering salesman problem

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This paper addresses the covering salesman problem (CSP), which is an extension of the classical traveling salesman problem (TSP). Given a set of cities and a coverage radius associated with each one of them, the CSP seeks a Hamiltonian cycle over a subset of cities such that each city not in the subset is within the coverage radius of at least one city in the subset and that has minimum length among all Hamiltonian cycles over such subsets. To solve this problem, one has to deal with the aspects of subset selection and permutation. The CSP finds application in emergency and disaster management and rural healthcare. This paper presents two hybrid metaheuristic approaches for the CSP. The first approach is based on the artificial bee colony algorithm, whereas the latter approach is based on the genetic algorithm. Both the approaches make use of several new first improvement or best improvement based local search strategies defined over various neighborhood structures. Computational results on a wide range of benchmark instances demonstrate the effectiveness of the proposed approaches. We are able to improve the best known solution values on majority of the large instances.

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

Similar content being viewed by others

Explore related subjects

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

Notes

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

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

References

  1. Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120–142

    Article  Google Scholar 

  2. Arkin EM, Hassin R (1994) Approximation algorithms for the geometric covering salesman problem. Discrete Appl Math 55(3):197–218

    Article  MathSciNet  MATH  Google Scholar 

  3. Baldacci R, Dell’Amico M, González JS (2007) The capacitated m-ring-star problem. Oper Res 55(6):1147–1162

    Article  MathSciNet  MATH  Google Scholar 

  4. Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23(3):208–213

    Article  MathSciNet  MATH  Google Scholar 

  5. Current JR, Schilling DA et al (1994) The median tour and maximal covering tour problems: formulations and heuristics. Eur J Oper Res 73(1):114–126

    Article  MATH  Google Scholar 

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

    Google Scholar 

  7. Fischetti M, Salazar González JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378–394

    Article  MathSciNet  MATH  Google Scholar 

  8. Gao W, Liu S (2011) Improved artificial bee colony algorithm for global optimization. Inf Process Lett 111:871–882

    Article  MathSciNet  MATH  Google Scholar 

  9. Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568–576

    Article  MathSciNet  MATH  Google Scholar 

  10. Golden B, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534–553

    Article  MathSciNet  MATH  Google Scholar 

  11. Gulczynski DJ, Heath JW, Price CC (2006) The close enough traveling salesman problem: a discussion of several heuristics. In: Perspectives in operations research, operations research/computer science interfaces book series (ORCS), vol 36. Springer, pp 271–283

  12. Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27(1):29–42

    Article  MATH  Google Scholar 

  13. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey

  14. Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11:3021–3031

    Article  Google Scholar 

  15. Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numeric function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–471

    Article  MATH  Google Scholar 

  16. Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21–57

    Article  Google Scholar 

  17. Labbé M, Laporte G, Martín IR, González JJS (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177–189

    Article  MathSciNet  MATH  Google Scholar 

  18. Labbé M, Laporte G, Martın IR, González JJS (2005) Locating median cycles in networks. Eur J Oper Res 160(2):457–470

    Article  MathSciNet  MATH  Google Scholar 

  19. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498–516

    Article  MathSciNet  MATH  Google Scholar 

  20. Motta L, Ochi LS, Martinhon C (2001) Grasp metaheuristics for the generalized covering tour problem. In: Proceedings of IV metaheuristic international conference, vol 1. Porto, Portugal, pp 387–391

  21. Naji-Azimi Z, Salari M, Toth P (2010) A heuristic procedure for the capacitated m-ring-star problem. Eur J Oper Res 207(3):1227–1234

    Article  MathSciNet  MATH  Google Scholar 

  22. Pan QK, Tasgetiren M, Suganthan P, Chua T (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455–2468

    Article  MathSciNet  Google Scholar 

  23. Pandiri V, Singh A (2016) Swarm intelligence approaches for multidepot salesmen problems with load balancing. Appl Intell 44(4):849

    Article  Google Scholar 

  24. Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39(11):2594–2602

    Article  MathSciNet  MATH  Google Scholar 

  25. Salari M, Reihaneh M, Sabbagh MS (2015) Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput Ind Eng 83:244–251

    Article  Google Scholar 

  26. Shuttleworth R, Golden BL, Smith S, Wasil E (2008) Advances in meter reading: Heuristic solution of the close enough traveling salesman problem over a street network. In: The vehicle routing problem: latest advances and new challenges, operations research/computer science interfaces book series (ORCS), vol 43. Springer, pp 487–501

  27. Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625–631

    Article  Google Scholar 

  28. Sundar S, Singh A (2010) A swarm intelligence approach to the quadratic minimum spanning tree problem. Inf Sci 180:3182–3191

    Article  MathSciNet  Google Scholar 

  29. Tripathy SP, Tulshyan A, Kar S, Pal T (2017) A metameric genetic algorithm with new operator for covering salesman problem with full coverage. Int J Control Theory Appl 10(7):245–252

    Google Scholar 

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

    MATH  Google Scholar 

Download references

Acknowledgements

Authors are thankful to Dr. Majid Salari for sharing the test instances of the covering salesman problem. The first author is grateful to the Council of Scientific and Industrial Research, Government of India for supporting his research work through a senior research fellowship. The second author gratefully acknowledges the support of the research Grant no. MTR/2017/000391 of Science & Engineering Research Board, Government of India.

Author information

Authors and Affiliations

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

    Venkatesh Pandiri & Alok Singh

  2. Université Paris-Dauphine, PSL, LAMSADE UMR CNRS 7243, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    André Rossi

  3. Université d’Angers, LERIA EA CNRS 2645, 49000, Angers, France

    André Rossi

Authors
  1. Venkatesh Pandiri
    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. André Rossi
    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

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-020-04898-4

Keywords

Search

Navigation