Homework Topic 5 Traveler Salesman Problem

By: Fernando Brandao - 00146919

For: IEGR 461: Operations Research, Deterministic Models Dr. M. Salimian Fall 2013

Department of Industrial and Systems Engineering Morgan State University Saturday, October 19, 2013

Research:
1.1 Traveling Salesman Problem: The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hardproblem in combinatorial optimization, important in operations research and theoretical computer science. The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact methods are known, so that some instances with tens of thousands of cities can be solved. The TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips. Slightly modified, it appears as a sub-problem in many areas, such as DNA sequencing. In these applications, the concept city represents, for example, customers, soldering points, or DNA fragments, and the concept distance represents travelling times or cost, or a similarity measure between DNA fragments. In many applications, additional constraints such as limited resources or time windows make the problem considerably harder. TSP is a special case of the travelling purchaser problem. In the theory of computational complexity, the decision version of the TSP (where, given a length L, the task is to decide whether the graph has any tour shorter than L) belongs to the class of NPcomplete problems. Thus, it is likely that the worst-case running time for any algorithm for the TSP increases superpolynomially (or perhaps exponentially) with the number of cities.

1.2 Euclidean TSP:

The Euclidean TSP, or planar TSP, is the TSP with the distance being the ordinary Euclidean distance. The Euclidean TSP is a particular case of the metric TSP, since distances in a plane obey the triangle inequality. Like the general TSP, the Euclidean TSP is NP-hard. With discretized metric (distances rounded up to an integer), the problem is NP-complete. However, in some respects it seems to be easier than the general metric TSP. For example, the minimum spanning tree of the graph associated with an instance of the Euclidean TSP is a Euclidean minimum spanning tree, and so can be computed in expected O(n log n) time for n points (considerably less than the number of edges). This enables the simple 2-approximation algorithm for TSP with triangle inequality above to operate more quickly. In general, for any c > 0, where d is the number of dimensions in the Euclidean space, there is a polynomial-time algorithm that finds a tour of length at most (1 + 1/c) times the optimal for geometric instances of TSP in time; this is called a polynomial-time approximation scheme (PTAS). Sanjeev Arora and Joseph S. B. Mitchell were awarded the Gdel Prize in 2010 for their concurrent discovery of a PTAS for the Euclidean TSP.

In practice, heuristics with weaker guarantees continue to be used. 1.3 Christofides algorithm:

The goal of the Christofides approximation algorithm (named after Nicos Christofides) is to find a solution to the instances of the traveling salesman problem where the edge weights satisfy the triangle inequality. Let be an instance of TSP, i.e. is a complete graph on the set of vertices with weight function assigning a nonnegative real weight to every edge of . Algorithm: In pseudo-code: 1. Create the minimum spanning tree MST of . 2. Let be the set of vertices with odd degree in and find a perfect matching with minimum weight in the complete graph over the vertices from . 3. Combine the edges of and to form a multigraph . 4. Form an Eulerian circuit in (H is Eulerian because it is connected, with only even-degree vertices). 5. Make the circuit found in previous step Hamiltonian by skipping visited nodes (shortcutting).

Original Problem:
IEGR 440/461: Deterministic Models of Operations Research Fall 2013 M. Salimian Topic 5 Problem 12 Name: --FCB -Pickup Time and Date: --F/7:00pm-Due: in 24 hours Consider the fully connected undirected network of 8 vertices with the edge distances provided in the table below. Apply Christofides heuristic to find a TSP tour. Make sure the steps of the heuristic are followed properly and identify the tour sequence and edge set of assigned nodes and edges at each step.

Vertex 1 2 3 4 5 6 7

2 5

3 13 4

4 14 14 11

5 16 3 6 13

6 7 10 15 8 15

7 9 4 7 18 11 8

8 12 6 3 16 17 9 10

Resolution:
First Step: find the minimum spanning tree. Starting from node one and adding to the patch the closest node, we have: Selected Nodes 1 1, 2 1, 2, 5 1, 2, 5, 3 1, 2, 5, 3, 8 1, 2, 5, 3, 8, 7 1, 2, 5, 3, 8, 7, 6 Node Closest 2 5 3 8 7 6 4 Connect to 1 2 2 3 2 1 6 Distance 5 3 4 3 4 7 8 Total Length 5 8 12 15 19 26 34

Graphical representation:

Second Step: Creating the matching pairs. Analyzing the patch above, we have the following odd and even nodes: Odd nodes: 4, 5, 7, 8 Even Nodes: 1, 2, 3, 6 Matching pairs: (4-5)(7-8) = 13 + 10 = 23 (4-7)(5-8) = 18 + 17 = 35

(4-8)(5-7) = 16 + 11 = 27 Where the best matching pairs is 4-5, 7-8 Adding the matching pairs above to the minimum spanning tree, we have the following Euler tour:

Where the patch is: 1 => 2 => 3 => 8 => 7 => 2 => 5 => 4 => 6 => 1, with a total length of 23 + 34 = 57. Removing the second 2 from the patch, we have: 1 => 2 => 3 => 8 => 7 => 5 => 4 => 6 => 1 Total length = 57 (7 => 2 => 5) + (7 => 5) Total length = 57 (4 + 3) + (11) Total length = 61

References:
http://en.wikipedia.org/wiki/Travelling_salesman_problem#Euclidean_TSP http://en.wikipedia.org/wiki/Christofides_algorithm http://salimian.webersedu.com/ https://www.youtube.com/watch?v=-cLsEHP0qt0 http://theory.epfl.ch/anhc/pathslil.pdf http://www.intechopen.com/books/traveling-salesman-problem-theory-and-applications/travelingsalesman-problem-an-overview-of-applications-formulations-and-solution-approaches