The Multiple Traveling Salesperson Problem on Regular Grids
|
|
- Brenda Hunt
- 5 years ago
- Views:
Transcription
1 Philipp Hungerländer Anna Jellen Stefan Jessenitschnig Lisa Knoblinger Manuel Lackenbucher Kerstin Maier September 10, 2018 Abstract In this work we analyze the multiple Traveling Salesperson Problem (mtsp) on regular grids. While the general mtsp is known to be NP-hard, the special structure of grids can be exploited to explicitly determine optimal solutions, i.e., the problem can be solved in linear time. We suggest a Mixed-Integer Linear Programming (MILP) formulation for the mtsp on regular grids where we minimize two different objective functions. The first one models the sum of the tour lengths of all salespersons and the second one considers the maximal tour length of a single salesperson. With the help of these MILPs and combinatorial counting arguments, we establish lower bounds, explicit construction schemes and hence optimal mtsp solutions for specific grid sizes, depot positions and two salespersons. Keywords: Multiple Traveling Salesperson Problem, Mixed-Integer Linear Programming, Grid. 1 Introduction The multiple Traveling Salesperson Problem (mtsp) is a generalization of the NP-hard Traveling Salesperson Problem (TSP). Given a depot d, and p points to be visited, the mtsp asks for m shortest Hamiltonian cycles, such that d is visited by all salespersons and the remaining p 1 points are visited by exactly one salesperson. In this paper we consider the mtsp on regular l n grid graphs in the Euclidean plane where the number of grid points is ln. The special structure of the grid is exploited to find lower bounds, explicit construction schemes and hence optimal mtsp solutions. Explicit construction schemes and corresponding optimal solutions are also known for another related problem, namely the TSP with Forbidden Neighborhoods (TSPFN), where consecutive points along the Hamiltonian cycle must have a minimal distance. The TSPFN was studied on regular 2D and 3D grids, see [2] and [3]. To the best of our knowledge this is the first paper suggesting lower bounds, explicit construction schemes and hence optimal mtsp solutions. Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, philipp.hungerlaender@aau.at Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, anna.jellen@aau.at Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, stefanje@edu.aau.at Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, lisakn@edu.aau.at Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, malackenbuch@edu.aau.at Department of Mathematics, Alpen-Adria-Universität Klagenfurt, Austria, kerstin.maier@aau.at 1
2 Our research is motivated by several real-world applications, like search and rescue operations or delivering goods with swarms of unmanned aerial vehicles (UAV), see, e.g., [1] for more information about this topic. Regular grid structures can be used to divide large search areas in several equalsized squares. The size of a square is chosen as large as the sensor or camera range of a UAV. The paper is structured as follows: We suggest our Mixed-Integer Linear Programming formulation for solving the mtsp in Section 2. Our computational results are stated in Section 3. Finally, in Section 4, we propose optimal solutions for specific grid sizes, depot positions and two salespersons. 2 Mathematical Formulation In this section we propose our Mixed-Integer Linear Programming (MILP) formulation for solving the mtsp on a regular l n grid. We define [m] := {1,..., m} as the set of salespersons and [ln] := {1,..., ln} as the set of grid points. Grid points can be identified by their coordinates, for an illustration see Figure 1 a). Each salesperson starts and ends its tour at a predefined grid point, referred to as depot d. The Euclidean distance from grid point i to grid point j is given by t ij. We introduce binary variables x ijk, i, j [ln], k [m], which are set to 1, if salesperson k visits grid point j immediately after grid point i and to 0 otherwise. Motivated by applications, where m UAVs search for a missing person, we formulate two MILPs with different objective functions. MILP I (II) minimizes the average (maximal) search time for a missing person. MILP I: The first MILP minimizes the sum of the tour lengths of all salespersons, i.e., the total tour length, and can be formulated as follows: min t ij x ijk (I) s. t. k [m], i,j [ln] k [m] j [ln] k [m] i [ln] j [ln]\d, j [ln] i,j [ln]\d x ijk = 1, i [ln] \ d, (1) x ijk = 1, j [ln] \ d, (2) x djk = 1, k [m], (3) x jik = x ijk < j [ln] ln m u i u j + 1 (ln 1)(1 x ijk, k [m], i [ln], (4), k [m], (5) k [m] x ijk ), i, j [ln] \ d, i j, (6) 2
3 x ijk {0, 1}, k [m], i, j [ln], i j, (7) 2 u i ln, i [ln] \ d. (8) Equalities (1) and (2) ensure that each grid point except the depot has exactly one outgoing and one ingoing edge. Equalities (3) guarantee that each salesperson starts at the depot. Due to Equalities (4), each grid point is entered and left by the same salesperson. Inequalities (5) ensure that all salespersons visit a similar number of grid points. Inequalities (6) are the polynomial many subtour elimination constraints by Miller, Tucker, and Zemlin, where the variables u i, i [ln], represent a numbering of the grid points visited. MILP II: The second MILP minimizes the maximal tour length of a single salesperson. Therefore we replace Constraint (5) by: t ij x ijk c, k [m]. (9) i,j [ln] Inequalities (9) ensure that the tour length of each salesperson is smaller than a continuous variable c R +. Finally replacing Objective (I) by Objective (II) ensures that the maximal tour length of a salesperson is minimized: min c (II) s. t. (1) (4), (6) (9), c R +. MILP II minimizes the maximal tour length, however, it puts no restrictions on the length of the other m 1 tours. Hence, these tours are often too long for a satisfactory overall solution. To reduce the sum of the tour lengths of all salespersons we combine Objectives (I) and (II). To be more precise, we add Objective (I) and Objective (II) multiplied by the factor 5m, such that we still focus on minimizing the maximal tour length: min k [m], i,j [ln] t ij x ijk + 5mc (III) 3
4 3 Computational Results All experiments were conducted on a Linux 64-bit machine equipped with Intel(R) Xeon(R) CPU e v3@2.40ghz and 128 GB RAM. We use Gurobi in single thread mode as ILP-solver. We run our MILP on mtsp instances with m = 2 and the depot located in the upper left corner, i.e., in (1, 1). In Tables 1-3 we state the mtsp solutions of our MILP using Objectives (I)-(III). The MILP was able to return optimal solutions for all considered objectives and up to 25 grid points within the given time limit of six hours. Using Objective (III) instead of Objective (II) for the instance with 12 grid points results in an improved total tour length while the maximal tour length of a single salesperson stays almost the same. Illustrations of the tours for the considered instances can be downloaded from # grid points l n total tour length max tour length min tour length gap runtime :00: :00: :02: :00:00 Table 1: Results for the mtsp with m = 2 and depot at (1, 1) obtained by our MILP using Objective (I) and Gurobi in single thread mode. The optimality gap is given in percent and the solving time [hh:mm:ss] is limited to six hours. # grid points l n total tour length max tour length min tour length gap runtime :00: :07: :39: :00:00 Table 2: Results for the mtsp with m = 2 and depot at (1, 1) obtained by our MILP using Objective (II) and Gurobi in single thread mode. The optimality gap is given in percent and the solving time [hh:mm:ss] is limited to six hours. # grid points l n total tour length max tour length min tour length gap runtime :00: :03: :37: :00:00 Table 3: Results for the mtsp with m = 2 and depot at (1, 1) obtained by our MILP using Objective (III) and Gurobi in single thread mode. The optimality gap is given in percent and the solving time [hh:mm:ss] is limited to six hours. 4
5 4 Optimal Solutions for Specific Grid Sizes In this section we provide optimal tour lengths for specific grid sizes, depot positions, two salespersons and Objective (I). Theorem 1. Let the depot for all salespersons be located in one of the four corners of the l n grid. Then the value of the optimal mtsp solution considering Objective (I) with m = 2 and n = 4 is (ln 1) Proof. We use the grid numbering depicted in Figure 1 a) and consider the regular grid as a chessboard with black and white squares. Due to Constraint (5), the maximal number of squares a salesperson is allowed to visit is 4l 2 = 2l. W.l.o.g. we assume that the depot is located at (1, 1) and colored black. There are only two possibilities for a move of length 1 out of the depot. Hence, there must be two moves of length > 1, such that both salespersons are able to leave and return to the depot. The shortest such moves have length 2 and 2 and thus a trivial lower bound for the value of a mtsp solution on a l 4 grid considering Objective (I) is (4l 1) The steps of length 1 and 2 are unique, i.e., they end at (1, 2), (2, 1), and (2, 2) respectively. There are two possibilities for the step of length 2, i.e., (1, 3) or (3, 1). No matter which step of length 2 is chosen, either (1, 2) or (2, 1) can not be connected to any square by a step of length 1. Hence, we derive the improved lower bound of (4l 1) For obtaining this lower bound the steps to (1, 2), (2, 1), and (2, 2) are unique and we have two possibilities to choose the step of length 5, i.e., (3, 2) or (2, 3), we start with (3, 2). If we do not consider the four steps connecting the two tours to the depot, it remains to draw two paths that are connected to (1, 2), (2, 1), (2, 2), and (3, 2). These paths consist only of steps of length 1 and have length 2l 1 and 2l 2 respectively due to Constraint (5). One path has to start and end at (2, 1) and (3, 2), and the other one at (1, 2) and (2, 2), otherwise the paths would intersect, i.e., one path would contain at least one additional step of length 2, which is a contradiction. If the paths start and end at their respective squares, it is possible to produce paths of lengths 2l 4 and 2l + 1 or 2l and 2l 3, but in each case Constraint (5) is contradicted. If (2, 3) is chosen instead, the argument is analog, and we derive paths of lengths 2l + 4 and 2l 7 or 2l and 2l 3, which again contradicts Inequalities (5). Now let us consider further possible lower bounds, where similar arguments as above can be applied (see Figure 2 for illustrations): (4l 1) + 2 2: The steps of length 1 and 2 are unique, they end at (1, 2), (1, 3), (2, 1), and (3, 1). Either from (1, 2) or (1, 3) a step of length > 1 is necessary and this is a contradiction. (4l 2) : Steps to (1, 2), (2, 2), and (2, 1) are unique. For the step of length 2 we have two possibilities: First, let us choose (3, 1). Then a step from (2, 1) to (3, 2) is implied. As above it is not possible to find two paths that fulfill Constraint (5). Second, let us choose (1, 3). Then a step from (1, 2) to (2, 3) is implied. Again there exist no paths that fulfill Inequalities (5). (4l 2) : Steps to (1, 2), (2, 2), and (2, 1) are unique. We have two possibilities for the step of length 5, either to (3, 2) or (2, 3). In both cases one path uses a step of length 2, Constraint (5) is fulfilled, but we additionally need one step of length 2 on the other path. 5
6 We finally derive a lower bound of (4l 1) and the construction scheme in Figure 1 b) shows that a mtsp solution with this value always exists. Q.E.D. a) Numbering b) Construction Scheme (1, 1) (1, 2) (1, 3) (1, 4) (2, 1) (2, 2) (2, 3) (2, 4) (l 1, 1) (l 1, 2) (l 1, 3) (l 1, 4) (l, 1) (l, 2) (l, 3) (l, 4) Figure 1: The picture on the left shows the grid numbering, and the drawing on the right depicts the construction scheme of an optimal mtsp solution with m = 2 and the depot located at (1, 1) on the l 4 grid with value (4l 1) (4l 1) (4l 1) (4l 2) (4l 1) Figure 2: The four drawings indicate why mtsp solutions with m = 2 and the depot located at (1, 1) of the given values cannot exist on the l 4 grid. Theorem 2. Let the depot for all salespersons be located in one of the four corners of the l n grid. Then the value of the optimal mtsp solution considering Objective (I) with m = 2 and l, n 5 odd is (ln 2) The proof of the above theorem is omitted due to space restrictions and will be stated in a forthcoming paper. For future work it remains to investigate lower bounds, explicit construction schemes and hence optimal mtsp solutions for further grid sizes, different locations of the depot and more than two salespersons. Additionally, it would be interesting to determine corresponding results for Objectives (II) and (III). 6
7 References [1] S. Hayat, E. Yanmaz, and R. Muzaffar. Survey on unmanned aerial vehicle networks for civil applications: A communications viewpoint. IEEE Communications Surveys & Tutorials, [2] A. Fischer and P. Hungerländer. The traveling salesman problem on grids with forbidden neighborhoods. Journal of Combinatorial Optimization, 34:(3):891915,(2017). [3] A. Fischer, P. Hungerländer, and A. Jellen. The Traveling Salesperson Problem with Forbidden Neighborhoods on Regular 3D Grids. Operations Research Proceedings,
A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints
A Mixed Integer Linear Program for with Maintenance Constraints Sarah Frisch Philipp Hungerländer Anna Jellen Dominic Weinberger September 10, 2018 Abstract In this paper we investigate the Locomotive
More informationThe Multiple Checkpoint Ordering Problem
The Multiple Checkpoint Ordering Problem Philipp Hungerländer Kerstin Maier November 19, 2017 Abstract The multiple Checkpoint Ordering Problem (mcop) aims to find an optimal arrangement of n one-dimensional
More informationA Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows
A Mixed-Integer Linear Program for the Traveling Salesman Problem with Structured Time Windows Philipp Hungerländer Christian Truden 5th January 2017 Abstract In this extended abstract we introduce the
More informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More informationMVE165/MMG630, Applied Optimization Lecture 6 Integer linear programming: models and applications; complexity. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming: models and applications; complexity Ann-Brith Strömberg 2011 04 01 Modelling with integer variables (Ch. 13.1) Variables Linear programming (LP) uses continuous
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationAsymmetric Traveling Salesman Problem (ATSP): Models
Asymmetric Traveling Salesman Problem (ATSP): Models Given a DIRECTED GRAPH G = (V,A) with V = {,, n} verte set A = {(i, j) : i V, j V} arc set (complete digraph) c ij = cost associated with arc (i, j)
More informationNew Exact Approaches to Row Layout Problems
New Exact Approaches to Row Layout Problems Anja Fischer, Frank Fischer, Philipp Hungerländer November 3, 015 Abstract. Given a set of departments, a number of rows and pairwise connectivities between
More informationNew Integer Programming Formulations of the Generalized Travelling Salesman Problem
American Journal of Applied Sciences 4 (11): 932-937, 2007 ISSN 1546-9239 2007 Science Publications New Integer Programming Formulations of the Generalized Travelling Salesman Problem Petrica C. Pop Department
More informationIntroduction to Mathematical Programming IE406. Lecture 21. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 21 Dr. Ted Ralphs IE406 Lecture 21 1 Reading for This Lecture Bertsimas Sections 10.2, 10.3, 11.1, 11.2 IE406 Lecture 21 2 Branch and Bound Branch
More informationInteger Linear Programming (ILP)
Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents
More informationAlgorithms Re-Exam TIN093/DIT600
Algorithms Re-Exam TIN093/DIT600 Course: Algorithms Course code: TIN 093 (CTH), DIT 600 (GU) Date, time: 7th January 2016, 8:30 12:30 Building: M Responsible teacher: Peter Damaschke, Tel. 5405. Examiner:
More informationSolving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem
Solving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem GABRIELLA STECCO Department of Applied Mathematics, University Ca Foscari of Venice, Dorsoduro n. 3825/E, 30123 Venice,
More informationThe Traveling Salesman Problem with Pickup and Delivery. A polyhedral approach. IBM Research - Australia. Irina Dumitrescu
Australia The Traveling Salesman Problem with Pickup and Delivery A polyhedral approach Irina Dumitrescu Jean-Francois Cordeau, Gilbert Laporte, Stefan Ropke The TSP with Pickup and Delivery (TSPPD) Given:
More informationLecturer: Shuchi Chawla Topic: Inapproximability Date: 4/27/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Inapproximability Date: 4/27/2007 So far in this course, we have been proving upper bounds on the approximation factors
More informationCombinatorial Optimization
Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all
More information8.5 Sequencing Problems
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationJuly 18, Approximation Algorithms (Travelling Salesman Problem)
Approximation Algorithms (Travelling Salesman Problem) July 18, 2014 The travelling-salesman problem Problem: given complete, undirected graph G = (V, E) with non-negative integer cost c(u, v) for each
More informationAlgorithms and Theory of Computation. Lecture 22: NP-Completeness (2)
Algorithms and Theory of Computation Lecture 22: NP-Completeness (2) Xiaohui Bei MAS 714 November 8, 2018 Nanyang Technological University MAS 714 November 8, 2018 1 / 20 Set Cover Set Cover Input: a set
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 8 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2017 04 07 Lecture 8 Linear and integer optimization with applications
More informationTractable & Intractable Problems
Tractable & Intractable Problems We will be looking at : What is a P and NP problem NP-Completeness The question of whether P=NP The Traveling Salesman problem again Programming and Data Structures 1 Polynomial
More information16.410/413 Principles of Autonomy and Decision Making
6.4/43 Principles of Autonomy and Decision Making Lecture 8: (Mixed-Integer) Linear Programming for Vehicle Routing and Motion Planning Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute
More informationBounds on the Traveling Salesman Problem
Bounds on the Traveling Salesman Problem Sean Zachary Roberson Texas A&M University MATH 613, Graph Theory A common routing problem is as follows: given a collection of stops (for example, towns, stations,
More informationVIII. NP-completeness
VIII. NP-completeness 1 / 15 NP-Completeness Overview 1. Introduction 2. P and NP 3. NP-complete (NPC): formal definition 4. How to prove a problem is NPC 5. How to solve a NPC problem: approximate algorithms
More informationDecision Problems TSP. Instance: A complete graph G with non-negative edge costs, and an integer
Decision Problems The theory of NP-completeness deals only with decision problems. Why? Because if a decision problem is hard, then the corresponding optimization problem must be hard too. For example,
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationInteger Programming ISE 418. Lecture 8. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 8 Dr. Ted Ralphs ISE 418 Lecture 8 1 Reading for This Lecture Wolsey Chapter 2 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Duality for Mixed-Integer
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationNP-Completeness. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
NP-Completeness CptS 223 Advanced Data Structures Larry Holder School of Electrical Engineering and Computer Science Washington State University 1 Hard Graph Problems Hard means no known solutions with
More information21. Set cover and TSP
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 21. Set cover and TSP ˆ Set covering ˆ Cutting problems and column generation ˆ Traveling salesman problem Laurent Lessard (www.laurentlessard.com)
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More informationThe Traveling Salesman Problem: An Overview. David P. Williamson, Cornell University Ebay Research January 21, 2014
The Traveling Salesman Problem: An Overview David P. Williamson, Cornell University Ebay Research January 21, 2014 (Cook 2012) A highly readable introduction Some terminology (imprecise) Problem Traditional
More informationCS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More informationDetermine the size of an instance of the minimum spanning tree problem.
3.1 Algorithm complexity Consider two alternative algorithms A and B for solving a given problem. Suppose A is O(n 2 ) and B is O(2 n ), where n is the size of the instance. Let n A 0 be the size of the
More informationNP and Computational Intractability
NP and Computational Intractability 1 Polynomial-Time Reduction Desiderata'. Suppose we could solve X in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Reduction.
More informationPolynomial-time Reductions
Polynomial-time Reductions Disclaimer: Many denitions in these slides should be taken as the intuitive meaning, as the precise meaning of some of the terms are hard to pin down without introducing the
More informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationNP Complete Problems. COMP 215 Lecture 20
NP Complete Problems COMP 215 Lecture 20 Complexity Theory Complexity theory is a research area unto itself. The central project is classifying problems as either tractable or intractable. Tractable Worst
More informationNP-Completeness. Until now we have been designing algorithms for specific problems
NP-Completeness 1 Introduction Until now we have been designing algorithms for specific problems We have seen running times O(log n), O(n), O(n log n), O(n 2 ), O(n 3 )... We have also discussed lower
More informationIntroduction to integer programming III:
Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability
More informationTopics in Complexity Theory
Topics in Complexity Theory Announcements Final exam this Friday from 12:15PM-3:15PM Please let us know immediately after lecture if you want to take the final at an alternate time and haven't yet told
More informationAn Exact Algorithm for the Steiner Tree Problem with Delays
Electronic Notes in Discrete Mathematics 36 (2010) 223 230 www.elsevier.com/locate/endm An Exact Algorithm for the Steiner Tree Problem with Delays Valeria Leggieri 1 Dipartimento di Matematica, Università
More informationCHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY. E. Amaldi Foundations of Operations Research Politecnico di Milano 1
CHAPTER 3 FUNDAMENTALS OF COMPUTATIONAL COMPLEXITY E. Amaldi Foundations of Operations Research Politecnico di Milano 1 Goal: Evaluate the computational requirements (this course s focus: time) to solve
More informationPolynomial-Time Reductions
Reductions 1 Polynomial-Time Reductions Classify Problems According to Computational Requirements Q. Which problems will we be able to solve in practice? A working definition. [von Neumann 1953, Godel
More informationRevisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm Tolga Bektaş 1, Luís Gouveia 2, Daniel Santos 2 1 Centre for Operational Research, Management
More informationA Compact Linearisation of Euclidean Single Allocation Hub Location Problems
A Compact Linearisation of Euclidean Single Allocation Hub Location Problems J. Fabian Meier 1,2, Uwe Clausen 1 Institute of Transport Logistics, TU Dortmund, Germany Borzou Rostami 1, Christoph Buchheim
More informationChapter 34: NP-Completeness
Graph Algorithms - Spring 2011 Set 17. Lecturer: Huilan Chang Reference: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd Edition, The MIT Press. Chapter 34: NP-Completeness 2. Polynomial-time
More informationfrom notes written mostly by Dr. Matt Stallmann: All Rights Reserved
CSC 505, Fall 000: Week 0 Objectives: understand problem complexity and classes defined by it understand relationships among decision, witness, evaluation, and optimization problems understand what it
More informationData Structures in Java
Data Structures in Java Lecture 21: Introduction to NP-Completeness 12/9/2015 Daniel Bauer Algorithms and Problem Solving Purpose of algorithms: find solutions to problems. Data Structures provide ways
More informationApproximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs Haim Kaplan Tel-Aviv University, Israel haimk@post.tau.ac.il Nira Shafrir Tel-Aviv University, Israel shafrirn@post.tau.ac.il
More informationTotally unimodular matrices. Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems
Totally unimodular matrices Introduction to integer programming III: Network Flow, Interval Scheduling, and Vehicle Routing Problems Martin Branda Charles University in Prague Faculty of Mathematics and
More informationFakultät für Mathematik
The Asymmetric Quadratic Traveling Salesman Problem A. Fischer Preprint 2011-19 Fakultät für Mathematik Impressum: Herausgeber: Der Dekan der Fakultät für Mathematik an der Technischen Universität Chemnitz
More informationCS 6505, Complexity and Algorithms Week 7: NP Completeness
CS 6505, Complexity and Algorithms Week 7: NP Completeness Reductions We have seen some problems in P and NP, and we ve talked about space complexity. The Space Hierarchy Theorem showed us that there are
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationUSA Mathematical Talent Search Round 1 Solutions Year 27 Academic Year
1/1/27. Fill in the spaces of the grid to the right with positive integers so that in each 2 2 square with top left number a, top right number b, bottom left number c, and bottom right number d, either
More informationChapter 8. NP and Computational Intractability. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 8 NP and Computational Intractability Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 8.5 Sequencing Problems Basic genres.! Packing problems: SET-PACKING,
More informationA Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
A Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems Mauro Franceschelli Daniele Rosa Carla Seatzu Francesco Bullo Dep of Electrical and Electronic Engineering, Univ of Cagliari, Italy (e-mail:
More informationInstitute of Operating Systems and Computer Networks Algorithms Group. Network Algorithms. Tutorial 3: Shortest paths and other stuff
Institute of Operating Systems and Computer Networks Algorithms Group Network Algorithms Tutorial 3: Shortest paths and other stuff Christian Rieck Shortest paths: Dijkstra s algorithm 2 Dijkstra s algorithm
More informationPOLYNOMIAL MILP FORMULATIONS
POLYNOMIAL MILP FORMULATIONS Miller-Tucker-Zemlin (J. ACM, 1960); Gavish-Graves (MIT Tech. Report 1978) Fox-Gavish-Graves (Operations Research 1980); Wong (IEEE Conference, 1980); Claus (SIAM J. on Algebraic
More informationSAT, Coloring, Hamiltonian Cycle, TSP
1 SAT, Coloring, Hamiltonian Cycle, TSP Slides by Carl Kingsford Apr. 28, 2014 Sects. 8.2, 8.7, 8.5 2 Boolean Formulas Boolean Formulas: Variables: x 1, x 2, x 3 (can be either true or false) Terms: t
More informationNP-Completeness I. Lecture Overview Introduction: Reduction and Expressiveness
Lecture 19 NP-Completeness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationCS6999 Probabilistic Methods in Integer Programming Randomized Rounding Andrew D. Smith April 2003
CS6999 Probabilistic Methods in Integer Programming Randomized Rounding April 2003 Overview 2 Background Randomized Rounding Handling Feasibility Derandomization Advanced Techniques Integer Programming
More informationCS 320, Fall Dr. Geri Georg, Instructor 320 NP 1
NP CS 320, Fall 2017 Dr. Geri Georg, Instructor georg@colostate.edu 320 NP 1 NP Complete A class of problems where: No polynomial time algorithm has been discovered No proof that one doesn t exist 320
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More informationHamiltonian Graphs Graphs
COMP2121 Discrete Mathematics Hamiltonian Graphs Graphs Hubert Chan (Chapter 9.5) [O1 Abstract Concepts] [O2 Proof Techniques] [O3 Basic Analysis Techniques] 1 Hamiltonian Paths and Circuits [O1] A Hamiltonian
More informationOptimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem
Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 20 Travelling Salesman Problem Today we are going to discuss the travelling salesman problem.
More informationUse estimation strategies reasonably and fluently while integrating content from each of the other strands. PO 1. Recognize the limitations of
for Strand 1: Number and Operations Concept 1: Number Sense Understand and apply numbers, ways of representing numbers, and the relationships among numbers and different number systems. PO 1. Solve problems
More informationImproved methods for the Travelling Salesperson with Hotel Selection
Improved methods for the Travelling Salesperson with Hotel Selection Marco Castro marco.castro@ua.ac.be ANT/OR November 23rd, 2011 Contents Problem description Motivation Mathematical formulation Solution
More informationLecture 4: NP and computational intractability
Chapter 4 Lecture 4: NP and computational intractability Listen to: Find the longest path, Daniel Barret What do we do today: polynomial time reduction NP, co-np and NP complete problems some examples
More information4/12/2011. Chapter 8. NP and Computational Intractability. Directed Hamiltonian Cycle. Traveling Salesman Problem. Directed Hamiltonian Cycle
Directed Hamiltonian Cycle Chapter 8 NP and Computational Intractability Claim. G has a Hamiltonian cycle iff G' does. Pf. Suppose G has a directed Hamiltonian cycle Γ. Then G' has an undirected Hamiltonian
More informationTHE TRAVELING SALESMAN PROBLEM (TSP) is one
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems pp. 377 384 Quadratic TSP: A lower bounding procedure and a column generation approach Borzou Rostami, Federico
More informationLECTURE 1: INTRODUCTION
LECTURE 1: INTRODUCTION What is a Network? What is a Network? What is the meaning of Network Flows? In our course, a network G=(N,A) consists of a finite number of nodes (in N) which are connected by arcs
More informationClasses of Problems. CS 461, Lecture 23. NP-Hard. Today s Outline. We can characterize many problems into three classes:
Classes of Problems We can characterize many problems into three classes: CS 461, Lecture 23 Jared Saia University of New Mexico P is the set of yes/no problems that can be solved in polynomial time. Intuitively
More informationThe P versus NP Problem. Ker-I Ko. Stony Brook, New York
The P versus NP Problem Ker-I Ko Stony Brook, New York ? P = NP One of the seven Millenium Problems The youngest one A folklore question? Has hundreds of equivalent forms Informal Definitions P : Computational
More informationArizona Mathematics Standards Articulated by Grade Level (2008) for College Work Readiness (Grades 11 and 12)
Strand 1: Number and Operations Concept 1: Number Sense Understand and apply numbers, ways of representing numbers, and the relationships among numbers and different number systems. College Work Readiness
More informationModeling with Integer Programming
Modeling with Integer Programg Laura Galli December 18, 2014 We can use 0-1 (binary) variables for a variety of purposes, such as: Modeling yes/no decisions Enforcing disjunctions Enforcing logical conditions
More informationNP-Complete Problems and Approximation Algorithms
NP-Complete Problems and Approximation Algorithms Efficiency of Algorithms Algorithms that have time efficiency of O(n k ), that is polynomial of the input size, are considered to be tractable or easy
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 9: INTRACTABILITY COMP3121/3821/9101/9801 1 / 29 Feasibility
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 15: The Greedy Heuristic Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/ School of
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationLower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem
Lower bounding procedure for the Asymmetric Quadratic Traveling Salesman Problem Borzou Rostami a,, Federico Malucelli b, Pietro Belotti c, Stefano Gualandi d a Fakultät für Mathematik, TU Dortmund, Germany
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More information1 Heuristics for the Traveling Salesman Problem
Praktikum Algorithmen-Entwurf (Teil 9) 09.12.2013 1 1 Heuristics for the Traveling Salesman Problem We consider the following problem. We want to visit all the nodes of a graph as fast as possible, visiting
More informationModels and Cuts for the Two-Echelon Vehicle Routing Problem
Models and Cuts for the Two-Echelon Vehicle Routing Problem Guido Perboli Roberto Tadei Francesco Masoero Department of Control and Computer Engineering, Politecnico di Torino Corso Duca degli Abruzzi,
More informationWeek 8. 1 LP is easy: the Ellipsoid Method
Week 8 1 LP is easy: the Ellipsoid Method In 1979 Khachyan proved that LP is solvable in polynomial time by a method of shrinking ellipsoids. The running time is polynomial in the number of variables n,
More informationCorrectness of Dijkstra s algorithm
Correctness of Dijkstra s algorithm Invariant: When vertex u is deleted from the priority queue, d[u] is the correct length of the shortest path from the source s to vertex u. Additionally, the value d[u]
More informationComputational Complexity
Computational Complexity Problems, instances and algorithms Running time vs. computational complexity General description of the theory of NP-completeness Problem samples 1 Computational Complexity What
More information15.083J/6.859J Integer Optimization. Lecture 2: Efficient Algorithms and Computational Complexity
15.083J/6.859J Integer Optimization Lecture 2: Efficient Algorithms and Computational Complexity 1 Outline Efficient algorithms Slide 1 Complexity The classes P and N P The classes N P-complete and N P-hard
More information6 Markov Chain Monte Carlo (MCMC)
6 Markov Chain Monte Carlo (MCMC) The underlying idea in MCMC is to replace the iid samples of basic MC methods, with dependent samples from an ergodic Markov chain, whose limiting (stationary) distribution
More informationOn the complexity of approximate multivariate integration
On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 USA ioannis.koutis@cs.cmu.edu January 11, 2005 Abstract
More information8.5 Sequencing Problems. Chapter 8. NP and Computational Intractability. Hamiltonian Cycle. Hamiltonian Cycle
Chapter 8 NP and Computational Intractability 8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems:
More informationA. Incorrect! Replacing is not a method for solving systems of equations.
ACT Math and Science - Problem Drill 20: Systems of Equations No. 1 of 10 1. What methods were presented to solve systems of equations? (A) Graphing, replacing, and substitution. (B) Solving, replacing,
More informationNP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More informationScheduling and Optimization Course (MPRI)
MPRI Scheduling and optimization: lecture p. /6 Scheduling and Optimization Course (MPRI) Leo Liberti LIX, École Polytechnique, France MPRI Scheduling and optimization: lecture p. /6 Teachers Christoph
More information1 ** The performance objectives highlighted in italics have been identified as core to an Algebra II course.
Strand One: Number Sense and Operations Every student should understand and use all concepts and skills from the pervious grade levels. The standards are designed so that new learning builds on preceding
More informationInteger programming for the MAP problem in Markov random fields
Integer programming for the MAP problem in Markov random fields James Cussens, University of York HIIT, 2015-04-17 James Cussens, University of York MIP for MRF MAP HIIT, 2015-04-17 1 / 21 Markov random
More informationChapter 8. NP and Computational Intractability
Chapter 8 NP and Computational Intractability Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. Acknowledgement: This lecture slide is revised and authorized from Prof.
More informationBranch-and-Bound. Leo Liberti. LIX, École Polytechnique, France. INF , Lecture p. 1
Branch-and-Bound Leo Liberti LIX, École Polytechnique, France INF431 2011, Lecture p. 1 Reminders INF431 2011, Lecture p. 2 Problems Decision problem: a question admitting a YES/NO answer Example HAMILTONIAN
More information