The Pyramidal Method for Traveling Salesman Problem
A shortest pyramidal tour (SPT) is a well-solved case of TSP when a distance matrix is the Monge matrix. We study heuristic repeating method for SPT with the distance matrix without restriction. A new procedure for computing SPT is based on a shortest path in the network. Good results for solved the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2000-12-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-200004-0004_the-pyramidal-method-for-traveling-salesman-problem.php |
| Summary: | A shortest pyramidal tour (SPT) is a well-solved case of TSP when a distance matrix is the Monge matrix. We study heuristic repeating method for SPT with the distance matrix without restriction. A new procedure for computing SPT is based on a shortest path in the network. Good results for solved the Euclidean TSP instances with the stochastic version of the demonstrated method are presented. |
|---|---|
| ISSN: | 1335-4205 2585-7878 |