Presentation is loading. Please wait.

Presentation is loading. Please wait.

A Brief Introduction to the SITATION Software Mark S. Daskin Department of IOE, Univ. of Michigan Ann Arbor, MI 48109 Summer, 2010.

Published byTeresa O’Neal’ Modified over 9 years ago

Similar presentations

Presentation on theme: "A Brief Introduction to the SITATION Software Mark S. Daskin Department of IOE, Univ. of Michigan Ann Arbor, MI 48109 Summer, 2010."— 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 ©, M.S. Daskin, 2010, Univ. of Michigan2 What is SITATION?  Software to solve location problems  Set coveringP-median  Maximal CoveringUncap. Fixed charge  P-centerLoc./Inv. model  Partial covering P-center  Partial covering Set covering  Covering-Median Tradeoff

3 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan3 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)

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

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

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

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

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

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

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

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

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

13 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan13 Select objective function Not all available in free student version

14 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan14 Select an algorithm Available algorithms depend on problem selected for solution.

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

16 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan16 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.

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

18 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan18 Now see, map, change results Tabular and graphical summariesMap resultsExchange, delete, add sites manually

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

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

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

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

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

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

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

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

27 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan27 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.

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

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

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

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

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

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

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

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

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

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

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

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

40 Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan40 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

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

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

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

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

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

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

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

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

Download ppt "A Brief Introduction to the SITATION Software Mark S. Daskin Department of IOE, Univ. of Michigan Ann Arbor, MI 48109 Summer, 2010."

Similar presentations

Www.spatialanalysisonline.com Chapter 7 Part B: Locational analysis.

Chapter 7 Part B: Locational analysis.
Working with Profiles in IX1D v 3 – A Tutorial © 2006 Interpex Limited All rights reserved Version 1.0.

Working with Profiles in IX1D v 3 – A Tutorial © 2006 Interpex Limited All rights reserved Version 1.0.
SL-10 Laboratory Hot Tack / Seal Tester TMI Group of Companies TMI Group of Companies.

SL-10 Laboratory Hot Tack / Seal Tester TMI Group of Companies TMI Group of Companies.
Markov Decision Process

Markov Decision Process
Logistics Network Configuration

Logistics Network Configuration
Semester 10 Time sure flies.. PotW Solution One possible solution is to randomly search the grid: o At each point in your search, look at the (up to four)

Semester 10 Time sure flies.. PotW Solution One possible solution is to randomly search the grid: o At each point in your search, look at the (up to four)
EMIS 8373: Integer Programming Valid Inequalities updated 4April 2011.

EMIS 8373: Integer Programming Valid Inequalities updated 4April 2011.
Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.

1 Sensor Relocation in Mobile Sensor Networks Guiling Wang, Guohong Cao, Tom La Porta, and Wensheng Zhang Department of Computer Science & Engineering.
Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction is clear.

Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction is clear.
ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier

ENGR 351 Numerical Methods Instructor: Dr. L.R. Chevalier
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.

Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
1 Introduction to Industrial Engineering (II) Z. Max Shen Dept. of Industrial Engineering and Operations Research University of California.

1 Introduction to Industrial Engineering (II) Z. Max Shen Dept. of Industrial Engineering and Operations Research University of California.
EDA (CS286.5b) Day 19 Covering and Retiming. “Final” Like Assignment #1 –longer –more breadth –focus since assignment #2 –…but ideas are cummulative –open.

EDA (CS286.5b) Day 19 Covering and Retiming. “Final” Like Assignment #1 –longer –more breadth –focus since assignment #2 –…but ideas are cummulative –open.
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.

An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
Let’s pretty it up!. Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction.

Let’s pretty it up!. Border around project area Everything else is hardly noticeable… but it’s there Big circles… and semi- transparent Color distinction.
Add a File with X, Y coordinates to MapWindow

Add a File with X, Y coordinates to MapWindow
DEMONSTRATION FOR SIGMA DATA ACQUISITION MODULES Tempatron Ltd Data Measurements Division Darwin Close Reading RG2 0TB UK T : +44 (0) 118 931 4062 F :

DEMONSTRATION FOR SIGMA DATA ACQUISITION MODULES Tempatron Ltd Data Measurements Division Darwin Close Reading RG2 0TB UK T : +44 (0) F :
CAPS RoutePro CAPS Logistics Overview RoutePro Dispatcher Features.

CAPS RoutePro CAPS Logistics Overview RoutePro Dispatcher Features.
1 Global Meta-Hybrids for Large-Scale Combinatorial Optimization Professor Leyuan Shi Department of Industrial Engineering University of Wisconsin-Madison.

1 Global Meta-Hybrids for Large-Scale Combinatorial Optimization Professor Leyuan Shi Department of Industrial Engineering University of Wisconsin-Madison.

Similar presentations

Ads by Google