Solution for Modified Traveling Salesman Problem with Variable Cost Matrix Using Bacterial Evolutionary Algorithm

Abstract

The aim of the Traveling Salesman Problem (TSP) is to find the cheapestway of visiting all elements in a given set of cities and returning to thestarting point. In solutions presented in the literature costs of travelbetween nodes (cities) are based on Euclidian distances, the problem issymmetric and the costs are constant. In this paper a novel construction andformulation of the TSP is presented in which the requirements and featuresof practical application in road transportation and supply chains are takeninto consideration. In the paper numerical examples are presented as well.