Results 1  10
of
2,288
On Random Symmetric Travelling Salesman Problems
, 2002
"... Let the edges of the complete graph K be assigned independent uniform [0, 1] ran dom edge weights. Let Zrsp and Z2FAC be the weights of the minimum length trav elling salesman tour and minimum weight 2factor respectively. We show that whp IZTsP  Z2FACI = o(1). The proof is via by the analys ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Let the edges of the complete graph K be assigned independent uniform [0, 1] ran dom edge weights. Let Zrsp and Z2FAC be the weights of the minimum length trav elling salesman tour and minimum weight 2factor respectively. We show that whp IZTsP  Z2FACI = o(1). The proof is via
Euclidean symmetric traveling salesman problems
, 2006
"... The main objective of the Working Paper series of IIMA is to help faculty members, research staff, and doctoral students to speedily share their research findings with professional colleagues and to test out their research findings at the prepublication stage. ..."
Abstract
 Add to MetaCart
The main objective of the Working Paper series of IIMA is to help faculty members, research staff, and doctoral students to speedily share their research findings with professional colleagues and to test out their research findings at the prepublication stage.
Computing Compatible Tours for the Symmetric Traveling Salesman Problem
, 2010
"... We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution 푥∗, and then find the best tour 푥 ̄ that is compatible with 푥∗, where compatible means that every subtour elimination constraint that is satisfied at equality a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution 푥∗, and then find the best tour 푥 ̄ that is compatible with 푥∗, where compatible means that every subtour elimination constraint that is satisfied at equality
A New Polytope for Symmetric Traveling Salesman Problem
"... The classical polytope associated with the symmetric traveling salesman problem (STSP) is usually studied as embedded in the standard subtour elimination polytope. Several classes of facet deflning inequalities of the STSP polytope are used in practical enumeration algorithms. In this paper we cons ..."
Abstract
 Add to MetaCart
The classical polytope associated with the symmetric traveling salesman problem (STSP) is usually studied as embedded in the standard subtour elimination polytope. Several classes of facet deflning inequalities of the STSP polytope are used in practical enumeration algorithms. In this paper we
On an Application of Pedigree Approach to Symmetric Traveling Salesman Problem
"... Arthanari[3] gave an alternative formulation for the symmetric traveling salesman problem(STSP), based on multi stage insertion decisions. In a recent paper Arthanari and Usha[7] study some of the properties of this formulation. The classical STSP polytope is generally studied as embedded in the st ..."
Abstract
 Add to MetaCart
Arthanari[3] gave an alternative formulation for the symmetric traveling salesman problem(STSP), based on multi stage insertion decisions. In a recent paper Arthanari and Usha[7] study some of the properties of this formulation. The classical STSP polytope is generally studied as embedded
Improvements to the Oropt Heuristic for the Symmetric Traveling Salesman Problem
, 2005
"... Several variants and generalizations of the Oropt heuristic for the Symmetric Traveling Salesman Problem are developed and compared on random and planar instances. Some of the proposed algorithms are shown to significantly improve upon the standard 2opt and Oropt heuristics. Key words: symmetric ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Several variants and generalizations of the Oropt heuristic for the Symmetric Traveling Salesman Problem are developed and compared on random and planar instances. Some of the proposed algorithms are shown to significantly improve upon the standard 2opt and Oropt heuristics. Key words: symmetric
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
 Proceedings of the Fifth Conference on Evolutionary Computation in Combinatorial Optimization, volume 3448 of LNCS
, 2005
"... Abstract. We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the LinKernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the LinKernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge
Abstract — Simple Symmetric Traveling Salesman Problem
"... (TSP) has a combinational nature. When there are 25 or more cities to visit, brute force search is not feasible. Instead, heuristic & probabilistic search methods are more reasonable for obtaining optimal solutions. In this paper, Genetic algorithm and crossover are researched and a novel crosso ..."
Abstract
 Add to MetaCart
crossover(CX) and is found that proposed crossover has outperformed the rest in all the problems..
Exploiting planarity in separation routines for the symmetric traveling salesman problem
, 2005
"... At present, the most successful approach to solving largescale instances of the Symmetric Traveling Salesman Problem to optimality is branchandcut. The success of branchandcut is due in large part to the availability of effective separation procedures; that is, routines for identifying violated ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
At present, the most successful approach to solving largescale instances of the Symmetric Traveling Salesman Problem to optimality is branchandcut. The success of branchandcut is due in large part to the availability of effective separation procedures; that is, routines for identifying
A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem
"... Abstract—This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by mov ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract—This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution
Results 1  10
of
2,288