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 |
| _version_ | 1797847102651367424 |
|---|---|
| author | Stefan Pesko |
| author_facet | Stefan Pesko |
| author_sort | Stefan Pesko |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-09T18:06:55Z |
| format | Article |
| id | doaj.art-87f74093ca404e62a45d3f6946b3aeb5 |
| institution | Directory Open Access Journal |
| issn | 1335-4205 2585-7878 |
| language | English |
| last_indexed | 2024-04-09T18:06:55Z |
| publishDate | 2000-12-01 |
| publisher | University of Žilina |
| record_format | Article |
| series | Communications |
| spelling | doaj.art-87f74093ca404e62a45d3f6946b3aeb52023-04-14T06:29:06ZengUniversity of ŽilinaCommunications1335-42052585-78782000-12-0124293410.26552/com.C.2000.4.29-34csl-200004-0004The Pyramidal Method for Traveling Salesman ProblemStefan Pesko0Faculty of Management Science and Informatics, University of Zilina, Slovak RepublicA 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.https://komunikacie.uniza.sk/artkey/csl-200004-0004_the-pyramidal-method-for-traveling-salesman-problem.phpno keywords |
| spellingShingle | Stefan Pesko The Pyramidal Method for Traveling Salesman Problem Communications no keywords |
| title | The Pyramidal Method for Traveling Salesman Problem |
| title_full | The Pyramidal Method for Traveling Salesman Problem |
| title_fullStr | The Pyramidal Method for Traveling Salesman Problem |
| title_full_unstemmed | The Pyramidal Method for Traveling Salesman Problem |
| title_short | The Pyramidal Method for Traveling Salesman Problem |
| title_sort | pyramidal method for traveling salesman problem |
| topic | no keywords |
| url | https://komunikacie.uniza.sk/artkey/csl-200004-0004_the-pyramidal-method-for-traveling-salesman-problem.php |
| work_keys_str_mv | AT stefanpesko thepyramidalmethodfortravelingsalesmanproblem AT stefanpesko pyramidalmethodfortravelingsalesmanproblem |