Problem Definition: TSPPC is an extended version of the basic traveling salesman problem. There are $N$ lacations in TSPPC$,$ and the location labeled $"1"$ represents the storage point. The traveling salesman must visit all locations starting from the warehouse point and return to the warehouse point again. The main distinguishing feature of TSPPC is the priority relationship between the lacations to be visited. The priority relationships of the lacations are labeled $1-5,$ and the lacation with a lew priority value should be visited before all locations with a high priority value. Locations that do not have a pribrity value are labeled with $0$ and these locations can be visited in any order within the raute. The purpose of the problem is to determine the route that will provide the shortest circulation to the traveling seller within the priority order canstraints.

The developed algarithm $($detailed below$)$ needs to read the problem data, solve the problem and save the result as an output file. In this context, the basic flow of the algorithm is reading data, solving peobleos and writing the output file. The algarithm needs to be caded in Visual Basic using the Tabu algorithm.

Problem Data: Within the scope of the project, TSPPC data will be read from a $.$txt file. The structure of the text file:

$\backslash$table$[[$Location$,$X Coordinate,$Y$ Coordinate,Precedence Label$],[1,x_1,y_3,],[2,x_2,y_2,1],[3,x_3,y_1,0],[+,,,$vdots