PP3, Toy Manufacturer
PP3, Toy Manufacturer
6/6/21 14:11
MITx CTL.SC1x
Help blagosp
Supply Chain Fundamentals
Course / Week 109 Transportation II < Freight Transportation Anal… / Practice Pr…
Previous Next
If you need some extra help to solve this problem, review the SC0x algorithms section in the Key Concepts Document.
You can also enroll in the current run of SC0x (it is free and always open). There you will find more videos and Practice Problems that
apply algorithms to transportation problems: https://www.edx.org/course/supply-chain-analytics-0
PP # Toy Manufacturer
As a supply chain specialist working for leading toy manufacturer, you are responsible for routing the vehicles to deliver finished goods
to six regional dealers. The regional dealers are identified with an ID.
These are the distances between the regional dealer locations and the distribution centers in miles.
Distance (miles) 1 2 3 4 5 6 DC
5 22.2 25.5
6 26.8
These are number of boxes of finished goods the regional dealers need.
Regional Dealer ID 1 2 3 4 5 6
Demand (Boxes) 42 28 35 29 48 23
Tip: Remember that the Savings algorithm is a heuristic algorithm. This means that the solution provided by the Savings algorithm will
not necessarily be the optimal solution to the problem.
Part 1
0 points possible (ungraded)
Calculating the distance savings when we pair dealers into a tour loop.
https://learning.edx.org/course/course-v1:MITx+CTL.SC1x_1+1T2…1+1T2021+type@vertical+block@cf380b78462b4292b047775ae53d9289 Página 1 de 6
Practice Problems | Week 10: Transportation II - Freight Transportation Analysis and Case Study | Supply Chain Fundamentals | edX 6/6/21 14:11
What is the distance saving to travel from the DC to dealer 1 and 6 and back to the DC versus delivering directly to each of them from the
DC and back?
21.2 !
21.2
What is the distance saving to travel from the DC to dealer 3 and 5 and back to the DC versus delivering directly to each of them from the
DC and back?
25.1 !
25.1
! Correct
Part 2
0 points possible (ungraded)
What is the greatest savings you can get from pairing two dealers in one tour? (Do not consider vehicle capacity for now)
30.60
Explanation
Short explanation
If we pair 4 and 5 we can save 36.3 miles.
What is the smallest savings you can get from pairing two dealers in one tour(Do not consider vehicle capacity for now)?
8.90
Explanation
Short explanation
If we pair 1 and 3 we can save 15.4 miles.
Here are the rank of savings
15.4 1-3 15
Part 3
0 points possible (ungraded)
Consider that each of your vans can carry, at most, 70 boxes per tour. Use the Savings algorithm to design the routes.
Tip: Remember that the Savings algorithm is a heuristic algorithm. This means that the solution provided by the Savings algorithm will
not necessarily be the optimal solution to the problem.
Important: Write the sequence of dealers with a dash between the ID numbers (do not use spaces and do not include “DC”). For
example, if the route goes from DC to 5 to 2 to 6 to DC, write 5Y2Y6 or 6Y2Y5 (both are considered correct). In the above example, 2Y5Y
6 or 2Y6Y5 would be considered wrong!
3 " Answer: 4
What are the savings (in distance traveled) compared to delivering directly from the DC to each dealer?
Round your result to one decimal digit
72.9
In the following questions, you will be asked to describe the route/tour that includes certain dealers. Please, for designing the routes,
use exclusively the Savings algorithm. [Do not further optimize the paths obtained from the Savings algorithm using other methods.
Please provide the answer in the format that is specified.)
" Answer: 1 or 1
https://learning.edx.org/course/course-v1:MITx+CTL.SC1x_1+1T2…+1T2021+type@vertical+block@cf380b78462b4292b047775ae53d9289 Página 3 de 6
Practice Problems | Week 10: Transportation II - Freight Transportation Analysis and Case Study | Supply Chain Fundamentals | edX 6/6/21 14:11
" Answer: 5 or 5
Explanation
We look down the rank of savings to identify dealers that can be paired. We only pair the dealers in a loop if the sum of the demand do
not exceed 70. We cannot pair dealers 4 and 5 because their demand will sum up to 77 boxes, but we can pair dealers 4 and 6.
Similarly, we can only pair dealers 2 and 3. dealers 1 and 5 cannot be paired with each other nor be added to the existing loops within
exceeding the vans' capacity. 4 Tours/Routes are DC to Dealer-1 and back, DC to Dealer-5 and back, DC to Dealer-2 to Dealer-3 and
back, DC to Dealer-4 to Dealer-6 and back. For Total Distance Saved: Distance Traveled Drrectly From DC to Dealers is 284 miles and
with combined routes(with Distance savings) is 229.8 miles Hence savings (in distance traveled = 284 Y 229.8 ` 54.2
If you have a question, classify your post as a "question" (instead of "discussion"), since we try to review those post
first.
Discussion
Hide Discussion
Topic: Week 10 / PP3: Toy Manufacturer
Add a Post
$ All Posts
PART 3 +
question posted 3 days ago by arun_kh
%
How is distance with savings = 229.8 calculated ? It will be great help if someone puts the calculation
&
here.
1 response
Add a Response
MorganS4 +
https://learning.edx.org/course/course-v1:MITx+CTL.SC1x_1+1T2…+1T2021+type@vertical+block@cf380b78462b4292b047775ae53d9289 Página 4 de 6
Practice Problems | Week 10: Transportation II - Freight Transportation Analysis and Case Study | Supply Chain Fundamentals | edX 6/6/21 14:11
MorganS4
3 days ago
&
The saving calculation is the Distance between DC and point 1 K Distance between DC and point 2 A
Distance between Point 1 and Point 2. Ddc,1 K Ddc,2 A D1,2.
Using the data from the distance table, the Distance between DC and Point 1 is 22.2. The distance between
DC and point 2 is 20.7. The distance between Point 1 and Point 2 is 26. The savings is 22.2 K 20.7 A 26 O
16.9.
&
Can you give any more detail as to how you got to 229.8 though? I keep getting 243.9, or ~135 if I calculate
how you suggest.
&
I did it the same way you did at first, but then just decided to sum it up manually. The new route is DC H 4 H 6
H DC J 77.6 DC H 2 H 3 H DC J 56.8 DC H 1 H DCJ 44.4 DC H 5 H DC J 51
Add a comment
Add a response:
Preview
Previous Next
edX
About
Affiliates
edX for Business
Open edX
https://learning.edx.org/course/course-v1:MITx+CTL.SC1x_1+1T2…+1T2021+type@vertical+block@cf380b78462b4292b047775ae53d9289 Página 5 de 6
Practice Problems | Week 10: Transportation II - Freight Transportation Analysis and Case Study | Supply Chain Fundamentals | edX 6/6/21 14:11
Careers
News
Legal
Terms of Service & Honor Code
Privacy Policy
Accessibility Policy
Trademark Policy
Sitemap
Connect
Blog
Contact Us
Help Center
Media Kit
Donate
https://learning.edx.org/course/course-v1:MITx+CTL.SC1x_1+1T2…+1T2021+type@vertical+block@cf380b78462b4292b047775ae53d9289 Página 6 de 6