2020
DOI: 10.1080/13873954.2019.1705496
|View full text |Cite
|
Sign up to set email alerts
|

Selective generalized travelling salesman problem

Abstract: This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour's duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 28 publications
0
3
0
Order By: Relevance
“…We show that optimizing certain special cases of MBDCS problem is equivalent to finding a Hamiltonian cycle with minimum cost from the input graph, which is the same as that for the TSP. Meanwhile, we note that several generalizations of TSP, such as SCGTSP [36] , PCGTSP [37] and GTSP-TW [38] , have been studied in the current literature. Most of these studies investigate their generalized problems from the real-word applications perspective, which rather differs from the motivation of this study.…”
Section: Introductionmentioning
confidence: 99%
“…We show that optimizing certain special cases of MBDCS problem is equivalent to finding a Hamiltonian cycle with minimum cost from the input graph, which is the same as that for the TSP. Meanwhile, we note that several generalizations of TSP, such as SCGTSP [36] , PCGTSP [37] and GTSP-TW [38] , have been studied in the current literature. Most of these studies investigate their generalized problems from the real-word applications perspective, which rather differs from the motivation of this study.…”
Section: Introductionmentioning
confidence: 99%
“…To measure the obtained result, all experiments will be carried out using TSP. TSP is difficult to solve and requires a lot of computational time to find optimal solutions, so most prefer to use heuristic techniques [49][50][51]. erefore, TSP was chosen to measure the efficiency of chaos in MBO.…”
Section: Introductionmentioning
confidence: 99%
“…| OBJECTIVE FUNCTION OF SELF-HEALING MODEIn this section, the TSPP has been used to develop the objective function for the self-healing system. TSPP has been utilized to handle many selling-based problems 28. The track between villages represents the transmission line…”
mentioning
confidence: 99%