IntegratedSupplyChainManagement(2,5)

IntegratedSupplyChainManagement(2,5) - Example Problem 49...

Info icon This preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Example Problem: 49 Node Problem Find minimum cost way to serve 49 locations Fixed costs Transport Mileage and volume related costs Problem description Demands ~ state population Fixed costs given (avg. $77.9K) Demands/period = 0.00001 demand/person per period
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Two Fundamental Approaches Analytic location models Give insight Demands distributed like smooth peanut butter on bread Locate anywhere on the bread Discrete location models Demands only at specified sites Locate at specified candidate sites More like the chunky peanut butter analogy…. More realistic – able to capture more of real problem
Image of page 2
First Fundamental Approach Approximating the difficult problem Develop an Analytic Model N is the number of facilities (DCs) Fixed cost as a function of N fN where f is the fixed cost per DC per period Transportation cost as a function of N HOW?
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Determining Service Areas Area of demand region is A Divide region into N equal sized diamonds N service areas Each diamond (service area) has an area of A/N Example with N=9 A/9
Image of page 4
Determining Service Areas Assume we locate a facility at the center of each diamond So locating N facilities is equivalent to N service areas
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Average Distance from a Facility Let a=A/N, area of a single diamond Travel at 45 degrees to sides of diamond (euclidean distances) Average distance from a facility to a randomly selected demand point (Given uniformly distributed demands) 3 2 a Area = a
Image of page 6
Average Distance with N Service Areas Divide region into N equal sized diamonds Each diamond has an area of A/N N A N A a a 2 3 1 dist. Avg.
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

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

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern