14. In the Euclidean TSP, vertices are randomly placed in some square box (see Figure 12.37). No cost matrix is provided, as the distance between two points, P1 and P2, can be calculated by:

d(P1, P2) = sqrt((x2 – x1)2 + (y2 – y1)2). Write a program to solve an instance of the Euclidean TSP when n = 25 by using

a. SA

b. GA

c. Tabu Search

d. Experiment with various values of d (the number of cuts—consult discussion in Section 12.1).

e. Try various population sizes for Part b of this question. Discuss your results.