Management Science 461 Lecture 9 – Arc Routing November 18, 2008.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Discrete Maths Chapter 5: Route Inspection Lesson 1: Chinese Postman.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Great Theoretical Ideas in Computer Science for Some.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.
3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Graphs & Graph Algorithms 2 Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
Approximation Algorithms for the Traveling Salesperson Problem.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.
Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.
Graphs and Euler cycles Let Maths take you Further…
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.
GRAPH Learning Outcomes Students should be able to:
Graph Theory Chapter 6 from Johnsonbaugh Article(6.1, 6.2)
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.
Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.
© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.
The Traveling Salesperson Problem Algorithms and Networks.
The Traveling Salesman Problem Approximation
Graph Theory Topics to be covered:
© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.
COSC 2007 Data Structures II Chapter 14 Graphs III.
© B.Raghavachari & J.Veerasamy, UTD 1 Euler tours, postman tours and mixed graphs Jeyakesavan Veerasamy* * Joint work with Balaji Raghavachari Samsung.
Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.
© B.Raghavachari & J.Veerasamy, UTD 1 Approximation Algorithms for Postman Problems Jeyakesavan Veerasamy* * Joint work withBalaji Raghavachari Samsung.
Graphs Rosen, Chapter 8. Isomorphism (Rosen 560 to 563) Are two graphs G1 and G2 of equal form? That is, could I rename the vertices of G1 such that the.
Chinese Postman Algorithm Aims: To be able to use the Chinese Postman Algorithm for: all even vertices. 2 odd vertices. Starting and ending at the same.
There is a Postman who delivers mail to a certain neighborhood of streets. The postman is unwilling to walk far so he wants to find the shortest route.
Chinese postman problem
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Combinatorial Optimization Chapter 1. Problems and Algorithms  1.1 Two Problems (representative problems)  The Traveling Salesman Problem 47 drilling.
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Chapter 2: Graphs and Networks Lesson 2: Hello Mr Euler…
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Data Structures & Algorithms Graphs
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Projects Network Theory VLSI PSM 1. Network 1. Steiner trees
1 Approximation Algorithm Updated on 2012/12/25. 2 Approximation Algorithm Up to now, the best algorithm for solving an NP-complete problem requires exponential.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
Mathematics in Management Science
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Eulerian Paths and Cycles. What is a Eulerian Path Given an graph. Find a path which uses every edge exactly once. This path is called an Eulerian Path.
M Clements Formal Network Theory. Introduction Practical problem – The Seven Bridges of Königsberg Network graphs Nodes & edges Degrees Rules/ axioms.
Introduction to Graph Theory
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
1 “Graph theory” Course for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
1 Minimum Spanning Tree: Solving TSP for Metric Graphs using MST Heuristic Soheil Shafiee Shabnam Aboughadareh.
Chinese Postman Problem
Routing Through Networks - 1
School of Computing Clemson University Fall, 2012
Hamiltonian Cycle and TSP
1.3 Modeling with exponentially many constr.
Graph Algorithm.
Graph Theory.
Graphs Chapter 13.
Nuffield Free-Standing Mathematics Activity
Lecture 19-Problem Solving 4 Incremental Method
Algorithms and data structures
1.3 Modeling with exponentially many constr.
Decision Maths Graphs.
Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.
5.4 T-joins and Postman Problems
Approximation Algorithms
Presentation transcript:

Management Science 461 Lecture 9 – Arc Routing November 18, 2008

Changing Focus We always assume demand and service is at the nodes … But what if they’re along the edges? What if the edges are more important than the nodes?

Arc Routing Is it more important to visit every intersection, or cover every street? What applications can you think of where arcs are more important than nodes? What are the challenges of efficiently visiting each arc in a network?

Postman Problem Formerly the Chinese Postman Problem, also called Route Inspection Problem Given a network with nodes and arcs, find the shortest-distance route that traverses all arcs at least once Don’t care which nodes to visit (or how often) Ideally, every arc is visited once (lower bound) – is this always possible?

Graph Representation Directed (arcs) Non-Directed (edges)  a/k/a bidirectional Mixed (arcs and edges) A E D C BA E D C BA E D C B

Remember This? Try to draw the following without lifting your pen from the paper or re-drawing any segments

The Königsberg Bridges A B C D A BC D Euler, L. (1736), “Solutio problematis ad geometriam situs pertinentis,” Commentarii Academiae Scientiarum Imperialis Petropolitanae

Euler’s answer Calculate the degree of each node If all node degrees are even, we can complete a tour without retracing our steps If all but two are even, can start at one odd node, finish at the other (semi-Eulerian) Otherwise, we have deadheading A BC D

Formal Definition A graph is Eulerian or unicursal if:  Undirected graph: graph is connected, all node degrees are even  Directed graph: strongly connected, degree- in equals degree-out for each node

Formal Definition  Mixed graph (combo of dir/undir) “Every node must be incident to an even number of directed and undirected arcs. Moreover, for every subset S of all nodes V, the difference between the number of directed arcs from subset (V minus S) to subset S must be less or equal to the number of undirected arcs joining S and V minus S.” Eiselt et al (1995), “Arc Routing Problems, Part I: The Chinese Postman Problem,” Operations Research 43(2)

The Postman Problem What if the graph isn’t Eulerian?  Connecting two nodes of odd degree makes them even  There are an even number of odd-degree nodes in any graph Algorithms to solve the Postman Problem revolve around “matching” odd-degree nodes with minimal cost

Non-Eulerian Graphs Guan’s algorithm (1962) Identify all odd-degree nodes Find shortest paths between each pair Select pairing of minimum cost Augment the graph, solve Eulerian tour

Non-Eulerian Graphs Identify odd degree nodes

Non-Eulerian Graphs Pair nodes through their shortest path in the graph. Select minimum cost pair assignment. Possible pairs: 2-4 and 6-8 (3+5 = 8) 2-6 and 4-8 (4+3 = 7) 2-8 and 4-6 (2+6 = 8)

Non-Eulerian Graphs Augment the graph to make it Eulerian (check node degree). Each new arc effectively means we’reretracing our steps Now that graph is Eulerian, we apply end-pairing to find the solution Challenge: the matching problem is difficult and increases exponentially, making this a “hard” problem to solve

End-Pairing Algorithm Hierholzer (1873)  Step 1: Trace simple tour. If all edges have been included, stop.  Step 2: Find a node v on the tour that’s connected to a node not on the tour. Form a second tour from v (do not overlap first tour)  Step 3: Merge both tours at the node v. If all edges have been traversed, stop. Otherwise go to Step 2.

End-Pairing Algorithm Example

End-Pairing Algorithm Example Step 1:

End-Pairing Algorithm Example Step 1: Step 2: v = 2 Path: Combine them

End-Pairing Algorithm Step 1: Step 2: v = 2 Path: Combine them Step 2: v = 6 Path: Combine them All edges visited. Stop.

Rural Postman Problem Only a subset of the edges is mandatory Proven to be NP-Hard (Orloff, 1974) Technique: turn it into a postman problem and solve  Frederickson heuristic (1979): uses Min Spanning Tree as a sub-problem. Sol’ns within 3% of optimal

Rural Postman Problem Frederickson heuristic: 1. Find a minimum spanning tree (T) to connect the components of the graph 2. Augment graph 3. Apply end-pairing

Minimum Spanning Tree (MST) Simple algorithm (Kruskal)  Find the cheapest edge that doesn’t make a cycle  Repeat until all nodes are connected STOP!

Minimum Spanning Tree (MST) Provably optimal Solvable in polynomial time Value of this MST:

Rural Postman Problem Frederickson algorithm (1979) Determine MST connecting connected components (T).

Now the graph is connected… we need to: A)Make Eulerian B)Find Tour

Identify all nodes of odd degree (there are an even number of them)

Next we find shortest paths between each pair of odd-degree nodes. We use the shortest paths to find the minimum-cost matching: match nodes to minimize total cost of the distances between them (see Excel)

Rural Postman Problem The final graph is Eulerian. Apply end-pairing algorithm

Review For any arc-routing problem (bidirectional) Step 1. If graph unconnected, connect it (min spanning tree). Step 2. If graph is non-Eulerian, make it Eulerian (find minimum matching using shortest paths, duplicate arcs). Step 3. Apply end-pairing algorithm to find the tour.