THE IMPORTANT IS THE RESTRICTED DAY (3 DAYS). OTHER RESTRICTIONS ARE OPTIONAL (DAILY KM LIMIT, DAILY VISIT LIMIT ....) OPTIONAL RESTRICTIONS WILL BE CREATED AND AN OPTIMIZATION FORMULA WILL BE OBTAINED. THE TRAVELING SELLER'S PROBLEM CAN ALSO BE SOLVED.

NOTE: DISTANCE BETWEEN A AND B IS EQUALS TO THE DISTANCE BETWEEN B AND A.

NOTE2: THOSE WHO FIND THE ROUTE TO ACHIEVE THE OPTIMUM RESULT CAN ALSO SHARE

THE DISTANCES OF DOTS TO EACH OTHER ARE GIVEN IN THE TABLE.(There are 2 people in city A, J and L, 3 people in city Cand I, and 1 person in other cities.) AT LEAST ONE PERSON MUST BE VISITED IN A DAY. THERE ARE 3 DAYS AND A VEHICLE FOR THE TRAVEL.FIND THE SHORTEST ROAD SCHEME WHEN THESE DISTANCES ARE CONSIDERED.WRITE THE OPTIMIZATION FORMULA. B C D E F G H 3 K L N o AO KM 26 KM 71 KM 67 KM 9,3 KM 69 KM 26 KM 26 KM 22 KM 76 KM 67 KM 2,6 KM 0,15 KM 62 KM 24 KM B 26 KM OKM 87 KM 97 KM 19 KM 91 KM 41 KM 42 KM 21 KM 92 KM 83 KM 24 KM 22 KM 79 KM 41 KM C 71 KM 87 KM OKM 8,2 KM 67 KM 10 KM 62 KM 42 KM 80 KM 12 KM 6,9 KM 63 KM 65 KM 20 KM 44 KM D 67 KM 97 KM 8,2 KM OKM 79 KM 7,8 KM 69 KM 47 KM 95 KM 8,3 KM 11 KM 82 KM 80 KM 24 KM 48 KM E 9,3 KM 19 KM 67 KM 79 KM OKM 75 KM 26 KM 27 KM 18 KM 77 KM 68 KM 6,6 KM 4,4 KM 64 KM 26 KM F 69 KM 91 KM 10 KM 7.8 KM 75 KM O KM 64 KM 49 KM 90 KM 2,6 KM 21 KM 76 KM 74 KM 19 KM 54 KM G 26 KM 41 KM 62 KM 69 KM 26 KM 64 KM OKM 18 KM 40 KM 68 KM 58 KM 27 KM 25 KM 54 KM 16 KM H 26 KM 42 KM 42 KM 47 KM 27 KM 49 KM 18 KM O KM 38 KM 58 KM 39 KM 25 KM 23 KM 45 KM 2,1 KM I 22 KM 21 KM 80 KM 95 KM 18 KM 90 KM 40 KM 38 KM OKM 92 KM 68 KM 20 KM 22 KM 79 KM 41 KM J 76 KM 92 KM 12 KM 8,3 KM 77 KM 2,6 KM 68 KM 58 KM 92 KM OKM 22 KM 78 KM 76 KM 20 KM 55 KM K 67 KM 83 KM 6,9 KM 11 KM 68 KM 21 KM 58 KM 39 KM 68 KM 22 KM 0 60 KM 61 KM 16 KM 40 KM L2,6 KM 24 KM 63 KM 82 KM 6,6 KM 76 KM 27 KM 25 KM 20 KM 78 KM 78 KM OKM 2,5 KM 77 KM 27 KM M 0,15 KM 22 KM 65 KM 80 KM 4,4 KM 74 KM 25 KM 23 KM 22 KM 76 KM 76 KM 2,5 KM O KM 63 KM 25 KM N 62 KM 79 KM 20 KM 24 KM 64 KM 19 KM 54 KM 45 KM 79 KM 61 KM 20 KM 77 KM 63 KM O KM 43 KM O 24 KM 41 KM 44 KM 48 KM 26 KM 54 KM 16 KM 2,1 KM 41 KM 2,5 KM 55 KM 27 KM 25 KM 43 KM O KM THE DISTANCES OF DOTS TO EACH OTHER ARE GIVEN IN THE TABLE.(There are 2 people in city A, J and L, 3 people in city Cand I, and 1 person in other cities.) AT LEAST ONE PERSON MUST BE VISITED IN A DAY. THERE ARE 3 DAYS AND A VEHICLE FOR THE TRAVEL.FIND THE SHORTEST ROAD SCHEME WHEN THESE DISTANCES ARE CONSIDERED.WRITE THE OPTIMIZATION FORMULA. B C D E F G H 3 K L N o AO KM 26 KM 71 KM 67 KM 9,3 KM 69 KM 26 KM 26 KM 22 KM 76 KM 67 KM 2,6 KM 0,15 KM 62 KM 24 KM B 26 KM OKM 87 KM 97 KM 19 KM 91 KM 41 KM 42 KM 21 KM 92 KM 83 KM 24 KM 22 KM 79 KM 41 KM C 71 KM 87 KM OKM 8,2 KM 67 KM 10 KM 62 KM 42 KM 80 KM 12 KM 6,9 KM 63 KM 65 KM 20 KM 44 KM D 67 KM 97 KM 8,2 KM OKM 79 KM 7,8 KM 69 KM 47 KM 95 KM 8,3 KM 11 KM 82 KM 80 KM 24 KM 48 KM E 9,3 KM 19 KM 67 KM 79 KM OKM 75 KM 26 KM 27 KM 18 KM 77 KM 68 KM 6,6 KM 4,4 KM 64 KM 26 KM F 69 KM 91 KM 10 KM 7.8 KM 75 KM O KM 64 KM 49 KM 90 KM 2,6 KM 21 KM 76 KM 74 KM 19 KM 54 KM G 26 KM 41 KM 62 KM 69 KM 26 KM 64 KM OKM 18 KM 40 KM 68 KM 58 KM 27 KM 25 KM 54 KM 16 KM H 26 KM 42 KM 42 KM 47 KM 27 KM 49 KM 18 KM O KM 38 KM 58 KM 39 KM 25 KM 23 KM 45 KM 2,1 KM I 22 KM 21 KM 80 KM 95 KM 18 KM 90 KM 40 KM 38 KM OKM 92 KM 68 KM 20 KM 22 KM 79 KM 41 KM J 76 KM 92 KM 12 KM 8,3 KM 77 KM 2,6 KM 68 KM 58 KM 92 KM OKM 22 KM 78 KM 76 KM 20 KM 55 KM K 67 KM 83 KM 6,9 KM 11 KM 68 KM 21 KM 58 KM 39 KM 68 KM 22 KM 0 60 KM 61 KM 16 KM 40 KM L2,6 KM 24 KM 63 KM 82 KM 6,6 KM 76 KM 27 KM 25 KM 20 KM 78 KM 78 KM OKM 2,5 KM 77 KM 27 KM M 0,15 KM 22 KM 65 KM 80 KM 4,4 KM 74 KM 25 KM 23 KM 22 KM 76 KM 76 KM 2,5 KM O KM 63 KM 25 KM N 62 KM 79 KM 20 KM 24 KM 64 KM 19 KM 54 KM 45 KM 79 KM 61 KM 20 KM 77 KM 63 KM O KM 43 KM O 24 KM 41 KM 44 KM 48 KM 26 KM 54 KM 16 KM 2,1 KM 41 KM 2,5 KM 55 KM 27 KM 25 KM 43 KM O KM