Results 11  20
of
2,288
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 205 (7 self)
 Add to MetaCart
An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull
New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
 World Applied Sciences Journal
"... Abstract: Traveling Salesman Problem (TSP) is a famous and classic operation for combination of optimization problems which is very used. Many complex issues can be modeled as traveling salesman problems. Since TSP is a NPcomplete problem, certain algorithms cannot be used for solving it. Hence heu ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract: Traveling Salesman Problem (TSP) is a famous and classic operation for combination of optimization problems which is very used. Many complex issues can be modeled as traveling salesman problems. Since TSP is a NPcomplete problem, certain algorithms cannot be used for solving it. Hence
The Satellite List and New Data Structures for Symmetric Traveling Salesman Problems
, 2004
"... Abstract — The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour operations as traversal and subpath reversal considerably influence algorithm design and performance. W ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract — The problem of data representation is fundamental to the efficiency of search algorithms for the traveling salesman problem (TSP). The computational effort required to perform such tour operations as traversal and subpath reversal considerably influence algorithm design and performance
Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem
"... The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have proposed several versions of greedy crossover. Here we propose improv ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have proposed several versions of greedy crossover. Here we propose
On the HeldKarp Relaxation for the Asymmetric and Symmetric Traveling Salesman Problems
, 2003
"... ..."
Parallel Branch and Bound model using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem
"... Abstract—Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem”. In this paper we have ..."
Abstract
 Add to MetaCart
have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem”. We reviewed some of already available algorithms and felt that there is need of new algorithm which should give
A description, analysis, and comparison of a hardware and a software implementation of the SPLASH genetic algorithm for optimizing symmetric traveling salesman problems
, 1996
"... This thesis presents Splash 2 hardware and HP PARISC software implementations of a genetic algorithm for symmetric traveling salesman problems, providing an analysis and comparison of the implementations. Despite an 11 times clock rate disadvantage, the hardware outperformed the software executing ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This thesis presents Splash 2 hardware and HP PARISC software implementations of a genetic algorithm for symmetric traveling salesman problems, providing an analysis and comparison of the implementations. Despite an 11 times clock rate disadvantage, the hardware outperformed the software executing
Efficient Separation Routines for the Symmetric Traveling Salesman Problem II: Separating multi Handle Inequalities
, 2001
"... This paper is the second in a series of two papers dedicated to the separation problem in the symmetric traveling salesman polytope. The first one gave the basic ideas behind the separation procedures and applied them to the separation of Comb inequalities. We here address the problem of separating ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
This paper is the second in a series of two papers dedicated to the separation problem in the symmetric traveling salesman polytope. The first one gave the basic ideas behind the separation procedures and applied them to the separation of Comb inequalities. We here address the problem of separating
Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, using Symmetric Travelling Salesman Problem
"... The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this pape ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators
Results 11  20
of
2,288