{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Lec 7 - Industrial Engineering& Operations Research 151...

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Industrial Engineering & Operations Research 151 Service Operations Design and Analysis Group 7 Note: September 22, 2010 Daycare Demand Forecast Model : 0.043 Clarence Cheung, Edrick Soetanto Jiyang Liu, Maximilian Santana Steven Leonard all i 0.0248 0.092 : % of persons in block i who are under 18 and living in home : % of persons in block i with a single male head and a child more than 1.5 persons/room : % of persons in block i with a single female head Beer Stand Problem Objective: minimize the total travel distance Things to be consider: Figure out distribution of population of the beach Locate the distance from suppliers Distance that people walk from beach to our stand Assumption: People will walk to our stand no matter how long our stand is. There is only one beer stand Industrial Engineering & Operations Research 151 Service Operations Design and Analysis Group 7 Note: September 22, 2010 Clarence Cheung, Edrick Soetanto Jiyang Liu, Maximilian Santana Steven Leonard Divide into N blocks Wi = # of people who want beer in interval i Xi = location of interval i : X 0 Now, we have 2 stands (Competition case) Goal: locate the beer stand to locate to the nearest customers Assumptions: beer has the same quality there will be an equilibrium solution where if somebody move, he/she will lose profit * Xs1 * Xs2 • Xs1 *a Xs1 * Xs2 * a* Xs2 3 different types of Distance: 1. Euclidean distance: 2. Metropolitan distance: – – Hospital Problem Goal: Minimize Total Travel Distance – – Industrial Engineering & Operations Research 151 Clarence Cheung, Edrick Soetanto Service Operations Design and Analysis Jiyang Liu, Maximilian Santana Group 7 Note: September 22, 2010 Steven Leonard In this problem, we want to locate hospital in an area with 4 region. A (6,2) , B (8,6), C (5,9) , D (3,4). Number of people in region A : 2000 Number of people in region B : 1000 Number of people in region C: 3000 Number of people in region D : 2000 – Distance between s and I will be – Min ∑ . – . – is the median of people locate from x dimension. – is the median of people locate from y dimension. . . – ) Median of people = (2000 + 2000 + 3000 + 1000)/4 = 2000 ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online