using excel solver i need to minimize the distance each team has to travel

the distance is represented by the yellow squares

(so for example for KU to travel to MW is 488 miles)

constraints

each place needs to have a #1 , #2 #3 and #4 seed

(there cannot be two number one seeds in the same place or any repeated seeds in any city )

this needs to be done in LP excel solver

if you can include screenshots of the solver thank you

place SOUTH MW EAST WEST TEAM SEED 1 1 1 1 488 838 104 1981 527 662 149 1319 1417 1910 1134 757 185 937 2339 795 664 993 1301 1131 1434 541 2581 1146 1097 708 2430 2 1302 1996 2 2 2 1897 1787 89 KU Baylor Dayton Gonzaga Creighton Florida St. Kentucky SDSU Duke MSU Villanova Seton Hall Wisconsin Oregon Maryland Louisville 3 474 421 558 81 3 3 3 4 13 223 584 631 284 1906 495 107 1174 1081 1546 1407 1151 1809 1423 957 2218 1912 2391 2432 1976 738 2637 2081 4 808 2916 196 4 4 650