Hi SAS community, It is with great interest that I read about the SAS PROC Optimization to visit all baseball stadiums, similar to the TSP (Traveling salesman problem). https://blogs.sas.com/content/operations/2018/06/13/visiting-all-30-major-league-baseball-stadiums-with-python-and-sas-viya/ I have the following data of 106 nodes (i.e., stations) and their connection via 103 unique arcs, like in a subway network, and I am interested in determining the optimal route to pass through each station, by minimizing the number of times one has to revisit. For simplicity, I could start my trip at I27 as a source sink. Would anyone know how to do this using the SAS optimization language. I am interested in learning this as a base, then adding complexity such as scheudling, etc. Also, can these optimization tools be run using SAS Enterprise Guide, or is it Viya only? Thank you very much for your time, -Carmine data original_data; input unique_arc $ node_1 $ node_2 $; datalines; 1 I27 I26 2 I26 I25 3 I25 I24 4 I24 I23 5 I23 I22 6 I22 I21 7 I21 I20 8 I20 I19 9 I19 I18 10 I18 I17 11 I17 I16 12 I16 I15 13 I15 I14 14 I14 I13 15 I13 I12_E7 16 I12_E7 I11 17 I11 I10_S6 18 I10_S6 I9 19 I9 I8 20 I8 I7 21 I7 I6 22 I6 I5 23 I5 I4_A8 24 I4_A8 I3 25 I3 I2 26 I2 I1 27 A20 A19 28 A19 A18 29 A18 A17_E11 30 A17_E11 A16 31 A16 A15_S9 32 A15_S9 A14 33 A14 A13 34 A13 A12 35 A12 A11 36 A11 A10 37 A10 A9_E20 38 A9_E20 I4_A8 39 I4_A8 A7 40 A7 A6 41 A6 A5 42 A5 A4 43 A4 A3 44 A3 A2 45 A2 A1 46 S21 S20 47 S20 S19 48 S19 S18 49 S18 S17 50 S17 S16 51 S16 S15 52 S15 S14 53 S14 S13 54 S13 S12 55 S12 S11_E13 56 S11_E13 S10 57 S10 A15_S9 58 A15_S9 S8 59 S8 S7 60 S7 I10_S6 61 I10_S6 S5 62 S5 S4 63 S4 S3 64 S3 S2 65 S2 S1_E27 66 E38 E37 67 E37 E36 68 E36 E35 69 E35 E34 70 E34 E33 71 E33 E32 72 E32 E31 73 E31 E30 74 E30 E29 75 E29 E28 76 E28 S1_E27 77 S1_E27 E26 78 E26 E25 79 E25 E24 80 E24 E23 81 E23 E22 82 E22 E21 83 E21 A9_E20 84 A9_E20 E19 85 E19 E18 86 E18 E17 87 E17 E16 88 E16 E15 89 E15 E14 90 E14 S11_E13 91 S11_E13 E12 92 E12 A17_E11 93 A17_E11 E10 94 E10 E9 95 E9 E8 96 E8 I12_E7 97 I12_E7 E6 98 E6 E5 99 E5 E4 100 E4 E3 101 E3 E2 102 E2 E1 103 E1 E28 ; run;
... View more