In this article, we model an “Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility” (ICCSTSPC), a generalization of Covering Salesman Problem (CSP), in fuzzy environment. A salesman begins from an initial node, visits a subset of nodes exactly once using any one of appropriate vehicles available at each step, so that unvisited nodes are within a predetermined distance from the visited nodes, and returns to the initial node within a restricted time. Here the travelling costs and travelling times between any two nodes and the covering distance all are considered as fuzzy. Thus the problem reduces to find the optimal tour for a set of nodes with the proper conveyances so that total travelling cost is minimum within a restricted time. The ICCSTSPC is reduced to a set of Imprecise Constrained Covering Solid Travelling Salesman Problems by solving Unicost Set Cover Problem (USCP) using Random Insertion-Deletion (RID). These reduced Constrained Solid Travelling Salesman Problems (CSTSPs) are solved by an Improved Genetic Algorithm (IGA), which consists of probabilistic selection, order crossover, proposed generation dependent inverse mutation. A random mutation for vehicles is proposed to get a better cost at each generation of IGA by choosing an alternative vehicle for each node. Hence the ICCSTSPC is solved by a random insertion-deletion (RID) for covering set and IGA, i.e., RID-IGA. To justify the performance of the RID-IGA, some test problems are solved. The model is illustrated with some randomly generated crisp and fuzzy data.
Solid TSP Covering Salesman Problem Improved GA
This is a preview of subscription content, log in to check access.
Chang, T., Wan, Y., Tooi, W.: A stochastic dynamic travelling salesman problem with hard time windows. Eur. J. Oper. Res. 198(3), 748–759 (2009)CrossRefzbMATHGoogle Scholar
Maity, S., Roy, A., Maiti, M.: A modified genetic algorithm for solving uncertain constrained solid travelling salesman problems. Comput. Ind. Eng. 83, 273–296 (2015)CrossRefGoogle Scholar
Majumder, A.K., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235(9), 3063–3078 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
Mestria, M., Ochi, L.S., Martins, S.L.: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Comput. Oper. Res. 40(12), 3218–3229 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
Moon, C., Ki, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606–617 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
Salari, M., Reihaneh, M., Sabbagh, M.S.: Combining ant colony optimization algorithm and dynamic programming technique for solving the covering salesman problem. Comput. Ind. Eng. 83, 244–251 (2015)CrossRefGoogle Scholar