A NEW TECHNIQUE FOR SOLVING A Z- TRAVELLING SALESMAN PROBLEM BY EMPLOYING BRANCH AND BOUND ALGORITHM

Abstract

In the Travelling Salesman Problem (TSP), the primary goal is to reduce both the travel costs and the distance travelled by the salesman. Various algorithms such as Brute Force algorithm, Nearest Neighbour algorithm, Genetic Algorithm, and Ant Colony Optimization (ACO) have been developed to determine optimal solutions for the TSP. This article explores the TSP with pentagonal Z-number costs or distances using the Branch and Bound (BnB) algorithm.