a brief introduction to the sitation software mark s. daskin department of ioe, univ. of michigan...

A Brief Introduction to the SITATION Software

Mark S. DaskinDepartment of IOE, Univ. of Michigan

Ann Arbor, MI 48109

Summer, 2010

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 2

What is SITATION?

Software to solve location problemsSet covering P-medianMaximal Covering Uncap. Fixed chargeP-center Loc./Inv. modelPartial covering P-centerPartial covering Set covering

Covering-Median Tradeoff

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 3

Options include

Forcing sites in/out of solution Different solution algorithms

HeuristicImprovementLagrangian relaxation in branch and bound (optimal)

Mapping Reporting Manual facility exchanges (for some objectives)

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 4

Main Menu

First you load the data

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 5

Loading the data

Specify distance metricEuclideanGreat circleManhattanNetwork

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 6

Specify file to read

Summer, 2010 ©, 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

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 8

Specify how distances are to be obtained

Specify how distancesare to be obtained

computedfrom a file

Network distances must be read from a file!

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 9

Now set key parameters

Set key parameterscoverage distancecost per demand per mile

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 10

Specify key parameters

Values used for REPORTING purposeseven if not used in optimization

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 11

Also force nodes into/out of solution

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 12

Now you can run a problem

Or a multi-objective model

Run a single objective model

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 13

Select objective function

Not all availablein free studentversion

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 14

Select an algorithm

Availablealgorithmsdepend onproblemselectedfor solution.

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 15

Specify number to locate

-1 for someProblems(e.g., uncap fixed charge) allows program to determine optimal value

Summer, 2010 ©, 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.

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 17

Watch Lagrangian Progress

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 18

Now see, map, change results

Tabular and graphical summaries

Map results

Exchange, delete, add sitesmanually

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 19

Select summary result to display

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 20

Basic summary

Shows input values, problem selected, bounds, iterations, B&B nodes, seconds, etc.

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 21

Extended summary shows

Shows locations, coverage, average distance, total cost, etc.

Summer, 2010 ©, 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.

Summer, 2010 ©, 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

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 24

Node to facility report

Shows similar information

Summer, 2010 ©, 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

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 26

Graph of tradeoff

Summer, 2010 ©, 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.

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 28

Alter how graph is displayed

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 29

Show only solutions findable using weighting method

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 30

Force assignments report/menu

Allows manual assignment of demands to facilities for location/ inventory model

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 31

Map of the solution

Shows summary information and allows a variety of display options

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 32

Map with site names

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 33

Demand map

Height proportional to demand

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 34

And coverage map

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 35

Map tradeoff solutions

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 36

Highlight solution to show

Highlight solution to show in top left panel

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 37

Zoom in on a part of a solution

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 38

Exchange, delete, add sites manually

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 39

Picking a node to add

Highlight the node to add

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 40

For location/inventory model

Set basic inputsLead timeVariance to mean ratioZ-alphaHolding costFixed order costTransport/inventory weightsLocal delivery costDays per year

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 41

Identify plant locations

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 42

And transport cost rates between plant and DCs

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 43

Summary of basic location/inventory costs

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 44

And inputs….

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 45

And optimal inventory policy

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 46

Map of location/inventory solution showing plants

Plants

DCs

Markets

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 47

And finally you can quit ….

Exit SITATION

Summer, 2010 ©, M.S. Daskin, 2010, Univ. of Michigan 48

That’s all folks ….