Results 1  10
of
501,354
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
Zakir H. Ahmed A Lexisearch Algorithm for the Bottleneck Traveling Salesman Problem
"... The bottleneck traveling salesman problem (BTSP) is a variation of the wellknown traveling salesman problem in which the objective is to minimize the maximum lap (arc length) in a tour of the salesman. In this paper, a lexisearch algorithm using adjacency representation for a tour has been develope ..."
Abstract
 Add to MetaCart
The bottleneck traveling salesman problem (BTSP) is a variation of the wellknown traveling salesman problem in which the objective is to minimize the maximum lap (arc length) in a tour of the salesman. In this paper, a lexisearch algorithm using adjacency representation for a tour has been
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
Dynamics of Local Search Heuristics for the Traveling Salesman Problem
"... Abstract—This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Oropt heuristic algorithm is chosen as the study subject, and the wellknown traveling salesman problem (TSP) serves as a problem t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Oropt heuristic algorithm is chosen as the study subject, and the wellknown traveling salesman problem (TSP) serves as a problem
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
IMPLEMENTATION OF HEURISTICS FOR SOLVING TRAVELLING SALESMAN PROBLEM USING NEAREST NEIGHBOUR AND NEAREST INSERTION APPROACHES
, 2013
"... The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minim ..."
Abstract
 Add to MetaCart
is minimized. This work adopts the nearest neighbour and nearest insertion algorithm to solve the well known travelling salesman problem. The algorithms were implemented using c # programming language of the dot Net framework.A sample of six cities were
Algorithms for the online quota traveling salesman problem
 Information Processing Letters
, 2004
"... Abstract. The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the online version of the problem, where ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract. The Quota Traveling Salesman Problem is a generalization of the well known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of the sales, minimizing the amount of time. In this paper we address the online version of the problem
MAXMIN Ant System and Local Search for the Traveling Salesman Problem
 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC'97)
, 1997
"... Ant System is a general purpose algorithm inspired by the study of the behavior of Ant Colonies. It is based on a cooperative search paradigm that is applicable to the solution of combinatorial optimization problems. In this paper we introduce MAX MIN Ant System, an improved version of basic Ant S ..."
Abstract

Cited by 137 (15 self)
 Add to MetaCart
System, and report our results for its application to symmetric and asymmetric instances of the well known Traveling Salesman Problem. We show how MAX MIN Ant System can be significantly improved extending it with local search heuristics. Our results clearly show that MAX MIN Ant System has
A RandomKey Genetic Algorithm for the Generalized Traveling Salesman Problem
 European Journal of Operational research
, 2004
"... The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find a minimumcost tour passing through one node from each cluster. We present an effective heuristic for this problem. The ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find a minimumcost tour passing through one node from each cluster. We present an effective heuristic for this 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
Results 1  10
of
501,354