Advertisement

Constrained covering solid travelling salesman problems in uncertain environment

  • Anupam Mukherjee
  • Goutam Panigrahi
  • Samarjit KarEmail author
  • Manoranjan Maiti
Original Research

Abstract

In this paper, we introduce some constrained covering solid travelling salesman problems (CCSTSPs). In CCSTSPs, a salesman begins from an initial city, visits a subset of cities exactly once using any one of available vehicles at each step on the tour such that all other cities are covered within an imprecise predetermined distance and comes back to the initial city within a restricted time. Here, the travelling costs between the cities are considered as rough variables where the covering distance is taken as fuzzy and rough variable separately. A travel time constraint has been imposed where the time variable may be represented as rough variable. We develop an RID-MGA heuristics to solve the proposed model in trust measure and justify its performance by comparing some best known result of some benchmark problems and then solve experiment with some randomly generated data. Sensitivity analyses on RID-MGA are also performed with respect to different population size and number of generations. Finally, following the proposed model, some near optimal paths which could have been implemented for humanitarian delivery service due to the earthquake of Nepal (\(25{\text {th}}\) April, 2015) is obtained by RID-MGA.

Keywords

Covering salesman problem Generation dependent mutation Genetic algorithm Solid TSP 

Notes

Compliance with ethical standards

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Ethical approval

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

Informed consent

Informed consent was obtained from all individual participants included in the study.

References

  1. Al-Shihabi S, Arafeh M, Barghash M (2015) An improved hybrid algorithm for the set covering problem. Comput Ind Eng 85:328–334CrossRefGoogle Scholar
  2. Chakraborty D, Jana DK, Roy TK (2015) A new approach to solve multi-objective multi-choice multi-item Atanassov’s intuitionistic fuzzy transportation problem using chance operator. J Intell Fuzzy Syst 28(2):843–865MathSciNetzbMATHGoogle Scholar
  3. Chang T, Wan Y, Tooi W (2009) A stochastic dynamic travelling salesman problem with hard time windows. Eur J Oper Res 198(3):748–759CrossRefzbMATHGoogle Scholar
  4. Changdar C, Maiti MK, Maiti M (2013) A constrained solid TSP in fuzzy environment: two heuristic approaches. Iran J Fuzzy Syst 10(1):1–28MathSciNetzbMATHGoogle Scholar
  5. Current JR, Schilling DA (1989) The covering salesman problem. Transp Sci 23(3):208–213MathSciNetCrossRefzbMATHGoogle Scholar
  6. Deb K, Agarwal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115–148MathSciNetzbMATHGoogle Scholar
  7. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197CrossRefGoogle Scholar
  8. Fischetti M, Salazar Gonzlez JJ, Toth P (1997) A branch and cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378394MathSciNetCrossRefGoogle Scholar
  9. Galiniera P, Hertzb A (2007) Solution techniques for the large set covering problem. Discrete Appl Math 155:312–326MathSciNetCrossRefGoogle Scholar
  10. Golden BL, Naji-Azimi Z, Raghavan S, Salari M, Toth P (2012) The generalized covering salesman problem. INFORMS J Comput 24(4):534–553MathSciNetCrossRefzbMATHGoogle Scholar
  11. Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568576MathSciNetzbMATHGoogle Scholar
  12. Hachicha M, Hodgson MJ, Laporte G, Semet F (2000) Heuristics for the multi-vehicle covering tour problem. Comput Oper Res 27:29–42CrossRefzbMATHGoogle Scholar
  13. International Business Times (2015) Nepal earthquake death toll rises to 8,413. http://www.ibtimes.co.in/nepal-earthquake-death-toll-rises-8413-631650. Accessed 7 May 2015
  14. Khanra A, Maiti MK, Maiti M (2015) Profit maximization of TSP through a hybrid algorithm. Comput Ind Eng 88:229–236CrossRefGoogle Scholar
  15. Kundu P, Kar MB, Kar S, Pal T, Maiti M (2015) A solid transportation model with product blending and parameters as rough variables. Soft Comput 21(9):2297–2306CrossRefzbMATHGoogle Scholar
  16. Labbé M, Laporte G, Martn IR, Salazar Gonzlez JJ (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43(3):177189MathSciNetCrossRefGoogle Scholar
  17. Lan G, DePuy GW (2006) On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput Ind Eng 51:362–374CrossRefGoogle Scholar
  18. Liu F, Zeng G (2008) Study of genetic algorithm woth reinforcement learning to solve the TSP. Expert Syst Appl 36(3):6995–7001CrossRefGoogle Scholar
  19. Liu YH (2010) Different initial solution generators in genetic algorithms for solving the probabilistic travelling salesman problem. Appl Math Comput 216:125–137MathSciNetzbMATHGoogle Scholar
  20. Liu B (2002) Theory and practice of uncertain programming. Physica-Verlag, HeidelbergCrossRefzbMATHGoogle Scholar
  21. Liu B (2004) Uncertainty theory: an introduction to its axiomatic foundations. Springer, BerlinCrossRefzbMATHGoogle Scholar
  22. Liu B (2002) Theory and practice of uncertain programming. Springer, Berlin, p 258CrossRefGoogle Scholar
  23. Maity S, Roy A, Maiti M (2015) A modified genetic algorithm for solving uncertain constrained solid travelling salesman problems. Comput Ind Eng 83:273–296CrossRefGoogle Scholar
  24. Majumder j, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235(9):3063–3078MathSciNetCrossRefzbMATHGoogle Scholar
  25. Mestria M, Ochi LS, Martins SL (2013) GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Comput Oper Res 40(12):3218–3229MathSciNetCrossRefzbMATHGoogle Scholar
  26. Moon C, Ki J, Choi G, Seo Y (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur J Oper Res 140:606–617MathSciNetCrossRefzbMATHGoogle Scholar
  27. Nagata Y, Soler D (2012) A new genetic algorithm for the asymmetric travelling salesman problem. Expert Syst Appl 39:8947–8953CrossRefGoogle Scholar
  28. Pramanik S, Jana DK, Maiti M (2015) A fixed charge multi-objective solid transportation problem in random fuzzy environment. J Intell Fuzzy Syst 28:2643–2654MathSciNetCrossRefzbMATHGoogle Scholar
  29. Ren Z, Feng Z, Ke L, Zhang Z (2010) New ideas for applying ant colony optimization to the set covering problem. Comput Ind Eng 58:774–784CrossRefGoogle Scholar
  30. Salari M, Naji-Azimi Z (2012) An integer programming-based local search for the covering salesman problem. Comput Oper Res 39:2594–2602MathSciNetCrossRefzbMATHGoogle Scholar
  31. 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–251CrossRefGoogle Scholar
  32. Sapkota N, Reilly CH (2011) Simulating realistic set covering problems with known optimal solutions. Comput Ind Eng 61:39–47CrossRefGoogle Scholar
  33. United States Geological Survey (2015) M7.8 36 km E of Khudi, Nepal. Accessed 12 May 2015Google Scholar
  34. Xudong S, Yunlong X (2013) An improved adaptive genetic algorithm. In: International conference on education technology and management science (ICETMS)Google Scholar
  35. Yang J, Wu C, Lee HP, Liang Y (2008) Solving travelling salesman problems using generalized chromosome genetic algorithm. Nat Sci 18:887–892Google Scholar
  36. Zadeh LA (1994) Fuzzy logic and soft computing: issues, contentions and perspectives. In: Proceedings of \(IIZUKA\) 94 third international conference on fuzzy (1994) logic, neural nets and soft computing, vol 1–2. Iizuka, JapanGoogle Scholar
  37. Zhao F, Sun J, Li S, Liu W (2009) A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery. Int J Autom Comput 06(1):97–102CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of MathematicsNational Institute of Technology DurgapurDurgapurIndia
  2. 2.Department of Applied MathematicsVidyasagar universityMidnaporeIndia

Personalised recommendations