Lec 17 - Lecture 4 11/15/10 Team 4 Kari Karlsson, Kellie...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lecture 4 11/15/10 Team 4 Kari Karlsson, Kellie Jue, Karin Vernooij, Jooho Lee, Vladmir Vakulenko I. Announcements • Article on service (summary, comments, interesting points) due 11/29 Vehicle routing problem • • Vehicle routing can be determined by the size of the package and location of customers (very hard) You need to determine the daily demand each truck will serve and minimize the total travel distance Example: • • Assume there are 2 trucks with the capacity of 3 Question: How do you assign demand to each truck? (Assuming you solved the TSP) Method 1. TSP → Grouping: Group the demands such that each group doesn’t exceed the capacity Method 2. Grouping first and then conducting TSP for each group Savings algorithm Step 1. Construct the shortest‐distance half matrix 0 1 2 3 1 8 2 15 12 3 8 9 8 4 7 13 8 6 Step 2. Initial allocation: send a truck to each node and have it come back to the warehouse Step 3. Calculate the net savings for each pair of outlying locations 0 1 2 3 1 2 11 3 7 15 4 2 14 9 Ex: Combining 1 and 3 → net savings = 8 + 8 – 9 = 7 • • Think about where you go from here (Hint: Think in terms of the biggest savings) Question: What if the cost of adding another truck outweighs the net savings? ...
View Full Document

This document was uploaded on 02/01/2012.

Ask a homework question - tutors are online