Mathematical Optimization and Public Transportation

Total Page:16

File Type:pdf, Size:1020Kb

Mathematical Optimization and Public Transportation Mathematical Optimization and Public Transportation Dr. Ralf Bornd¨orfer Kumulative Habilitationsschrift an der Fakult¨at II – Mathematik und Naturwissenschaften der Technischen Universit¨at Berlin Lehrgebiet: Mathematik Er¨offnung des Verfahrens: 30.09.2009 Verleihung der Lehrbef¨ahigung: 20.06.2010 Gutachter Prof. Dr. Dr. h.c. mult. Martin Gr¨otschel Prof. Dr. Thomas Liebling Prof. Dr. Rolf H. M¨ohring Prof. Dr. Uwe Zimmermann Berlin 2010 D 83 Table of Contents Titlepage i Table of Contents i List of Figures iii List of Tables v List of Publications vii Introduction viii I Set Packing Relaxations of Some Integer Programs 1 1 Introduction .......................... 1 2 Terminology .......................... 3 3 The Acyclic Subdigraph and the Linear Ordering Problem 7 4 The Clique Partitioning Problem ............... 16 5 The Set Packing Problem ................... 20 II Combinatorial Packing Problems 32 1 Introduction .......................... 32 2 Combinatorial Packing .................... 34 3 Dantzig-Wolfe Set Packing Formulations ........... 39 III Decomposing Matrices into Blocks 49 1 Introduction .......................... 50 2 Integer Programming Formulation and Related Problems . 52 3 Polyhedral Investigations ................... 55 4 A Branch-And-Cut Algorithm ................ 67 5 Computational Results .................... 78 IV A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit 92 1 Introduction .......................... 93 2 Notation ............................ 95 3 Integrated Vehicle and Duty Scheduling ........... 95 4 A Bundle Method ....................... 98 5 Computational Results .................... 109 6 Conclusions ........................... 115 i Table of Contents ii V Models for Railway Track Allocation 118 1 Introduction .......................... 119 2 The Optimal Track Allocation Problem ........... 120 3 Integer Programming Models ................. 122 4 Computational Results .................... 129 VI A Column Generation Approach to Line Planning in Pub- lic Transport 135 1 Introduction .......................... 135 2 Related Work .......................... 137 3 Line Planning Model ...................... 138 4 Column Generation ...................... 143 5 Computational Results .................... 149 6 Conclusions ........................... 154 Index 157 Curriculum Vitae 174 List of Figures I Set Packing Relaxations of Some Integer Programs 1 1 A 4-Fence. ........................... 9 2 A M¨obius Ladder of 5 Dicycles. .............. 9 3 A Fence Clique of Forks. ................... 10 4 A M¨obius Cycle of Dipaths. .................. 10 5 A 2-Chorded Cycle. ...................... 17 6 Labeling Lower Triangles. ................... 18 7 An Odd Cycle of Lower Triangle Inequalities. ........ 19 8 A 5-Wheel. ........................... 22 9 A Cycle of Nodes and Edges. ................. 22 10 Two Generalizations of Odd Wheel Inequalities. ...... 23 11 A 5-Wheel of Type I and a 5-Cycle of Paths. ........ 24 12 A 5-Wheel of Type II and a 5-Cycle of Paths. ........ 25 13 A 5-Cycle of 5-Cycles. ..................... 27 II Combinatorial Packing Problems 32 1 Bipartite 2-Coloring. ...................... 38 2 Intersection Graph of a Combinatorial 2-Packing Problem. 42 III Decomposing Matrices into Blocks 49 1 Decomposing a Matrix into Bordered Block Diagonal Form. 50 IV A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit 92 1 IS-OPT Runtime Chart. .................... 107 2 Scheduling Graph for Scenario Fulda. ............ 113 V Models for Railway Track Allocation 118 1 Optimal Track Allocation Problem: Infrastructure Network (left), and Train Routing Digraph (right); Individual Train Routing Digraphs Bear Different Colors. ........... 121 2 Block Conflicts on a Single Track: Trips for a Slow (blue) and a Fast (red) Train (left), a Conflict-Free Configuration of Four Trips on this Track (middle), and the Block Conflict Graph Associated With the Track (right). .......... 123 iii List of Figures iv 3 Configuration Routing Digraph for a Single Track: Train Routing Digraph (left), Configuration (half-left), Configu- ration Routing Digraph (half-right), and the Corresponding Path (right). .......................... 127 4 Solving Models APP′, ACP, and PCP. ............ 131 VI A Column Generation Approach to Line Planning in Pub- lic Transport 135 1 Multi-Modal Transportation Network in Potsdam. Black: Tram, Lightgray: Bus, Darkgray: Ferry, Large Nodes: Ter- minals, Small Nodes: Stations, Grey: Rivers and Lakes. 139 2 The Node Splitting Gadget in the Proof of Proposition 4.1 145 3 Total Traveling Time (solid, left axis) and Total Line Cost (dashed, right axis) in Dependence on λ (x-axis in logscale). 153 List of Tables I Set Packing Relaxations of Some Integer Programs 1 II Combinatorial Packing Problems 32 III Decomposing Matrices into Blocks 49 1 Decomposing Linear Programming Basis Matrices. ..... 81 2 Decomposing Matrices of Mixed Integer Programs. ..... 83 3 Decomposing Transp. Matrices of Mixed Integer Programs. 85 4 Comparing Integer Programming Branching Rules. ..... 86 5 Decomposing Steiner-Tree Packing Problems. ........ 88 6 Equipartitioning Matrices. .................. 89 IV A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit 92 1 Statistics on the RVB Instances. ............... 110 2 Results for the RVB Sunday Scenario. ............ 111 3 Results for the RVB Workday Scenario. ........... 112 4 RKH Scenarios Marburg and Fulda. ............. 113 5 Solutions for Scenarios Marburg and Fulda. ......... 114 6 Results for ECOPT-Instances with 2 Depots Variant A. 114 7 Results for ECOPT-Instances with 4 Depots Variant A. 115 V Models for Railway Track Allocation 118 1 Notation for the Optimal Track Allocation Problem. 120 2 Sizes of Packing Formulations for the Track Alloc. Problem. 124 3 Sizes of Packing Formulations for the Track Alloc. Problem. 126 4 Test Scenarios. ......................... 131 5 Solving Model APP′ for Scenario 570. ............ 132 6 Solving Model ACP for Scenario 570. ............ 132 7 Solving Model PCP for Scenario 570. ............ 133 VI A Column Generation Approach to Line Planning in Pub- lic Transport 135 1 Notation and Terminology. .................. 140 2 Experimental Line Planning Results for λ = 0.9978. 151 v List of Algorithms I Set Packing Relaxations of Some Integer Programs 1 II Combinatorial Packing Problems 32 III Decomposing Matrices into Blocks 49 1 Separating z-Cover Inequalities With a Greedy Heuristic. 68 IV A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit 92 1 Generic Proximal Bundle Method (PBM). .......... 101 2 Inexact Proximal Bundle Method (PBM) with Column Gen- eration. ............................. 106 V Models for Railway Track Allocation 118 VI A Column Generation Approach to Line Planning in Pub- lic Transport 135 vi List of Publications [1] R. Borndorfer¨ & R. Weismantel. Set packing relaxations of some integer programs. Mathematical Programming 88:425–450, 2000. [2] R. Borndorfer¨ . Combinatorial packing problems. In M. Grotschel¨ , (Ed.), The Sharpest Cut – The Impact of Manfred Padberg and His Work, pp. 19–32. SIAM, Philadelphia, 2004. [3] R. Borndorfer,¨ C. E. Ferreira & A. Martin. Decomposing matrices into blocks. SIAM Journal on Optimization 9(1):236–269, 1998. [4] R. Borndorfer,¨ A. Lobel¨ & S. Weider. A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. In M. Hickman, P. Mirchandani & S. Voß, (Eds.), Computer-aided Systems in Public Transport, vol. 600 of Lecture Notes in Economics and Mathematical Systems, pp. 3–24. Springer-Verlag, 2008. [5] R. Borndorfer¨ & T. Schlechte. Models for railway track allocation. In C. Liebchen, R. K. Ahuja & J. A. Mesa, (Eds.), Proceeding of the 7th Workshop on Algorithmic Approaches for Transportation Model- ing, Optimization, and Systems (ATMOS 2007), Dagstuhl, Germany, 2007. Internationales Begegbnungs- und Forschungszentrum f¨ur In- formatik (IBFI), Schloss Dagstuhl, Germany. [6] R. Borndorfer,¨ M. Grotschel¨ & M. E. Pfetsch. A column-generation approach to line planning in public transport. Transportation Science 41(1):123–132, 2007. vii Introduction I submit in this cumulative thesis the following six papers for obtaining the habilitation at the Technische Universit¨at Berlin, Fakult¨at II – Mathematik und Naturwissenschaften: (1) Set packing relaxations of some integer programs. (2) Combinatorial packing problems. (3) Decomposing matrices into blocks. (4) A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. (5) Models for railway track allocation. (6) A column-generation approach to line planning in public transport. I have made some changes to the papers compared to the published versions. These pertain to layout unifications, i.e., common numbering, figure, table, and chapter head layout. I have not changed any notation or symbols, but I have eliminated some typos, updated the references, and added links and an index. The mathematical content is identical. The papers are about the optimization of public transportation systems, i.e., bus networks, railways, and airlines, and its mathematical foundations, i.e., the theory of packing problems. The papers discuss mathematical models, theoretical analyses, algorithmic approaches, and computational aspects of and to problems in this area. Papers 1, 2, and 3 are theoretical. They aim at establishing a theory of packing problems as a general
Recommended publications
  • A Branch-And-Price Approach with Milp Formulation to Modularity Density Maximization on Graphs
    A BRANCH-AND-PRICE APPROACH WITH MILP FORMULATION TO MODULARITY DENSITY MAXIMIZATION ON GRAPHS KEISUKE SATO Signalling and Transport Information Technology Division, Railway Technical Research Institute. 2-8-38 Hikari-cho, Kokubunji-shi, Tokyo 185-8540, Japan YOICHI IZUNAGA Information Systems Research Division, The Institute of Behavioral Sciences. 2-9 Ichigayahonmura-cho, Shinjyuku-ku, Tokyo 162-0845, Japan Abstract. For clustering of an undirected graph, this paper presents an exact algorithm for the maximization of modularity density, a more complicated criterion to overcome drawbacks of the well-known modularity. The problem can be interpreted as the set-partitioning problem, which reminds us of its integer linear programming (ILP) formulation. We provide a branch-and-price framework for solving this ILP, or column generation combined with branch-and-bound. Above all, we formulate the column gen- eration subproblem to be solved repeatedly as a simpler mixed integer linear programming (MILP) problem. Acceleration tech- niques called the set-packing relaxation and the multiple-cutting- planes-at-a-time combined with the MILP formulation enable us to optimize the modularity density for famous test instances in- cluding ones with over 100 vertices in around four minutes by a PC. Our solution method is deterministic and the computation time is not affected by any stochastic behavior. For one of them, column generation at the root node of the branch-and-bound tree arXiv:1705.02961v3 [cs.SI] 27 Jun 2017 provides a fractional upper bound solution and our algorithm finds an integral optimal solution after branching. E-mail addresses: (Keisuke Sato) [email protected], (Yoichi Izunaga) [email protected].
    [Show full text]
  • Optimal Placement by Branch-And-Price
    Optimal Placement by Branch-and-Price Pradeep Ramachandaran1 Ameya R. Agnihotri2 Satoshi Ono2;3;4 Purushothaman Damodaran1 Krishnaswami Srihari1 Patrick H. Madden2;4 SUNY Binghamton SSIE1 and CSD2 FAIS3 University of Kitakyushu4 Abstract— Circuit placement has a large impact on all aspects groups of up to 36 elements. The B&P approach is based of performance; speed, power consumption, reliability, and cost on column generation techniques and B&B. B&P has been are all affected by the physical locations of interconnected applied to solve large instances of well known NP-Complete transistors. The placement problem is NP-Complete for even simple metrics. problems such as the Vehicle Routing Problem [7]. In this paper, we apply techniques developed by the Operations We have tested our approach on benchmarks with known Research (OR) community to the placement problem. Using optimal configurations, and also on problems extracted from an Integer Programming (IP) formulation and by applying a the “final” placements of a number of recent tools (Feng Shui “branch-and-price” approach, we are able to optimally solve 2.0, Dragon 3.01, and mPL 3.0). We find that suboptimality is placement problems that are an order of magnitude larger than those addressed by traditional methods. Our results show that rampant: for optimization windows of nine elements, roughly suboptimality is rampant on the small scale, and that there is half of the test cases are suboptimal. As we scale towards merit in increasing the size of optimization windows used in detail windows with thirtysix elements, we find that roughly 85% of placement.
    [Show full text]
  • Branch-And-Bound Experiments in Convex Nonlinear Integer Programming
    Noname manuscript No. (will be inserted by the editor) More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming Pierre Bonami · Jon Lee · Sven Leyffer · Andreas W¨achter September 29, 2011 Abstract Branch-and-Bound (B&B) is perhaps the most fundamental algorithm for the global solution of convex Mixed-Integer Nonlinear Programming (MINLP) prob- lems. It is well-known that carrying out branching in a non-simplistic manner can greatly enhance the practicality of B&B in the context of Mixed-Integer Linear Pro- gramming (MILP). No detailed study of branching has heretofore been carried out for MINLP, In this paper, we study and identify useful sophisticated branching methods for MINLP. 1 Introduction Branch-and-Bound (B&B) was proposed by Land and Doig [26] as a solution method for MILP (Mixed-Integer Linear Programming) problems, though the term was actually coined by Little et al. [32], shortly thereafter. Early work was summarized in [27]. Dakin [14] modified the branching to how we commonly know it now and proposed its extension to convex MINLPs (Mixed-Integer Nonlinear Programming problems); that is, MINLP problems for which the continuous relaxation is a convex program. Though a very useful backbone for ever-more-sophisticated algorithms (e.g., Branch- and-Cut, Branch-and-Price, etc.), the basic B&B algorithm is very elementary. How- Pierre Bonami LIF, Universit´ede Marseille, 163 Av de Luminy, 13288 Marseille, France E-mail: [email protected] Jon Lee Department of Industrial and Operations Engineering, University
    [Show full text]
  • Generic Branch-Cut-And-Price
    Generic Branch-Cut-and-Price Diplomarbeit bei PD Dr. M. L¨ubbecke vorgelegt von Gerald Gamrath 1 Fachbereich Mathematik der Technischen Universit¨atBerlin Berlin, 16. M¨arz2010 1Konrad-Zuse-Zentrum f¨urInformationstechnik Berlin, [email protected] 2 Contents Acknowledgments iii 1 Introduction 1 1.1 Definitions . .3 1.2 A Brief History of Branch-and-Price . .6 2 Dantzig-Wolfe Decomposition for MIPs 9 2.1 The Convexification Approach . 11 2.2 The Discretization Approach . 13 2.3 Quality of the Relaxation . 21 3 Extending SCIP to a Generic Branch-Cut-and-Price Solver 25 3.1 SCIP|a MIP Solver . 25 3.2 GCG|a Generic Branch-Cut-and-Price Solver . 27 3.3 Computational Environment . 35 4 Solving the Master Problem 39 4.1 Basics in Column Generation . 39 4.1.1 Reduced Cost Pricing . 42 4.1.2 Farkas Pricing . 43 4.1.3 Finiteness and Correctness . 44 4.2 Solving the Dantzig-Wolfe Master Problem . 45 4.3 Implementation Details . 48 4.3.1 Farkas Pricing . 49 4.3.2 Reduced Cost Pricing . 52 4.3.3 Making Use of Bounds . 54 4.4 Computational Results . 58 4.4.1 Farkas Pricing . 59 4.4.2 Reduced Cost Pricing . 65 5 Branching 71 5.1 Branching on Original Variables . 73 5.2 Branching on Variables of the Extended Problem . 77 5.3 Branching on Aggregated Variables . 78 5.4 Ryan and Foster Branching . 79 i ii Contents 5.5 Other Branching Rules . 82 5.6 Implementation Details . 85 5.6.1 Branching on Original Variables . 87 5.6.2 Ryan and Foster Branching .
    [Show full text]
  • A Branch and Price Approach to the K-Clustering Minimum Biclique Completion Problem
    A Branch and Price Approach to the k-Clustering Minimum Biclique Completion Problem Stefano Gualandia,1, Francesco Maffiolib, Claudio Magnic aDipartimento di Matematica, Universit`adegli Studi di Pavia, Via Ferrata 1, 27100, Pavia, Italy bPolitecnico di Milano, Dipartimento di Elettronica e Informazione, Piazza Leonardo da Vinci 32, 20133 Milano, Italy cMax Planck Institute for Computer Science, Department 1: Algorithms and Complexity, Campus E1 4, 66123 Saarbr¨ucken, Germany Abstract Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called ”clusters”, such that each vertex i of S appears in exactly one of them, every vertex j of T appears in each cluster in which at least one of its neighbors appears, and the total number of edges needed to make each cluster complete (i.e., to become a biclique) is minimized. This problem is known as k-clustering Minimum Biclique Completion Problem and has been shown strongly NP-hard. It has applications in bundling channels for multicast transmissions. Given a set of demands of services from clients, the application consists of finding k multicast sessions that partition the set of demands. Each service has to belong to a single multicast session, while each client can appear in more sessions. We extend previous work by developing a Branch and Price algorithm that embeds a new metaheuristic based on Variable Neighborhood Infeasible Search and a non-trivial branching rule. The metaheuristic is also adapted to solve efficiently the pricing subproblem. In addition to the random instances used in the literature, we present structured instances generated using the MovieLens data set collected by the GroupLens Research Project.
    [Show full text]
  • Branch-And-Price: Column Generation for Solving Huge Integer Programs ,Y
    BranchandPrice Column Generation for y Solving Huge Integer Programs Cynthia Barnhart Ellis L Johnson George L Nemhauser Martin WPSavelsb ergh Pamela H Vance School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta GA Abstract We discuss formulations of integer programs with a huge number of variables and their solution by column generation metho ds ie implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a no de of the branch andb ound tree We present classes of mo dels for whichthisapproach decomp oses the problem provides tighter LP relaxations and eliminates symmetryWethen discuss computational issues and implementation of column generation branchand b ound algorithms including sp ecial branching rules and ecientways to solvethe LP relaxation February Revised May Revised January Intro duction The successful solution of largescale mixed integer programming MIP problems re quires formulations whose linear programming LP relaxations give a go o d approxima Currently at MIT Currently at Auburn University This research has b een supp orted by the following grants and contracts NSF SES NSF and AFORS DDM NSF DDM NSF DMI and IBM MHV y An abbreviated and unrefereed version of this pap er app eared in Barnhart et al tion to the convex hull of feasible solutions In the last decade a great deal of attention has b een given to the branchandcut approach to solving MIPs Homan and Padb erg and Nemhauser and Wolsey give general exp ositions of this metho dology The basic
    [Show full text]
  • A Branch-And-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions
    A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions Z. Akca ∗ R.T. Berger † T.K Ralphs ‡ September 17, 2008 Abstract We investigate the problem of simultaneously determining the location of facilities and the design of vehicle routes to serve customer demands under vehicle and facility capacity restrictions. We present a set-partitioning-based formulation of the problem and study the relationship between this formulation and the graph-based formulations that have been used in previous studies of this problem. We describe a branch-and-price algorithm based on the set-partitioning formulation and discuss computational experi- ence with both exact and heuristic variants of this algorithm. 1 Introduction The design of a distribution system begins with the questions of where to locate the facilities and how to allo- cate customers to the selected facilities. These questions can be answered using location-allocation models, which are based on the assumption that customers are served individually on out-and-back routes. How- ever, when customers have demands that are less-than-truckload and thus can receive service from routes making multiple stops, the assumption of individual routes will not accurately capture the transportation cost. Therefore, the integration of location-allocation and routing decisions may yield more accurate and cost-effective solutions. In this paper, we investigate the so-called location and routing problem (LRP). Given a set of candidate facility locations and a set of customer locations, the objective of the LRP is to determine the number and location of facilities and construct a set of vehicle routes from facilities to customers in such a way as to minimize total system cost.
    [Show full text]
  • A Branch and Price Algorithm for a Stackelberg Security Game
    A Branch and Price Algorithm for a Stackelberg Security Game Felipe Lagosa, Fernando Ord´o~nezb, Martine Labb´ec aGeorgia Institute of Technology bUniversidad de Chile, [email protected], corresponding author cUniversit´eLibre de Bruxelles, [email protected] Abstract Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game problems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition algorithms, such as branch and price methods, make it possible to tackle instances large enough to represent games inspired in real world domians. In this work we focus on Stackelberg Games that arise from a security application and investigate the use of a new branch and price method to solve its mixed integer optimization formulation. We prove that the algorithm provides upper and lower bounds on the optimal solution at every iteration and investigate the use of stabilization heuristics. Our preliminary computational results compare this solution approach with previous decomposition methods obtained from alternative integer programming formulations of Stackelberg games. 1. Introduction Stackelberg games model the strategic interaction between players, where one participant { the leader { is able to commit to a strategy first, knowing that the remaining players { the followers { will take this strategy into account and respond in an optimal manner. These games have been used to represent markets in which a participant has significant market share and can commit to a strategy [19], where government decides tolls or capacities in a transportation network [11], and of late have been used to represent the attacker-defender interaction in security domains [9].
    [Show full text]
  • A Branch-And-Price Algorithm for Bin Packing Problem
    A BRANCH-AND-PRICE ALGORITHM FOR BIN PACKING PROBLEM MASOUD ATAEI A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE GRADUATE PROGRAM IN APPLIED AND INDUSTRIAL MATHEMATICS YORK UNIVERSITY TORONTO, ONTARIO August 2015 © Masoud Ataei, 2015 Abstract Bin Packing Problem examines the minimum number of identical bins needed to pack a set of items of various sizes. Employing branch-and-bound and column generation usually requires designation of the problem-specific branching rules compatible with the nature of the pricing sub-problem of column generation, or alternatively it requires determination of the k-best solutions of knapsack problem at level kth of the tree. Instead, we present a new approach to deal with the pricing sub-problem of column generation which handles two- dimensional knapsack problems. Furthermore, a set of new upper bounds for Bin Packing Problem is introduced in this work which employs solutions of the continuous relaxation of the set-covering formulation of Bin Packing Problem. These high quality upper bounds are computed inexpensively and dominate the ones generated by state-of-the-art methods. Keywords: Bin Packing Problem, Branch-and-Bound, Column Generation. ii To my parents iii Acknowledgments I would like to express my deep sense of appreciation to my supervisor, Dr. Michael Chen. Had it not been for his invaluable guidance and tremendous support, I would not be able to surmount all obstacles laid in the path of research. His flexibility and dedication allowed me to explore different areas of Operational Research that caught my interest while keeping in sight my road map and final goals.
    [Show full text]
  • Mathematical Models and Decomposition Algorithms for Cutting and Packing Problems
    Alma Mater Studiorum - Universit`adi Bologna Dottorato di Ricerca in Automatica e Ricerca Operativa Ciclo XXIX Settore concorsuale di afferenza: 01/A6 - RICERCA OPERATIVA Settore scientifico disciplinare: MAT/09 - RICERCA OPERATIVA Mathematical Models and Decomposition Algorithms for Cutting and Packing Problems Presentata da Maxence Delorme Coordinatore Dottorato Relatore Prof. Daniele Vigo Prof. Silvano Martello Co-relatore Prof. Manuel Iori Esame finale anno 2017 Contents Acknowledgments v 1 Introduction 1 2 BPP and CSP: Mathematical Models and Exact Algorithms 7 2.1 Introduction.................................... 7 2.2 Formalstatement................................. 10 2.3 Upperandlowerbounds............................. 11 2.3.1 Approximation algorithms . 12 2.3.2 Lowerbounds............................... 13 2.3.3 Heuristics and metaheuristics . 15 2.4 Pseudo-polynomial formulations . ...... 17 2.4.1 ConsiderationsonthebasicILPmodel. 17 2.4.2 One-cutformulation ........................... 19 2.4.3 DP-flowformulation ........................... 21 2.4.4 Arc-flowformulations . .. .. .. .. .. .. .. 23 2.5 Enumerationalgorithms . 24 2.5.1 Branch-and-bound ............................ 24 2.5.2 Constraint programming approaches . 26 2.6 Branch-and-price ................................ 26 2.6.1 Set covering formulation and column generation . ...... 26 2.6.2 Integerround-upproperty. 29 2.6.3 Branch(-and-cut)-and-price algorithms . ....... 30 2.7 Experimentalevaluation . 33 2.7.1 Benchmarks................................ 33 2.7.2 Computercodes
    [Show full text]
  • A Branch and Price Algorithm for a Stackelberg Security Game
    Computers & Industrial Engineering 111 (2017) 216–227 Contents lists available at ScienceDirect Computers & Industrial Engineering journal homepage: www.elsevier.com/locate/caie A branch and price algorithm for a Stackelberg Security Game ⇑ Felipe Lagos a, Fernando Ordóñez b, , Martine Labbé c,d a Georgia Institute of Technology, United States b Universidad de Chile, Chile c Université Libre de Bruxelles, Belgium d INRIA, Lille, France article info abstract Article history: Mixed integer optimization formulations are an attractive alternative to solve Stackelberg Game prob- Received 14 June 2017 lems thanks to the efficiency of state of the art mixed integer algorithms. In particular, decomposition Received in revised form 26 June 2017 algorithms, such as branch and price methods, make it possible to tackle instances large enough to rep- Accepted 28 June 2017 resent games inspired in real world domians. Available online 29 June 2017 In this work we focus on Stackelberg Games that arise from a security application and investigate the use of a new branch and price method to solve its mixed integer optimization formulation. We prove that Keywords: the algorithm provides upper and lower bounds on the optimal solution at every iteration and investigate Column generation the use of stabilization heuristics. Our preliminary computational results compare this solution approach Stackelberg games Security with previous decomposition methods obtained from alternative integer programming formulations of Stackelberg games. Ó 2017 Published by Elsevier Ltd. 1. Introduction to attack. Such Stackelberg Security Game models have been used in the deployment of decision support systems with specialized Stackelberg games model the strategic interaction between algorithms in real security domain applications (Jain et al., 2010; players, where one participant – the leader – is able to commit Pita, Tambe, Kiekintveld, Cullen, & Steigerwald, 2011; Shieh et al., to a strategy first, knowing that the remaining players – the follow- 2012).
    [Show full text]
  • B6.3 Integer Programming
    Course Organisation What is integer programming? Introductory Examples B6.3 Integer Programming Raphael Hauser Mathematical Institute University Of Oxford MT 2018 R. Hauser B6.3 Integer Programming Course Organisation What is integer programming? Introductory Examples 1 Course Organisation 2 What is integer programming? 3 Introductory Examples R. Hauser B6.3 Integer Programming Course Organisation What is integer programming? Introductory Examples Course Organisation Lectures Mon 14:00–15:00 Lecture Room L1 Thu 12:00–13:00, Lecture Room L3 Problem Sheets and Classes 6 problem sheets, classes in Weeks 3–7 of MT, and Week 1 of HT. R. Hauser B6.3 Integer Programming Course Organisation What is integer programming? Introductory Examples Class Details Class 1: Dr Ebrahim Patel & Mr Zhen Shao Tuesdays, 11 am - 12 pm, Week 3 (C3), Week 4 (C5), Week 5 (C3), Week 6 (C5), Week 7 (C5), Week 1, HT (C4) Hand in written work by: Fridays, 10 am, Week before class Class 2: Prof Raphael Hauser & Mr Julien Vaes Wed 9:00-10:00, Weeks 3-7 of MT (C5) and Week 1 of HT (place to be confirmed) Hand in written work by: Mon 12 noon Class 3: Prof Raphael Hauser & Mr Jonathan Grant-Peters Thu 9:00-10:00, Week 3 MT (C4), Weeks 4-7 MT (L5), and Week 1 of HT (place to be confirmed) Hand in written work by: Tue 12 noon R. Hauser B6.3 Integer Programming Course Organisation What is integer programming? Introductory Examples What is integer programming? Integer Programming concerns the mathematical analysis of and design of algorithms for optimisation problems of the following forms.
    [Show full text]