Skip to main content

Advertisement

SpringerLink
Log in

On multi-objective covering salesman problem

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

Abstract

Most of the Covering Salesman Problems (CSPs) addressed in the literature are considered full coverage. However, in real-life emergency situations like earthquake, flood, endemic and rural health care supply chain, full coverage of the cities may not always be possible due to various reasons like insufficient supply, limited time frame, insufficient manpower and damage of routes. In this study, we formulate a multi-objective CSP (MOCSP) restricting the number of nodes visited in a tour within a given range, so that a given percentage of nodes is at least covered. The objectives are maximization of coverage and minimization of tour length. Due to conflicting nature of the objectives, the problem is posed as a multi-objective optimization problem (MOOP). To solve the problem, the metaheuristic Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is used with some modifications. The chromosome is designed to represent a tour with number of visited nodes within a given range. For the purpose of implementation, a one-dimensional array of variable length is used. New crossover and mutation operators are designed which are suitable for the problem and the corresponding chromosome representation. For simulation purpose, 19 benchmark test problems of Traveling Salesman Problem (TSP) from TSPLIB (Reinelt in ORSA J Comp 3:376–384) are used, where the number of nodes (i.e., cities) varies between 52 and 818. For each test problem, 12 instances are generated taking different values of problem parameters. Then, the set of optimal solutions are obtained for each instance, and the results are analyzed. A comparison of results for six test problems shows that our algorithm produces the best-known solutions for small and medium sized problems. However, for large sized problems, our algorithm produces better quality solutions in some cases only.

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

  1. Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3(4):376–384

    Article  MATH  Google Scholar 

  2. Current JR (1981) Multi-objective design of transportation networks. Ph.D. thesis, Department of Geography and Environmental Engineering, Johns Hopkins University, Baltimore

  3. 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 

  4. 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 

  5. Pandiri V, Singh A (2019) An artificial bee colony algorithm with variable degree of perturbation for the generalized covering traveling salesman problem. Appl Soft Comput 1(78):481–495

    Article  Google Scholar 

  6. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. 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 

  9. Lu Y, Benlic U, Wu Q (2021) A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf Sci 564:144–162

    Article  MathSciNet  Google Scholar 

  10. 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 

  11. Venkatesh P, Srivastava G, Singh A. A multi-start iterated local search algorithm with variable degree of perturbation for the covering salesman problem. In: Harmony Search and Nature Inspired Optimization Algorithms 2019. Springer, Singapore, pp 279–292

  12. 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 

  13. 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 

  14. Mukherjee A, Panigrahi G, Kar S, Maiti M (2019) Constrained covering solid travelling salesman problems in uncertain environment. J Ambient Intell Humaniz Comput 10(1):125–141

    Article  Google Scholar 

  15. Tripathy SP, Biswas A, Pal T (2021) A multi-objective covering salesman problem with 2-coverage. Appl Soft Comput 1(113):108024

    Article  Google Scholar 

  16. Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  17. Zang X, Jiang L, Ratli M, Ding B (2020) A parallel variable neighborhood search for solving covering salesman problem. Optim Lett 14:1–6

    MathSciNet  MATH  Google Scholar 

  18. Jiang L, Zang X, Dong J, Liang C (2021) A covering traveling salesman problem with profit in the last mile delivery. Optim Lett 21:1–9

    MATH  Google Scholar 

  19. Singh P, Kamthane AR, Tanksale AN (2021) Metaheuristics for the distance constrained generalized covering traveling salesman problem. Opsearch 16:1–35

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. 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 

  22. 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

  23. 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 

  24. Labbe´ M, Laporte G, Martı´n IR, Gonza´lez JJS, (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177–189

    Article  MathSciNet  Google Scholar 

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

  26. 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 

  27. Labbe´ M, Laporte G, Martın IR, Gonza´lez JJS (2005) Locating median cycles in networks. Eur J Oper Res 160(2):457–470

  28. 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 

  29. Laporte G, Martello S (1990) The selective traveling salesman problem. Discr Appl Math 26:193–207

    Article  MATH  Google Scholar 

  30. Gutin G, Punnen AP (eds) (2002) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, The Netherlands

    MATH  Google Scholar 

  31. 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

  32. 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

  33. Ozbaygin G, Yaman H, Karasan OE (2016) Time constrained maximal covering salesman problem with weighted demands and partial coverage. Comput Oper Res 76:226–237

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the anonymous referees for their valuable suggestions and comments to improve the quality of the paper. The authors would also like to thank Professor S. T. A. Niaki (Department of Industrial Engineering, Sharif University of Technology, Iran) and Shri Shounak Datta (Duke University, Durham, United States) for their help and constructive suggestions on this work.

Author information

Authors and Affiliations

  1. Department of Mathematics, Durgapur Government College, Durgapur, 713214, India

    Amiya Biswas

  2. School of Computer Science, National Institute of Science and Technology, Berhampur, Odisha, India

    Siba Prasada Tripathy

  3. Department of CSE, National Institute of Technology Durgapur, Durgapur, India

    Tandra Pal

Authors
  1. Amiya Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Siba Prasada Tripathy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tandra Pal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tandra Pal.

Ethics declarations

Conflict of interest

No conflict of interest exists in the submission of this manuscript, and manuscript is approved by all authors for publication.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Biswas, A., Tripathy, S.P. & Pal, T. On multi-objective covering salesman problem. Neural Comput & Applic 34, 22127–22140 (2022). https://doi.org/10.1007/s00521-022-07683-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-022-07683-7

Keywords

Search

Navigation