The Transportation Manager for AM&L Northeast Region supports a network of five customers on a daily basis. The customers are supported through the use of two delivery trucks. AM&L employs the Savings approach in the Northeast Region. The Transportation Manager wants to determine the routes the trucks will take, which stops should be made on the routes, and which sequence the stops should be served by the route trucks. How should the truck tours be sequences as to minimize total ton miles? You must show savings calculation to receive credit! DC A B D E F DC 0 164 135 83 86 112 94 A 164 0 145 249 243 227 140 B 135 145 0 180 222 250 200 C 83 249 180 72 139 169 86 243 222 72 66 126 112 227 250 139 66 185 94 140 200 169 126 0 Separate Combined Savings 598 444 154 494 496 -2 500 493 7 552 503 49 516 398 118 436 398 38 442 443 -1 494 497 -3 458 429 29 338 241 97 390 334 56 354 346 8 396 264 132 360 306 54 412 292 120 D E F Route AB AC AD AE 24244828 AF BC BD BE BF CD CE CF DE DF EF 0 0 0 86 0 145 200 249 227 222 250 164 243 135 180 DC 94 169 fo 126 86 U 72 139 112 66 86 E 140 Please note: you do not have to keep the locations in the same order when building routes. For example, let's assume the pairs having the greatest savings were AB, CD, and EF (don't use these for your solution!). The possible combinations would be: ABCD, ABEF, CDEF When determining the combined distance, you should first circle the four points on the above diagram. You should then apply the heuristics of no crossed paths and a "tear drop shape. Simply start at the DC and then draw a "loop" through the points that returns to the DC. You can start with any of the four points. If you take this approach, then you will select the order that produces the most savings. If your route crosses paths, doubles back, or does something that increases miles, then you will not obtain the most savings and will most likely lose points! D