1 Use the ”distance_matrix_calculation.mos” model (1) 3 1 1 1 1 1 (2) (3) (4)(5) (6)(7) Structure of data file: number_nodes:7 edges:[ (1,2) 3 (2,3) 1.

Slides:

Advertisements

Similar presentations

Chapter 7 Part B: Locational analysis.

Advertisements

Facility Location Decisions

Outline LP formulation of minimal cost flow problem

Networks Prim’s Algorithm

Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.

Transportation Problem (TP) and Assignment Problem (AP)

1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

Chapter 4 The Greedy Approach. Minimum Spanning Tree A tree is an acyclic, connected, undirected graph. A spanning tree for a given graph G=, where E.

1 Appendix B: Solving TSP by Dynamic Programming Course: Algorithm Design and Analysis.

Vehicle Routing & Scheduling: Part 1

Linear Programming Network Flow Problems Transportation Assignment Transshipment Production and Inventory.

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

Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.

Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.

1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.

Math443/543 Mathematical Modeling and Optimization

Chapter 7 Network Flow Models.

1 Introduction to Industrial Engineering (II) Z. Max Shen Dept. of Industrial Engineering and Operations Research University of California.

Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors ： Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,

1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.

1 Internet Networking Spring 2002 Tutorial 6 Network Cost of Minimum Spanning Tree.

Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.

Transportation, Assignment, Network Models

NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.

How to Build Network? ISAT 625 Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers.

Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.

1 Let us consider that local authorities want to locate fire brigades at some places from the set 1, 2, 3 and 4 so that a distance from the worst located.

OPSM 301 Operations Management Class 21: Logistic Drivers: Facilities and Transportation Koç University Zeynep Aksin

“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.

Chapter 1 Introduction Introduction  Networks: mathematical models of real systems like electrical and power/ telecom/ logistics/ highway/ rail/

Shortest Path Navigation Application on GIS Supervisor: Dr. Damitha Karunaratne Thilani Imalka 2007/MCS/023.

Minimum Spanning Trees Suppose G = (V, E) is a undirected network. Each edge (i,j) in E has an associated ‘length’ c ij (cost, time, distance, …) Determine.

The Traveling Salesman Problem Over Seventy Years of Research, and a Million in Cash Presented by Vladimir Coxall.

© J. Christopher Beck Lecture 25: Workforce Scheduling 3.

1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.

Network Optimization Network optimization models: Special cases of linear programming models Important to identify problems that can be modeled as networks.

CHAPTER V Transportation Models Instructor : Lect.Volkan ÇETİNKAYA.

Let us consider one producer P and four customers, which are supplied each day with one item of product each. Customers can be supplied only by trucks.

Operations Research - Tutorial 2. Transportation Problem A dairy firm has three plants located in a state. The daily milk production at each plant is.

1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.

Network Flow Problems Example of Network Flow problems:

In some cases, the waste generated by the production of material at a facility must be disposed of at special waste disposal locations. We need to identify.

Model 5 Long Distance Phone Calls By Benjamin Cutting

Vehicle Routing Problems

Michal Koháni Department of Transportation Networks Faculty of Management Science and Informatics University of Zilina, Slovakia XPRESS – IVE Seminary.

Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

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

1 1 Milk Runs and Variability John H. Vande Vate Fall, 2002.

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.

Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.

Bounds Bingo. Pick 8 from the list percentagelower error bound upper bound.

Do Now:. Circumference What is circumference? Circumference is the distance around a circle.

Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.

Service Delivery in the Field

Party-by-Night Problem

Network Models Chapter 12

Chapter 12 Network Models 12-1

Network Science: A Short Introduction i3 Workshop

Routing and Logistics with TransCAD

Transportation, Assignment and Network Models

TransCAD Vehicle Routing 2018/11/29.

Neural Networks Chapter 4

Demand Allocation Example

Networks Prim’s Algorithm

Supply Chain Management

Network Flow Problems – Maximal Flow Problems

Presentation transcript:

1 Use the ”distance_matrix_calculation.mos” model (1) (2) (3) (4)(5) (6)(7) Structure of data file: number_nodes:7 edges:[ (1,2) 3 (2,3) 1 (2,4) 1 (2,5) 1 (3,6) 1 (3,7) 1 ]

2 Calculate the shortest distance matrix for this network:

3 We want to distribute milk(in bottles) and cakes. Milk is produced in the node 1 and cakes are produced in the node 4. Customers are in all nodes. Customers 1,3,5,7,9 need 100 bottles of milk and 20 cakes each, other customers need 50 bottles of milk and 15 cakes each. Warehouses can be located at nodes 1,2,3,4 and each customer must be served exactly from one warehouse (for both commodities). Cost per building a warehouse is 5000 crowns. Handling cost g i is 0,5 crown. Cost e 0 per transport of one bottle of milk to the customers is 1 crown. Cost e 1 per transport of one bottle of milk to the warehouse is 0,5 crown. Cost e 0 per transport of one cake to the customers is 2 crown. Cost e 1 per transport of one cake to the warehouse is 1 crown

4 We want to distribute milk(in bottles) and cakes. Milk is produced in the node 1 and cakes are produced in the node 4. Customers are in all nodes. Customers 1,3,5,7,9 need 100 bottles of milk and 20 cakes each, other customers need 50 bottles of milk and 15 cakes each. Warehouses can be located at nodes 1,2,3,4 and each customer can be served from different warehouse for each commodity. Cost per building a warehouse is 5000 crowns. Handling cost g i is 0,5 crown. Cost e 0 per transport of one bottle of milk to the customers is 1 crown. Cost e 1 per transport of one bottle of milk to the warehouse is 0,5 crown. Cost e 0 per transport of one cake to the customers is 2 crown. Cost e 1 per transport of one cake to the warehouse is 1 crown

5 We want to distribute milk(in bottles). Milk can be produced in the nodes 1 and 2. Customers are in all nodes. Customers 1,3,5,7,9 need 100 bottles of milk, other customers need 50 bottles of milk. Warehouses can be located at nodes 1,2,3,4 and each customer must be served exactly from one warehouse. Cost per building a primary source is 9000 crowns. Cost per building a warehouse is 5000 crowns. Handling cost g i is 0,5 crown. Cost e 0 per transport of one bottle of milk to the customers is 1 crown. Cost e 1 per transport of one bottle of milk to the warehouse is 0,5 crown

6 Let us consider that local authorities want to locate p=2 facilities at some places from the set 1, 2, 3 and 4 so that an average distance between customer and the nearest facility should be minimized

7

8 Let us consider that local authorities want to locate p=2 fire brigades at some places from the set 1, 2, 3 and 4 so that a distance from the worst located dwelling place from set {1, 2, …, 10} to a fire brigade be minimal

9  The 2-Centre Problem consists in minimizing the maximum distance between customer and the nearest located facility: d ij Distance matrix

10