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

Slides:

Advertisements

Similar presentations

Chapter 7 Part B: Locational analysis.

Advertisements

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.

Markov Decision Process

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)

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.

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.

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.

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.

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.

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) F :

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.

Groundwater Modeling – 2: Computer Implementation

START EXCEL BUILD OR RETRIEVE YOUR OPTIMIZATION MODEL SAVE YOUR WORKBOOK!! CHOOSE “Solver…” IN THE “Tools” MENU SPECIFY IN SOLVER DIALOG BOX: 1.CELL TO.

Multimodal Analysis Using Network Analyst. Outline Summarizing accessibility Summarizing accessibility Adding transportation modes to a network Adding.

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

Scott Perryman Jordan Williams.  NP-completeness is a class of unsolved decision problems in Computer Science.  A decision problem is a YES or NO answer.

1 Hyong-Mo Jeon Reliability Models for Facility Location with Risk Pooling ISE 2004 Summer IP Seminar Jul

Network Aware Resource Allocation in Distributed Clouds.

The Logistic Network: Design and Planning

Invitation to Computer Science, Java Version, Second Edition.

Introduction to Controlling the Output Power of a Transistor Stage A load network will be designed to maximize the output power obtainable from the Mitsubishi.

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.

Chapter 8 PD-Method and Local Ratio (4) Local ratio This ppt is editored from a ppt of Reuven Bar-Yehuda. Reuven Bar-Yehuda.

1 TEISS Case Project Introduction Melinda Ronca-Battista and Angelique Luedeker ITEP/TAMS Center.

Stochastic DAG Scheduling using Monte Carlo Approach Heterogeneous Computing Workshop (at IPDPS) 2012 Extended version: Elsevier JPDC (accepted July 2013,

An Introduction to CCP4i The CCP4 Graphical User Interface Peter Briggs CCP4.

CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.

Chapter Five Vibration Analysis.

Introduction to Enterprise Guide Jennifer Schmidt Rhonda Ellis Cassandra Hall.

GISMO/GEBndPlan Overview Geographic Information System Mapping Object.

The Interaction of Location and Inventory in Designing Distribution Systems Stephen J. Erlebacher and Russell D. Meller Presented By: Hakan Gultekin.

Spring 2002©, 2002, M.S. Daskin, Northwestern U.1 Example Use of SITATION Mark S. Daskin Department of IE/MS Northwestern U. Evanston, IL.

Example Use of SITATION Mark S. Daskin Department of IOE University of Michigan Ann Arbor, MI

FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen Department of Computer Sciences University of Wisconsin-Madison Jeff Linderoth, Argonne.

Parallel and Distributed Simulation Time Parallel Simulation.

IGridView description Version 2.0. Introduction IGridView is a 2D box view of Eclipse simulation data. Three types of grid data can be loaded and viewed:

CDAE Class 26 Dec. 4 Last class: Result of Quiz 6 5. Inventory decisions Problem set 6 Today: Result of group project 3 5. Inventory decisions Quiz.

Multimodal Analysis Using Network Analyst. Outline Summarizing accessibility Summarizing accessibility Adding transportation modes to a network Adding.

Clustering Unsupervised learning introduction Machine Learning.

Getting Started with Word & Saving Guided Lesson.

100 Metros Analysis User’s Guide Atlanta Regional Commission For more information contact:

A comparison of multi-objective spatial dispersion models for managing critical assets in urban areas A comparison of multi-objective spatial dispersion.

1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.

McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.

Routing Topology Algorithms Mustafa Ozdal 1. Introduction How to connect nets with multiple terminals? Net topologies needed before point-to-point routing.

Clustering Hongfei Yan School of EECS, Peking University 7/8/2009 Refer to Aaron Kimball’s slides.

Management Science 461 Lecture 3 – Covering Models September 23, 2008.

Management Science 461 Lecture 4a – P center September 30, 2008.

Facility Location and Network Design Models. Facility Location Assumptions Based on graph G=(V,E) Demand nodes, I  V, are known and fixed Set J  V of.

NPSTC Meetings, November 2007 Margaret Daly and Sean O’Hara Syracuse Research Corporation New York Statewide Wireless Network Program RPC 700 MHz Interference.

Chapter 8 PD-Method and Local Ratio (5) Equivalence This ppt is editored from a ppt of Reuven Bar-Yehuda. Reuven Bar-Yehuda.

Management Science 461 Lecture 4b – P-median problems September 30, 2008.

Free vs. Forced Convection

Network Attributes Calculator

Location Where to put facilities? Transportation costs

Hidden Markov Models Part 2: Algorithms

KMeans Clustering on Hadoop Fall 2013 Elke A. Rundensteiner

Location Where to put facilities? Transportation costs

Chapter 6 Network Flow Models.

Chapter 9: Introduction to JADE Case Study

Presentation transcript:

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

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

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)

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

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

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

Summer, 2010©, M.S. Daskin, 2010, Univ. of Michigan7 Basic input file format 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

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!

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

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

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

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

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

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

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

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.

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

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

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

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

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

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.

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

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

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

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

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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