Question about shortest path problem using solvers

[Napzz]

I am trying to figure out the shortest path of going from location 1 to 10.
The path should start with location 1 and end with location 10 and go through each intermediate site (location 2-9) exactly once.
I have tried different ways (eg. Net flow etc...) to solve the problem but in vain.
I wonder what would be the method of solving it by using Simplex LP Solver/ Evolutionary Solver?

Below is the distance and my format so far.

x.xlsx
	A	B	C	D	E	F	G	H	I	J	K	L	M	N	O	P	Q	R	S	T
3
4
5		1	2	3	4	5	6	7	8	9	10					Origin	Dest	Distance	Flow
6	1	0.0	119.5	176.0	103.0	191.5	111.5	148.0	123.5	124.0	118.0					1	2	119.5
7	2	119.5	0.0	141.5	178.0	166.5	197.5	172.0	148.5	184.0	144.5					1	3	176
8	3	176.0	141.5	0.0	155.5	110.5	107.0	161.5	141.5	128.0	178.0					1	4	103
9	4	103.0	178.0	155.5	0.0	144.0	127.0	189.0	183.0	132.5	129.5					1	5	191.5
10	5	191.5	166.5	110.5	144.0	0.0	164.5	151.0	151.0	121.5	126.5					1	6	111.5
11	6	111.5	197.5	107.0	127.0	164.5	0.0	153.0	178.5	175.0	142.0					1	7	148
12	7	148.0	172.0	161.5	189.0	151.0	153.0	0.0	152.5	183.5	118.5					1	8	123.5
13	8	123.5	148.5	141.5	183.0	151.0	178.5	152.5	0.0	167.0	165.5					1	9	124
14	9	124.0	184.0	128.0	132.5	121.5	175.0	183.5	167.0	0.0	133.5					1	10	118
15	10	118.0	144.5	178.0	129.5	126.5	142.0	118.5	165.5	133.5	0.0					2	1	119.5
16																2	3	141.5
17																2	4	178
18																2	5	166.5
19																2	6	197.5
20																2	7	172
21																2	8	148.5
22																2	9	184
23																2	10	144.5
24																3	1	176
25																3	2	141.5
26																3	4	155.5
27																3	5	110.5
28																3	6	107
29																3	7	161.5
30																3	8	141.5
31																3	9	128
32																3	10	178
33																4	1	103
34																4	2	178
35																4	3	155.5
36																4	5	144
37																4	6	127
38																4	7	189
39																4	8	183
40																4	9	132.5
41																4	10	129.5
42																5	1	191.5
43																5	2	166.5
44																5	3	110.5
45																5	4	144
46																5	6	164.5
47																5	7	151
48																5	8	151
49																5	9	121.5
50																5	10	126.5
51																6	1	111.5
52																6	2	197.5
53																6	3	107
54																6	4	127
55																6	5	164.5
56																6	7	153
57																6	8	178.5
58																6	9	175
59																6	10	142
60																7	1	148
61																7	2	172
62																7	3	161.5
63																7	4	189
64																7	5	151
65																7	6	153
66																7	8	152.5
67																7	9	183.5
68																7	10	118.5
69																8	1	123.5
70																8	2	148.5
71																8	3	141.5
72																8	4	183
73																8	5	151
74																8	6	178.5
75																8	7	152.5
76																8	9	167
77																8	10	165.5
78																9	1	124
79																9	2	184
80																9	3	128
81																9	4	132.5
82																9	5	121.5
83																9	6	175
84																9	7	183.5
85																9	8	167
86																9	10	133.5
87																10	1	118
88																10	2	144.5
89																10	3	178
90																10	4	129.5
91																10	5	126.5
92																10	6	142
93																10	7	118.5
94																10	8	165.5
95																10	9	133.5
96
97
98
Sheet1

Cell Formulas
Range	Formula
R6:R95	R6	=INDEX($B$6:$K$15,P6,Q6)

Named Ranges
Name	Refers To	Cells
Dest	=Sheet1!$Q$6:$Q$95	R6
Origin	=Sheet1!$P$6:$P$95	R6

 

[BSALV]

this is the classic salesman-problem
see for example Best Excel Tutorial - How to use Solver in Excel