Results 1  10
of
753,125
The Generalized Traveling Salesman Problem
"... The Generalized Traveling Salesman Problem (GTSP) is an extension of the wellknown Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant Colony ..."
Abstract
 Add to MetaCart
The Generalized Traveling Salesman Problem (GTSP) is an extension of the wellknown Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant
The Symmetric Generalized Travelling Salesman Polytope
, 1995
"... The symmetric Generalized Travelling Salesman Problem (GTSP) is a variant of the classical symmetric Travelling Salesman Problem, in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. A different version of the problem, called EGTSP, aris ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
The symmetric Generalized Travelling Salesman Problem (GTSP) is a variant of the classical symmetric Travelling Salesman Problem, in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. A different version of the problem, called E
Generalized Traveling Salesman Problem Reduction Algorithms
, 804
"... The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to presen ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper
A Memetic Algorithm for the Generalized Traveling Salesman Problem ∗
"... The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
The generalized traveling salesman problem (GTSP) is an extension of the wellknown traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies
Effective neighborhood structures for the generalized traveling salesman problem
 Evolutionary Computation in Combinatorial Optimisation – EvoCOP 2008, volume 4972 of LNCS
, 2008
"... Abstract. We consider the generalized traveling salesman problem in which a graph with nodes partitioned into clusters is given. The goal is to identify a minimum cost round trip visiting exactly one node from each cluster. For solving difficult instances of this problem heuristically, we present a ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Abstract. We consider the generalized traveling salesman problem in which a graph with nodes partitioned into clusters is given. The goal is to identify a minimum cost round trip visiting exactly one node from each cluster. For solving difficult instances of this problem heuristically, we present a
Heuristics for Sparse General Travelling Salesman Problems
"... Abstract: The wellknown travelling salesman problem can be expressed in graphtheoretic terms as follows: find a minimumweight Hamiltonian cycle in a connected edgeweighted graph G(N, A). vVe concentrate here on the problem where G is large and sparse, i.e., where INI is 500 or more and IAI is O ( ..."
Abstract
 Add to MetaCart
, the requirement that the cycle is Hamiltonian is often unnecessarily restrictive. It is sufficient in many practical problems, such as traffic planning. to address only what is called the General Travelling Salesman Problem, which requires merely a minimumweight, closed spanning walk, in which any node can
An Antbased Technique for the Dynamic Generalized Traveling Salesman Problem
"... Abstract: In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for other dynamic large scale NPhard problems encountered in telecommunications, transportation, netwo ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for other dynamic large scale NPhard problems encountered in telecommunications, transportation
A BranchandCut Algorithm for the Symmetric Generalized Travelling Salesman Problem
, 1995
"... We consider a variant of the classical symmetric Travelling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NPhard problem is known in the literature as the symmetric Generalized Travelling Salesman Problem (GT ..."
Abstract

Cited by 75 (4 self)
 Add to MetaCart
We consider a variant of the classical symmetric Travelling Salesman Problem in which the nodes are partitioned into clusters and the salesman has to visit at least one node for each cluster. This NPhard problem is known in the literature as the symmetric Generalized Travelling Salesman Problem
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
 GECCO ’07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, 2007, 158–167. Conclusion 15
"... Dividing the set of nodes into clusters in the wellknown traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost passing through only a single node from each cluster. In this paper, a discrete particle swarm optimization is presented t ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Dividing the set of nodes into clusters in the wellknown traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost passing through only a single node from each cluster. In this paper, a discrete particle swarm optimization is presented
A Hybrid Heuristic Approach for Solving the Generalized Traveling Salesman Problem
"... The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking for a minimum Hamiltonian tour visiting exactly one node from each cluster. In this paper, we combine the consultantguided ..."
Abstract
 Add to MetaCart
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking for a minimum Hamiltonian tour visiting exactly one node from each cluster. In this paper, we combine the consultant
Results 1  10
of
753,125