SEARCHING OF OPTIMAL VERTICES IN A HAPHAZARD ROUTES

Abstract

In this paper we are going to develop a new and efficient algorithm for finding a shortest cyclic tour of the network with the repetition of each vertex at least once. Problem under consideration is a traveling salesman problem, for repeating vertex. Penalizing the distance and choosing the shortest tour has been achieved from the weighted matrix of the graph