1 / 48

Introduction to SITATION Software

Learn about SITATION software for solving location problems with various algorithms and features for location and inventory models. Options include specifying key parameters, selecting objective functions, and running different models.

jabari
Download Presentation

Introduction to SITATION Software

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. A Brief Introduction to the SITATION Software Mark S. Daskin Department of IOE, Univ. of Michigan Ann Arbor, MI 48109 Summer, 2010

  2. What is SITATION? • Software to solve location problems • Set covering P-median • Maximal Covering Uncap. Fixed charge • P-center Loc./Inv. model • Partial covering P-center • Partial covering Set covering • Covering-Median Tradeoff ©, M.S. Daskin, 2010, Univ. of Michigan

  3. Options include • Forcing sites in/out of solution • Different solution algorithms • Heuristic • Improvement • Lagrangian relaxation in branch and bound (optimal) • Mapping • Reporting • Manual facility exchanges (for some objectives) ©, M.S. Daskin, 2010, Univ. of Michigan

  4. First you load the data Main Menu ©, M.S. Daskin, 2010, Univ. of Michigan

  5. Specify distance metric Euclidean Great circle Manhattan Network Loading the data ©, M.S. Daskin, 2010, Univ. of Michigan

  6. Specify file to read ©, M.S. Daskin, 2010, Univ. of Michigan

  7. Basic input file format 1 73.945478 40.670543 7322564 2819401 189600 < New York NY > Node number, longitude, latitude, demand 1, demand 2, fixed cost, <city name > Demand 2 is usually ignored,but you can take a weighted sum of Demand 1 and Demand 2if you want to do so ©, M.S. Daskin, 2010, Univ. of Michigan

  8. Specify how distancesare to be obtained computed from a file Network distances must be read from a file! Specify how distances are to be obtained ©, M.S. Daskin, 2010, Univ. of Michigan

  9. Set key parameters coverage distance cost per demand per mile Now set key parameters ©, M.S. Daskin, 2010, Univ. of Michigan

  10. Specify key parameters Values used for REPORTING purposes even if not used in optimization ©, M.S. Daskin, 2010, Univ. of Michigan

  11. Also force nodes into/out of solution ©, M.S. Daskin, 2010, Univ. of Michigan

  12. Run a single objective model Or a multi-objective model Now you can run a problem ©, M.S. Daskin, 2010, Univ. of Michigan

  13. Select objective function Not all availablein free studentversion ©, M.S. Daskin, 2010, Univ. of Michigan

  14. Select an algorithm Availablealgorithmsdepend onproblemselectedfor solution. ©, M.S. Daskin, 2010, Univ. of Michigan

  15. Specify number to locate -1 for some Problems(e.g., uncap fixed charge) allows program to determine optimal value ©, M.S. Daskin, 2010, Univ. of Michigan

  16. Set Lagrangian parameters Parameters control Lagrangian effort and other related options (substitution, intermed. Display, branch and bound, Initial lag mult., Etc.) USE Defaults if not sure what to do. ©, M.S. Daskin, 2010, Univ. of Michigan

  17. Watch Lagrangian Progress ©, M.S. Daskin, 2010, Univ. of Michigan

  18. Tabular and graphical summaries Map results Exchange, delete, add sitesmanually Now see, map, change results ©, M.S. Daskin, 2010, Univ. of Michigan

  19. Select summary result to display ©, M.S. Daskin, 2010, Univ. of Michigan

  20. Basic summary Shows input values, problem selected, bounds, iterations, B&B nodes, seconds, etc. ©, M.S. Daskin, 2010, Univ. of Michigan

  21. Extended summary shows Shows locations, coverage, average distance, total cost, etc. ©, M.S. Daskin, 2010, Univ. of Michigan

  22. Number of times covered… Shows number of nodes and demands covered 0 times, 1 time, 2 times, etc. ©, M.S. Daskin, 2010, Univ. of Michigan

  23. Assignment to sites Shows facility assigned to each site, distance to site, demand, dem*dist, total dem*dist, Max dist ©, M.S. Daskin, 2010, Univ. of Michigan

  24. Node to facility report Shows similar information ©, M.S. Daskin, 2010, Univ. of Michigan

  25. Tradeoff summary info Center-median shows solution values, whether findable using weighting method, penalty for distances greater than max distance, and locations ©, M.S. Daskin, 2010, Univ. of Michigan

  26. Graph of tradeoff ©, M.S. Daskin, 2010, Univ. of Michigan

  27. Zoom in on a region of a graph or map By dragging from top left to bottom right of region to enlarge. Drag from bottom right to top left to undo enlargement. ©, M.S. Daskin, 2010, Univ. of Michigan

  28. Alter how graph is displayed ©, M.S. Daskin, 2010, Univ. of Michigan

  29. Show only solutions findable using weighting method ©, M.S. Daskin, 2010, Univ. of Michigan

  30. Force assignments report/menu Allows manual assignment of demands to facilities for location/ inventory model ©, M.S. Daskin, 2010, Univ. of Michigan

  31. Map of the solution Shows summary information and allows a variety of display options ©, M.S. Daskin, 2010, Univ. of Michigan

  32. Map with site names ©, M.S. Daskin, 2010, Univ. of Michigan

  33. Demand map Height proportional to demand ©, M.S. Daskin, 2010, Univ. of Michigan

  34. And coverage map ©, M.S. Daskin, 2010, Univ. of Michigan

  35. Map tradeoff solutions ©, M.S. Daskin, 2010, Univ. of Michigan

  36. Highlight solution to show in top left panel Highlight solution to show ©, M.S. Daskin, 2010, Univ. of Michigan

  37. Zoom in on a part of a solution ©, M.S. Daskin, 2010, Univ. of Michigan

  38. Exchange, delete, add sites manually ©, M.S. Daskin, 2010, Univ. of Michigan

  39. Picking a node to add Highlight the node to add ©, M.S. Daskin, 2010, Univ. of Michigan

  40. For location/inventory model Set basic inputs Lead time Variance to mean ratio Z-alpha Holding cost Fixed order cost Transport/inventory weights Local delivery cost Days per year ©, M.S. Daskin, 2010, Univ. of Michigan

  41. Identify plant locations ©, M.S. Daskin, 2010, Univ. of Michigan

  42. And transport cost rates between plant and DCs ©, M.S. Daskin, 2010, Univ. of Michigan

  43. Summary of basic location/inventory costs ©, M.S. Daskin, 2010, Univ. of Michigan

  44. And inputs…. ©, M.S. Daskin, 2010, Univ. of Michigan

  45. And optimal inventory policy ©, M.S. Daskin, 2010, Univ. of Michigan

  46. Plants DCs Markets Map of location/inventory solution showing plants ©, M.S. Daskin, 2010, Univ. of Michigan

  47. Exit SITATION And finally you can quit …. ©, M.S. Daskin, 2010, Univ. of Michigan

  48. That’s all folks …. ©, M.S. Daskin, 2010, Univ. of Michigan

More Related