RT Journal Article
SR Electronic
A1 Pesko, Stefan
T1 The Pyramidal Method for Traveling Salesman Problem
JF Communications - Scientific Letters of the University of Zilina
YR 2000
VO 2
IS 4
SP 29
OP 34
DO 10.26552/com.C.2000.4.29-34
UL https://komunikacie.uniza.sk/artkey/csl-200004-0004.php
AB 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.