In this study, we present a new hybrid heuristic algorithm for the Clustered Traveling Salesman Problem (CTSP). The CTSP is NP NP mathContainer Loading Mathjax -hard because it includes the well-known Traveling
The clustered traveling salesman problem Computers & Operations Research, 2 (2) (1975), pp. 115-119 View PDFView articleView in ScopusGoogle Scholar Clímaco et al., 2021 Clímaco G., Simonetti L., Rosseti I. A branch-and-cut and MIP-based heuristics for the prize-collecting travelling sa...
Chisman, J.A.: The clustered travelling salesman problem. Comp. Operat. Res. 2, 115–119 (1975) CrossRef Ding, C., Cheng, Y., He, M.: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Sci. Technol. 12, 459–465 (200...
The Traveling Salesman Problem with Job-times (TSPJ) is an extension problem that integrates the Traveling Salesman Problem and the Job Scheduling Problem. TSPJ refers to finding the optimal route for a salesman to visit each location exactly once while assigning one job to each location. Each ...
theproblemreducestothestandardTravelingSalesmanProblem( ).On theotherhand,ifnoneofthenodesareflexible,suchthateachnodemustbe paintedwithaspecificcolor(i.e.,| |=1∀ ),thentheproblembecomesthe ClusteredTravelingSalesmanProblem( ),firstintroducedbyChisman (1975). AhmadiandMamer(1999)provideamanuf...
MSPDTSP is the combination of GTSP (generalized traveling salesman problem) and CTSP (clustered traveling salesman problem), and it is also a variant of CGTSP (clustered generalized traveling salesman problem). According to Baniasadi et al. [5], GTSP is to visit each cluster once and find ...
This problem is called theRailway Traveling SalesmanProblemand was introduced by Hadjicharalambous et al. [67].The RTSP is related to the Generalized Traveling Salesman Problem (GTSP), inwhich a clustered graph is given and a round trip of minimal length, connecting ex-actly one node per ...
The Traveling Salesman Problem (TSP) is a classical discrete combinatorial optimization problem that is widely applied in various domains, including robotics, transportation, networking, etc. Although existing studies have provided extensive discussions of the TSP, the issues of improving convergence and ...
On one side, we have a very clustered network where the nodes are regionally connected to one another similar to a lattice. And once we add the airways, shortcuts are created contracting the path length between previously distant nodes. Figure 3 Transition from G1 to G2: clustering ...
The colored traveling salesman problem (CTSP) generalizes the well-known multiple traveling salesman problem by utilizing colors to describe the accessibility of cities to individual salesmen. Many centralized algorithms have been developed to solve CTSP instances. This work presents a distributed solving...