1 / 17

ISEN 601 Location Logistics

ISEN 601 Location Logistics. Dr. Gary M. Gaukler Fall 2011. SFMS with Rectilinear Distances. Rectilinear distance: Total cost:. SFMS with Rectilinear Distances. Properties of total cost function: Graph: Consequences:. SFMS with Rectilinear Distances. Example 4.1:.

Download Presentation

ISEN 601 Location Logistics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. ISEN 601Location Logistics Dr. Gary M. Gaukler Fall 2011

  2. SFMS with Rectilinear Distances • Rectilinear distance: • Total cost:

  3. SFMS with Rectilinear Distances • Properties of total cost function: • Graph: • Consequences:

  4. SFMS with Rectilinear Distances • Example 4.1:

  5. SFMS with Rectilinear Distances • Optimality properties:

  6. SFMS with Rectilinear Distances • Another example:

  7. SFMS with Rectilinear Distances

  8. Single Facility, Euclidean Distances • Euclidean distance: • lp-Norms:

  9. Single Facility, Euclidean Distances Total cost function: Properties:

  10. Single Facility, Euclidean Distances First order conditions:

  11. Single Facility, Euclidean Distances Compare with the “Varignon Frame”:

  12. Single Facility, Euclidean Distances “Varignon Frame”, top view:

  13. Single Facility, Euclidean Distances When does the system come to rest?

  14. Single Facility, Euclidean Distances Majority Theorem:

  15. Single Facility, Euclidean Distances Back to our optimality equations:

  16. Single Facility, Euclidean Distances Iterative procedure:

  17. Single Facility, Euclidean Distances When do we stop iterating?

More Related