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.

Slides:



Advertisements
Similar presentations
Polynomial Inequalities in One Variable
Advertisements

Vehicle Routing: Coincident Origin and Destination Points
Decision Maths Networks Kruskals Algorithm Wiltshire Networks A Network is a weighted graph, which just means there is a number associated with each.
I-DMSS for Bus Rental in Seoul, Korea Katta G. Murty Dept. IOE, U. of Michigan Ann Arbor, MI , USA and Woo-Je Kim Dept.
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.
Outline LP formulation of minimal cost flow problem
© Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17v Slide 1 Network Models Lecture 17 (Part v.) Vogel’s Approximation.
Transportation Problem (TP) and Assignment Problem (AP)
TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
Math443/543 Mathematical Modeling and Optimization
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Chapter 7 Network Flow Models.
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.
Shortest Path Problems
Network Flow Models Chapter 7.
Linear Programming Applications
Transportation, Assignment, Network Models
1 Routing in Error-Correcting Networks Edwin Soedarmadji May 10, 2006 California Institute of Technology Department of Electrical Engineering Pasadena,
1 Integrality constraints Integrality constraints are often crucial when modeling optimizayion problems as linear programs. We have seen that if our linear.
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.
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.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
1 THE MODELLING POTENTIAL OF MINIMAX ALGEBRA H.P. Williams London School of Economics.
1.3 Modeling with exponentially many constr.  Some strong formulations (or even formulation itself) may involve exponentially many constraints (cutting.
1 Network Optimization Chapter 3 Shortest Path Problems.
Routing and Scheduling in Transportation. Vehicle Routing Problem Determining the best routes or schedules for pickup/delivery of passengers or goods.
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Minimum Cost Flows. 2 The Minimum Cost Flow Problem u ij = capacity of arc (i,j). c ij = unit cost of shipping flow from node i to node j on (i,j). x.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Michal Koháni Departement of Transportation Networks Faculty of Management Science and Informatics University of Zilina, Slovakia Høgskolen i Molde, September.
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
Chapter 4 Linear Programming: The Simplex Method
© 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.
Dvir Shabtay Moshe Kaspi The Department of IE&M Ben-Gurion University of the Negev, Israel.
1 Example 4 A road is to be constructed form city P to city Q as in the diagram below. The first part of this road PC lies along an existing road which.
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.
PROBLEM 5 (A) SCHOOL DISTRICT ADDEENBASHIRONCOBBITHDAIMMAN STUDENT POPULATION NORTH 250 5,5,5,5,5,-,- SOUTH 340 6,6,6,-,-,-,- EAST ,2,2,2,4,4,4,4.
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.
Michal Koháni Department of Transportation Networks Faculty of Management Science and Informatics University of Zilina, Slovakia XPRESS – IVE Seminary.
Management Science 461 Lecture 3 – Covering Models September 23, 2008.
1 Vehicle Routing for the American Red Cross Based on a paper by Dr. Jinxin Yi Carnegie Mellon University Published in MSOM Winter 2003,
Management Science 461 Lecture 4a – P center September 30, 2008.
-114- HMP654/EXECMAS Linear Programming Linear programming is a mathematical technique that allows the decision maker to allocate scarce resources in such.
Approximation Algorithms Duality My T. UF.
Reducing a Set Covering Matrix. S I T E S Cost Areas
Chapter 8 - Project Management1 Lecture 2 Today’s lecture covers the followings: 1.To study “project crashing” concept 2.LP formulation for project management.
A Warehouse Location Routing Problem Jirawan Niemsakul (Jossef Perl: University of Maryland Presentation By: Mark S.Daskin: Northwestern University) &
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
Cycle Canceling Algorithm
Solving Systems in 3 Variables using Matrices
Service Delivery in the Field
1.3 Modeling with exponentially many constr.
Transportation, Assignment and Network Models
Neural Networks Chapter 4
Not Always Feasible 2 (3,5) 1 s (0,2) 3 (, u) t.
ISEN 601 Location Logistics
1.3 Modeling with exponentially many constr.
1.5: Velocity-time graphs
Chapter 7: Systems of Equations and Inequalities; Matrices
Not Always Feasible 2 (3,5) 1 s (0,2) 3 (, u) t.
Vertex Covers and Matchings
EMIS The Maximum Flow Problem: Flows and Cuts Updated 6 March 2008
Presentation transcript:

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 dwelling place from set {1, 2, …, 10} to fire brigade location be at most 25 km. The number of fire brigades should be minimised. All dwelling places must be covered. Transportation network with distances is on the picture below. Use the shortest distances matrix and calculate incidental matrix from shortest distances matrix in Mosel customers i i’ D j a ij =1 a i’j =0

2 Mathematic model of the Maximum distance problem

3 Solve the previous problem but now a distance from the worst located dwelling place from set {1, 2, …, 10} to fire brigade location be at most 20 km. Can we obtain feasible solution now? Use getprobstat function. procedure print_status ! To find out the status of the solution declarations status:array({XPRS_OPT, XPRS_UNF, XPRS_INF, XPRS_UNB}) of string end-declarations status:=['Optimum found', 'Unfinished', 'Infeasible', 'Unbounded'] writeln(status(getprobstat)) end-procedure OR if (getprobstat != XPRS_OPT ) then writeln(“Optimal solution not found”)

4 Let us consider that local authorities want to locate 1 ambulance vehicle at one place from the set 1, 2, 3 and 4 so that the size of the part of population from set {1, 2, …, 10}, which is out of the time limit T max =30, should be minimized. Solve using the allocation approach. Population b j in nodes {1, 2, …, 10}: 100, 150, 100, 200, 150, 100, 100, 200, 150, 100 Transportation network with travel times is on the picture below. Use the shortest distances matrix We define c ij = b j, if d ij >T max and c ij = 0 otherwise.

5 d ij Distance Matrix (travel time)

6

7 Let us consider that local authorities want to locate 1 ambulance vehicle at one place from the set 1, 2, 3 and 4 so that the size of the part of population from set {1, 2, …, 10}, which is out of the time limit T max =30, should be minimized. Solve using the covering approach. Population b j in nodes {1, 2, …, 10}: 100, 150, 100, 200, 150, 100, 100, 200, 150, 100 Transportation network with travel times is on the picture below. Use the shortest distances matrix customers i i’ T max j a ij =1 a i’j =0 x j =0 The x j is allowed to be zero only if no ambulance is located in the radius T max from j.

8