Three Dimensional Constrained P-Tsp
Y Sreenuvasulu, R. Vijayalakshmi, Somasekhar Srinivas .V K, M Sundaramurthy · IOSR Journal of Mathematics · 2016
Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called THREE DIMENSIONAL CONSTRAINED P-TSP.Let there be n cities and the distance/cost matrix D(i, j, k) is given from i th city to j th city in k th season.Each of P salesmen starts in first season from Headquarter city '1 'and visits few cities in that season then he enter into next season and visits some more cities in that season and reaches to Headquarter city on or before the last season .The aim of the problem is to find p tours to the p salesmen which covers n-1 cities and the total distance /cost of the tours is minimum subject to the considerations .For this problem we developed a Lexi Search Algorithm using Pattern Recognition Technique .