Corpus ID: 6949858

A NEW APPROACH TO SOLVE THE CLASSICAL SYMMETRIC TRAVELING SALESMAN PROBLEM BY ZERO SUFFIX METHOD

@inproceedings{Sudhakar2011ANA,
  title={A NEW APPROACH TO SOLVE THE CLASSICAL SYMMETRIC TRAVELING SALESMAN PROBLEM BY ZERO SUFFIX METHOD},
  author={V. Sudhakar and V. Kumar},
  year={2011}
}
This paper presents zero suffix method for solving the classical symmetric traveling salesman problem (TSP). It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed method an example is solved. Thus this paper shows that algorithm proposed is efficient for solving the TSPs. 
An Approach for Solving Traveling Salesman Problem
TLDR
A new approach for solving the traveling salesman problems (TSP) and a solution algorithm for a variant of this problem is introduced based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. Expand
Områdesindelad Hemtjänst - En studie i Norrköpings kommun för jämn arbetsbelastning och hög personalkontinuitet
I denna studie undersoks Linkopingsvagen 14-16 Hemtjanst, som ar ett av 20 distrikt i Norrkopings kommun, som enskilt ansvarar for hemtjansten i ett tilldelat geografiskt omrade. Linkopingsvagen 14Expand

References

SHOWING 1-10 OF 43 REFERENCES
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Abstract : An O(n sup 3) heuristic algorithm is described for solving n-city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves asExpand
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presentsExpand
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a generalExpand
The traveling-salesman problem and minimum spanning trees: Part II
TLDR
An efficient iterative method for approximating this bound closely from below is presented, and a branch-and-bound procedure based upon these considerations has easily produced proven optimum solutions to all traveling-salesman problems presented to it. Expand
A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems
  • C. Fiechter
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1994
TLDR
An efficient algorithm for getting almost optimal solutions of large traveling salesman problems is proposed, which uses the intermediate- and long-term memory concepts of tabu search as well as a new kind of move. Expand
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
We report the solution to optimality of ten large-scale symmetric travelling salesman problems. The travelling salesman problem (TSP) is one of the standard problems of the OperationsExpand
A restricted Lagrangean approach to the traveling salesman problem
TLDR
An algorithm for the asymmetric traveling salesman problem (TSP) using a new, restricted Lagrangean relaxation based on the assignment problem (AP) that can be adapted to the symmetric TSP by using the 2-matching problem instead of AP is described. Expand
Solution of large-scale symmetric travelling salesman problems
TLDR
The implementation is based on a fast LP-solver (IBM's MPSX) and makes effective use of polyhedral results on the symmetric travelling salesman polytope and describes the important ingredients of the code. Expand
Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems.
TLDR
Three implicit enumeration algorithms for solving the asymmetric traveling salesman problem with subtour elimination using the assignment problem relaxation similar to the previous approaches by Eastman, Shapiro and Bellmore and Malone are developed and computationally test. Expand
A new and efficient ant-based heuristic method for solving the traveling salesman problem
TLDR
The multiple ant clans concept from parallel genetic algorithms to search solution space using different islands to avoid local minima in order to obtain a global minimum for solving the traveling salesman problem is introduced. Expand
...
1
2
3
4
5
...