The Pyramidal Method for Traveling Salesman Problem
No Thumbnail Available
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Communications - Scientific Letters of the University of Zilina
Lang
Abstract
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.
Keywords
no keywords