The Pyramidal Method for Traveling Salesman Problem
The Pyramidal Method for Traveling Salesman Problem
Author(s): Štefan PeskoSubject(s): Methodology and research technology, Transport / Logistics
Published by: Žilinská univerzita v Žilině
Keywords: Traveling Salesman; Pyramidal Method; Problem;
Summary/Abstract: 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.
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 2/2000
- Issue No: 4
- Page Range: 29-34
- Page Count: 6
- Language: Slovak, English