Column Generation and its applications
|
|
- Toby Ellis
- 5 years ago
- Views:
Transcription
1 Column Generation and its applications Murat Firat, dept. IE&IS, TU/e BPI Cluster meeting
2 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 2
3 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 3
4 Dierent industry sectors, dierent problems Telecommunication: Stable workforce assignments. PAGE 4
5 Dierent industry sectors, dierent problems Telecommunication: Stable workforce assignments. Telecommunication: Designing FTTH network. PAGE 5
6 Dierent industry sectors, dierent problems Telecommunication: Stable workforce assignments. Telecommunication: Designing FTTH network. Airport ground operations: Shift scheduling of workers. PAGE 6
7 Dierent industry sectors, dierent problems Telecommunication: Stable workforce assignments. Telecommunication: Designing FTTH network. Airport ground operations: Shift scheduling of workers. Logistics: Planning routes of vehicles. PAGE 7
8 Dierent industry sectors, dierent problems Telecommunication: Stable workforce assignments. Telecommunication: Designing FTTH network. Airport ground operations: Shift scheduling of workers. Logistics: Planning routes of vehicles. Machine learning: Constructing max-accuracy decision trees. PAGE 8
9 Instance sizes Stable workforce assignments: 100 workers, 25 jobs, 15 skills. PAGE 9
10 Instance sizes Stable workforce assignments: 100 workers, 25 jobs, 15 skills. Designing FTTH network: Local areas of 5-10K citizens, PAGE 10
11 Instance sizes Stable workforce assignments: 100 workers, 25 jobs, 15 skills. Designing FTTH network: Local areas of 5-10K citizens, Shift scheduling of airport workers: 200 workers, 4 weeks, 5 skills. PAGE 11
12 Instance sizes Stable workforce assignments: 100 workers, 25 jobs, 15 skills. Designing FTTH network: Local areas of 5-10K citizens, Shift scheduling of airport workers: 200 workers, 4 weeks, 5 skills. Planning routes of vehicles: 100-1K customers, 50 vehicles. PAGE 12
13 Instance sizes Stable workforce assignments: 100 workers, 25 jobs, 15 skills. Designing FTTH network: Local areas of 5-10K citizens, Shift scheduling of airport workers: 200 workers, 4 weeks, 5 skills. Planning routes of vehicles: 100-1K customers, 50 vehicles. Decision trees: 5K data instances, 50 attributes. PAGE 13
14 Common properties of the problems Strict feasibility requirements. PAGE 14
15 Common properties of the problems Strict feasibility requirements. Worst cases: NP-Hard. PAGE 15
16 Common properties of the problems Strict feasibility requirements. Worst cases: NP-Hard. Exponentially many feasible solutions PAGE 16
17 Common properties of the problems Strict feasibility requirements. Worst cases: NP-Hard. Exponentially many feasible solutions Many local optimal points. PAGE 17
18 Standard formulations One big formulation, low-quality bound. Stable workforce assignments: Worker-job decisions. PAGE 18
19 Standard formulations One big formulation, low-quality bound. Stable workforce assignments: Worker-job decisions. Shift scheduling of airport workers: Worker-shift decisions. PAGE 19
20 Standard formulations One big formulation, low-quality bound. Stable workforce assignments: Worker-job decisions. Shift scheduling of airport workers: Worker-shift decisions. Planning routes of vehicles: Vehicle-customer decisions. PAGE 20
21 Standard formulations One big formulation, low-quality bound. Stable workforce assignments: Worker-job decisions. Shift scheduling of airport workers: Worker-shift decisions. Planning routes of vehicles: Vehicle-customer decisions. Decision trees: Data row-tree node decisions. PAGE 21
22 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 22
23 Master formulations Stable workforce assignments: Team-job decisions. PAGE 23
24 Master formulations Stable workforce assignments: Team-job decisions. Shift scheduling of airport workers: Worker-schedule decisions. PAGE 24
25 Master formulations Stable workforce assignments: Team-job decisions. Shift scheduling of airport workers: Worker-schedule decisions. Planning routes of vehicles: Vehicle-route decisions. PAGE 25
26 Master formulations Stable workforce assignments: Team-job decisions. Shift scheduling of airport workers: Worker-schedule decisions. Planning routes of vehicles: Vehicle-route decisions. Decision trees: Data segment-tree node decisions. PAGE 26
27 Master formulation Linear programming model: PAGE 27
28 Master formulation Linear programming model: More complicated objects as decision variables. PAGE 28
29 Master formulation Linear programming model: More complicated objects as decision variables. Object set PAGE 29
30 Master formulation Linear programming model: More complicated objects as decision variables. Object set has exponentially many items. PAGE 30
31 Master formulation Linear programming model: More complicated objects as decision variables. Object set has exponentially many items. initially is empty or has few items. PAGE 31
32 Master formulation Linear programming model: More complicated objects as decision variables. Object set has exponentially many items. initially is empty or has few items. Iteratively nd promising columns and add them to object set. PAGE 32
33 Master formulation Linear programming model: More complicated objects as decision variables. Object set has exponentially many items. initially is empty or has few items. Iteratively nd promising columns and add them to object set. When no promising column exists: certicate for optimality. PAGE 33
34 Main loop of Column Generation Reduced cost of a column is PAGE 34
35 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. PAGE 35
36 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. estimated cost change per unit increase in its value. PAGE 36
37 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. estimated cost change per unit increase in its value. Adding promising columns PAGE 37
38 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. estimated cost change per unit increase in its value. Adding promising columns completes dual feasibility. PAGE 38
39 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. estimated cost change per unit increase in its value. Adding promising columns completes dual feasibility. improves primal objective. PAGE 39
40 Main loop of Column Generation Reduced cost of a column is violation amount of the corresponding dual constraint. estimated cost change per unit increase in its value. Adding promising columns completes dual feasibility. improves primal objective. No dual feasibility improvement primal optimality PAGE 40
41 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 41
42 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. PAGE 42
43 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. service demand within a planning horizon PAGE 43
44 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. service demand within a planning horizon labor regulations about shifts: PAGE 44
45 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. service demand within a planning horizon labor regulations about shifts: minimum resting time between shifts, PAGE 45
46 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. service demand within a planning horizon labor regulations about shifts: minimum resting time between shifts, maximum working time due to contracts, PAGE 46
47 Problem denition: Shift scheduling We are given: multi-skilled workers with availability info. service demand within a planning horizon labor regulations about shifts: minimum resting time between shifts, maximum working time due to contracts, night shifts: longer resting times. PAGE 47
48 Basic notation Let S be set of all schedules st. a schedule s S PAGE 48
49 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. PAGE 49
50 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. should comply all regulations PAGE 50
51 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. should comply all regulations should have length bet. 3-9 hrs. PAGE 51
52 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. should comply all regulations should have length bet. 3-9 hrs. For worker w W PAGE 52
53 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. should comply all regulations should have length bet. 3-9 hrs. For worker w W Sk d w indicates if worker w is skilled in skill type d D. PAGE 53
54 Basic notation Let S be set of all schedules st. a schedule s S covers time interval i N if s i = 1, not otherwise. should comply all regulations should have length bet. 3-9 hrs. For worker w W Sk d w indicates if worker w is skilled in skill type d D. Service demand Ri,d at time i in skill type d, PAGE 54
55 Master IP formulation Min subject to w W s S c swx sw Skws d i x sw R i,d, d D, i N w W x sw = 1, w W s S x sw {0, 1}, s S, w W PAGE 55
56 LP Relaxation of Master formulation Min subject to c swx sw w W s S Skws d i x sw R i,d, d D, i N w W s S x sw = 1, w W 0 x sw 1, s S, w W Note: Restricted set S S PAGE 56
57 LP Relaxation of Master formulation Min subject to c swx sw w W s S Duals Skws d i x sw R i,d, d D, i N π i,d w W x sw s S = 1, w W θ w 0 x sw 1, s S, w W Note: Restricted set S S PAGE 57
58 Reduced cost of column x sw Dual constraint of column x sw: Skws d i πi,d + θw c sw (1) Reduced cost of column x sw: d D i N c sw = c sw d D Skws d i πi,d θw (2) Case c sw < 0: (1) Estimated objective decrease (why?), (2) dual feasibility violation. i N PAGE 58
59 Pricing problem: Objective Pricing problem: Find the most promising column (schedule) with the objective min s S,w W = max s S,w W { c sw } Skws d i πi,d θw (3) d D i N { ( )} s i Skwπ d i,d c iw θw (4) i N d D PAGE 59
60 Pricing problem: Modeling Dene a graph, reds: shifts, blues: resting times, blacks: unavailability. PAGE 60
61 Pricing problem: Modeling Dene a graph, reds: shifts, blues: resting times, blacks: unavailability. labor regulations: arc structure and side constraints PAGE 61
62 Pricing problem: Modeling Dene a graph, reds: shifts, blues: resting times, blacks: unavailability. labor regulations: arc structure and side constraints Solve max w a x a subject to a PAGE 62
63 Pricing problem: Modeling Dene a graph, reds: shifts, blues: resting times, blacks: unavailability. labor regulations: arc structure and side constraints Solve max w a x a subject to a conservations, resting after shifts, passing unavailability arcs. PAGE 63
64 Pricing problem: Modeling Dene a graph, reds: shifts, blues: resting times, blacks: unavailability. labor regulations: arc structure and side constraints Solve max w a x a subject to a conservations, resting after shifts, passing unavailability arcs. Pricing: nd the constrained 0 N "Longest Path"! PAGE 64
65 Pricing problem: Modeling A schedule s on the graph looks like: PAGE 65
66 Column Generation overview Initialization: PAGE 66
67 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. PAGE 67
68 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. Warm up: Find several initial columns for a warm start of RMP. PAGE 68
69 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. Warm up: Find several initial columns for a warm start of RMP. Step 1: Solve the Restricted Master Problem, pass duals to pricing. PAGE 69
70 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. Warm up: Find several initial columns for a warm start of RMP. Step 1: Solve the Restricted Master Problem, pass duals to pricing. Step 2: Solve pricing: PAGE 70
71 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. Warm up: Find several initial columns for a warm start of RMP. Step 1: Solve the Restricted Master Problem, pass duals to pricing. Step 2: Solve pricing: If i : c i < 0: update S, go to Step 1. If i : c i 0: RMP is solved to optimality, go to Step 3. PAGE 71
72 Column Generation overview Initialization: Formulate Master ILP model, obtain the Restricted Master Problem (RMP). Express the reduced costs, formulate pricing. Warm up: Find several initial columns for a warm start of RMP. Step 1: Solve the Restricted Master Problem, pass duals to pricing. Step 2: Solve pricing: If i : c i < 0: update S, go to Step 1. If i : c i 0: RMP is solved to optimality, go to Step 3. Step 3: Output the RMP solution. PAGE 72
73 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 73
74 Towards integer solutions Having fractional RMP optimal solution, we have two choices: Use rounding heuristics: PAGE 74
75 Towards integer solutions Having fractional RMP optimal solution, we have two choices: Use rounding heuristics: Use meta heuristics to nd a feasible solution quickly (hopefully) PAGE 75
76 Towards integer solutions Having fractional RMP optimal solution, we have two choices: Use rounding heuristics: Use meta heuristics to nd a feasible solution quickly (hopefully) Make decisions how to (smartly) round the fractional solution PAGE 76
77 Towards integer solutions Having fractional RMP optimal solution, we have two choices: Use rounding heuristics: Use meta heuristics to nd a feasible solution quickly (hopefully) Make decisions how to (smartly) round the fractional solution Start a smart enumeration, e.g. Branch-and-Price, either. PAGE 77
78 Towards integer solutions Having fractional RMP optimal solution, we have two choices: Use rounding heuristics: Use meta heuristics to nd a feasible solution quickly (hopefully) Make decisions how to (smartly) round the fractional solution Start a smart enumeration, e.g. Branch-and-Price, either. to obtain "optimal" integer sol'n. to output "best-found" integer sol'n with quality measure in a time limit. PAGE 78
79 Outline Some real-life decision problems Standard formulations Basics of Column Generation Master formulations Case: Shift scheduling of airport workers Problem description Master formulation Reduced cost and pricing problem Column Generation overview Towards an integer solution Using data science in the CG approach PAGE 79
80 Using data science: Advantage or waste? Consider a data of instance history and their solutions. Find "similar" instances and round the current fractional solution towards corresponding solutions. PAGE 80
81 Using data science: Advantage or waste? Consider a data of instance history and their solutions. Find "similar" instances and round the current fractional solution towards corresponding solutions. Simply nd "similar" previous solutions to the current fractional solution and round accordingly. PAGE 81
82 Using data science: Advantage or waste? Consider a data of instance history and their solutions. Find "similar" instances and round the current fractional solution towards corresponding solutions. Simply nd "similar" previous solutions to the current fractional solution and round accordingly. Cluster instances and analyze the commonalities (patterns) in the cluster solutions. PAGE 82
83 THANKS PAGE 83
Algorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationA List Heuristic for Vertex Cover
A List Heuristic for Vertex Cover Happy Birthday Vasek! David Avis McGill University Tomokazu Imamura Kyoto University Operations Research Letters (to appear) Online: http://cgm.cs.mcgill.ca/ avis revised:
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationManpower Planning: Task Scheduling. Anders Høeg Dohn
: Task Scheduling Anders Høeg Dohn Scope During these lectures I will: Go over some of the practical problems encountered in manpower planning. Rostering Task Scheduling Propose models that can be used
More informationMachine Learning for Software Engineering
Machine Learning for Software Engineering Introduction and Motivation Prof. Dr.-Ing. Norbert Siegmund Intelligent Software Systems 1 2 Organizational Stuff Lectures: Tuesday 11:00 12:30 in room SR015 Cover
More informationBranch-price-and-cut for vehicle routing. Guy Desaulniers
Guy Desaulniers Professor, Polytechnique Montréal, Canada Director, GERAD, Canada VeRoLog PhD School 2018 Cagliari, Italy, June 2, 2018 Outline 1 VRPTW definition 2 Mathematical formulations Arc-flow formulation
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationMultiple Virtual Network Function Service Chain Placement and Routing using Column Generation
Multiple Virtual Network Function Service Chain Placement and Routing using Column Generation BY ABHISHEK GUPTA FRIDAY GROUP MEETING NOVEMBER 11, 2016 Virtual Network Function (VNF) Service Chain (SC)
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationGENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI
GENERAL ASSIGNMENT PROBLEM via Branch and Price JOHN AND LEI Outline Review the column generation in Generalized Assignment Problem (GAP) GAP Examples in Branch and Price 2 Assignment Problem The assignment
More informationReal time production optimization in upstream petroleum production - Applied to the Troll West oil rim
Real time production optimization in upstream petroleum production - Applied to the Troll West oil rim Vidar Gunnerud, Bjarne Foss Norwegian University of Science and Technology - NTNU Trondheim, Norway
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationLinear Programming. Readings: Read text section 11.6, and sections 1 and 2 of Tom Ferguson s notes (see course homepage).
Linear Programming Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory: Feasible Set, Vertices, Existence of Solutions. Equivalent formulations. Outline
More informationLinear Programming. Widget Factory Example. Linear Programming: Standard Form. Widget Factory Example: Continued.
Linear Programming Widget Factory Example Learning Goals. Introduce Linear Programming Problems. Widget Example, Graphical Solution. Basic Theory:, Vertices, Existence of Solutions. Equivalent formulations.
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationMartin W.P. Savelsbergh. Georgia Institute of Technology. School of Industrial and Systems Engineering
A MINTO short course 1 Martin W.P. Savelsbergh George L. Nemhauser Introduction Georgia Institute of Technology School of Industrial and Systems Engineering Atlanta, GA 30332-0205 (February 1, 1995) MINTO
More informationMinimum Weight Constrained Forest Problems. Problem Definition
Slide 1 s Xiaoyun Ji, John E. Mitchell Department of Mathematical Sciences Rensselaer Polytechnic Institute Troy, NY, USA jix@rpi.edu, mitchj@rpi.edu 2005 Optimization Days Montreal, Canada May 09, 2005
More informationConstruction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen
Construction of Minimum-Weight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen Outline Motivation and Background Minimum-Weight Spanner Problem Greedy Spanner Algorithm Exact Algorithm:
More informationAn Integer Programming Approach to Packing Lightpaths on WDM Networks 파장분할다중화망의광경로패킹에대한정수계획해법. 1. Introduction
Journal of the Korean Institute of Industrial Engineers Vol. 32, No. 3, pp. 219-225, September 2006. An Integer Programming Approach to Packing Lightpaths on WDM Networks Kyungsik Lee 1 Taehan Lee 2 Sungsoo
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/cot6936_s12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id=174
More informationModeling and Solving Location Routing and Scheduling Problems
Modeling and Solving Location Routing and Scheduling Problems Z. Akca R.T. Berger T.K Ralphs October 13, 2008 Abstract This paper studies location routing and scheduling problems, a class of problems in
More informationInteger Programming. Xi Chen. Department of Management Science and Engineering International Business School Beijing Foreign Studies University
Integer Programming Xi Chen Department of Management Science and Engineering International Business School Beijing Foreign Studies University Xi Chen (chenxi0109@bfsu.edu.cn) Integer Programming 1 / 42
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationThe MIP-Solving-Framework SCIP
The MIP-Solving-Framework SCIP Timo Berthold Zuse Institut Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 23.05.2007 What Is A MIP? Definition MIP The optimization problem
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationDepartment of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):
Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x
More informationApproximation Algorithms
Approximation Algorithms Given an NP-hard problem, what should be done? Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one of three desired features. Solve problem to optimality.
More informationSolving lexicographic multiobjective MIPs with Branch-Cut-Price
Solving lexicographic multiobjective MIPs with Branch-Cut-Price Marta Eso (The Hotchkiss School) Laszlo Ladanyi (IBM T.J. Watson Research Center) David Jensen (IBM T.J. Watson Research Center) McMaster
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationApproximation Algorithms
Approximation Algorithms Group Members: 1. Geng Xue (A0095628R) 2. Cai Jingli (A0095623B) 3. Xing Zhe (A0095644W) 4. Zhu Xiaolu (A0109657W) 5. Wang Zixiao (A0095670X) 6. Jiao Qing (A0095637R) 7. Zhang
More informationPreviously Local sensitivity analysis: having found an optimal basis to a problem in standard form,
Recap, and outline of Lecture 20 Previously Local sensitivity analysis: having found an optimal basis to a problem in standard form, if the cost vectors is changed, or if the right-hand side vector is
More informationAlgorithms for the Bin Packing Problem with Conflicts
Algorithms for the Bin Packing Problem with Conflicts Albert E. Fernandes Muritiba *, Manuel Iori, Enrico Malaguti*, Paolo Toth* *Dipartimento di Elettronica, Informatica e Sistemistica, Università degli
More informationPure Cutting Plane Methods for ILP: a computational perspective
Pure Cutting Plane Methods for ILP: a computational perspective Matteo Fischetti, DEI, University of Padova Rorschach test for OR disorders: can you see the tree? 1 Outline 1. Pure cutting plane methods
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationUsing Decomposition Techniques for Solving Large-Scale Capacitated Hub Location Problems with Single Assignment
Using Decomposition Techniques for Solving Large-Scale Capacitated Hub Location Problems with Single Assignment Ivan Contreras*, Elena Fernández Department of Statistics and Operations Research Technical
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The Branch-and-Price
More informationto the Traveling Salesman Problem 1 Susanne Timsj Applied Optimization and Modeling Group (TOM) Department of Mathematics and Physics
An Application of Lagrangian Relaxation to the Traveling Salesman Problem 1 Susanne Timsj Applied Optimization and Modeling Group (TOM) Department of Mathematics and Physics M lardalen University SE-721
More informationInteger Programming Explained Through Gomory s Cutting Plane Algorithm and Column Generation
Integer Programming Explained Through Gomory s Cutting Plane Algorithm and Column Generation Banhirup Sengupta, Dipankar Mondal, Prajjal Kumar De, Souvik Ash Proposal Description : ILP [integer linear
More informationLagrangean relaxation - exercises
Lagrangean relaxation - exercises Giovanni Righini Set covering We start from the following Set Covering Problem instance: min z = x + 2x 2 + x + 2x 4 + x 5 x + x 2 + x 4 x 2 + x x 2 + x 4 + x 5 x + x
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationSelected Topics in Column Generation
Selected Topics in Column Generation February 1, 2007 Choosing a solver for the Master Solve in the dual space(kelly s method) by applying a cutting plane algorithm In the bundle method(lemarechal), a
More informationFacility Location-Routing-Scheduling Problem: LRS
Facility Location-Routing-Scheduling Problem: LRS Zeliha Akca Lehigh University Rosemary Berger Lehigh University ➀ Definition of LRS ➁ Branch and Price Algorithm ➂ Mater and Pricing Problem ➃ Solution
More informationL2: Algorithms: Knapsack Problem & BnB
L2: Algorithms: Knapsack Problem & BnB This tutorial covers the basic topics on creating a forms application, common form controls and the user interface for the optimization models, algorithms and heuristics,
More informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A new 4 credit unit course Part of Theoretical Computer Science courses at the Department of Mathematics There will be 4 hours
More informationAlgorithms for Decision Support. Integer linear programming models
Algorithms for Decision Support Integer linear programming models 1 People with reduced mobility (PRM) require assistance when travelling through the airport http://www.schiphol.nl/travellers/atschiphol/informationforpassengerswithreducedmobility.htm
More informationComputational Integer Programming. Lecture 12: Branch and Cut. Dr. Ted Ralphs
Computational Integer Programming Lecture 12: Branch and Cut Dr. Ted Ralphs Computational MILP Lecture 12 1 Reading for This Lecture Wolsey Section 9.6 Nemhauser and Wolsey Section II.6 Martin Computational
More informationThe only known methods for solving this problem optimally are enumerative in nature, with branch-and-bound being the most ecient. However, such algori
Use of K-Near Optimal Solutions to Improve Data Association in Multi-frame Processing Aubrey B. Poore a and in Yan a a Department of Mathematics, Colorado State University, Fort Collins, CO, USA ABSTRACT
More informationApproximation Algorithms
Approximation Algorithms Frédéric Giroire FG Simplex 1/11 Motivation Goal: Find good solutions for difficult problems (NP-hard). Be able to quantify the goodness of the given solution. Presentation of
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
Bulletin of Mathematics Vol. 06, No. 0 (20), pp.. SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING Eddy Roflin, Sisca Octarina, Putra B. J Bangun,
More informationThe Heuristic (Dark) Side of MIP Solvers. Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL
The Heuristic (Dark) Side of MIP Solvers Asja Derviskadic, EPFL Vit Prochazka, NHH Christoph Schaefer, EPFL 1 Table of content [Lodi], The Heuristic (Dark) Side of MIP Solvers, Hybrid Metaheuristics, 273-284,
More informationCSE 417 Branch & Bound (pt 4) Branch & Bound
CSE 417 Branch & Bound (pt 4) Branch & Bound Reminders > HW8 due today > HW9 will be posted tomorrow start early program will be slow, so debugging will be slow... Review of previous lectures > Complexity
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
More informationA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation
More information15.082J and 6.855J. Lagrangian Relaxation 2 Algorithms Application to LPs
15.082J and 6.855J Lagrangian Relaxation 2 Algorithms Application to LPs 1 The Constrained Shortest Path Problem (1,10) 2 (1,1) 4 (2,3) (1,7) 1 (10,3) (1,2) (10,1) (5,7) 3 (12,3) 5 (2,2) 6 Find the shortest
More informationA Generic Separation Algorithm and Its Application to the Vehicle Routing Problem
A Generic Separation Algorithm and Its Application to the Vehicle Routing Problem Presented by: Ted Ralphs Joint work with: Leo Kopman Les Trotter Bill Pulleyblank 1 Outline of Talk Introduction Description
More information3 No-Wait Job Shops with Variable Processing Times
3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 10: Optimisation (1) A/Prof Chun Tung Chou CSE, UNSW COMP9334, Chun Tung Chou, 2016 Three Weeks of Optimisation The lectures for these
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING
More informationIntroduction to Linear Programming. Algorithmic and Geometric Foundations of Optimization
Introduction to Linear Programming Algorithmic and Geometric Foundations of Optimization Optimization and Linear Programming Mathematical programming is a class of methods for solving problems which ask
More informationHomework 2: Multi-unit combinatorial auctions (due Nov. 7 before class)
CPS 590.1 - Linear and integer programming Homework 2: Multi-unit combinatorial auctions (due Nov. 7 before class) Please read the rules for assignments on the course web page. Contact Vince (conitzer@cs.duke.edu)
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationExample: Map coloring
Today s s lecture Local Search Lecture 7: Search - 6 Heuristic Repair CSP and 3-SAT Solving CSPs using Systematic Search. Victor Lesser CMPSCI 683 Fall 2004 The relationship between problem structure and
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems In which we see how treating states as more than just little black boxes leads to the invention of a range of powerful new search methods and a deeper understanding of
More informationGraph Theory and Optimization Approximation Algorithms
Graph Theory and Optimization Approximation Algorithms Nicolas Nisse Université Côte d Azur, Inria, CNRS, I3S, France October 2018 Thank you to F. Giroire for some of the slides N. Nisse Graph Theory and
More information2 The Service Provision Problem The formulation given here can also be found in Tomasgard et al. [6]. That paper also details the background of the mo
Two-Stage Service Provision by Branch and Bound Shane Dye Department ofmanagement University of Canterbury Christchurch, New Zealand s.dye@mang.canterbury.ac.nz Asgeir Tomasgard SINTEF, Trondheim, Norway
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationThe ILP approach to the layered graph drawing. Ago Kuusik
The ILP approach to the layered graph drawing Ago Kuusik Veskisilla Teooriapäevad 1-3.10.2004 1 Outline Introduction Hierarchical drawing & Sugiyama algorithm Linear Programming (LP) and Integer Linear
More informationThe Size Robust Multiple Knapsack Problem
MASTER THESIS ICA-3251535 The Size Robust Multiple Knapsack Problem Branch and Price for the Separate and Combined Recovery Decomposition Model Author: D.D. Tönissen, Supervisors: dr. ir. J.M. van den
More informationMathematical programming algorithms for spatial cloaking
Mathematical programming algorithms for spatial cloaking Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi University of Milan, Dept. of Computer Science June 23, 2015 Abstract We consider
More informationFoundations of Computing
Foundations of Computing Darmstadt University of Technology Dept. Computer Science Winter Term 2005 / 2006 Copyright c 2004 by Matthias Müller-Hannemann and Karsten Weihe All rights reserved http://www.algo.informatik.tu-darmstadt.de/
More informationTwo-stage column generation
Two-stage column generation A novel framework Ilaria Vacca and Matteo Salani Transport and Mobility Laboratory EPFL 6th Joint Operations Research Days September 12, 2008 Two stage column generation p.1/15
More information56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997
56:272 Integer Programming & Network Flows Final Exam -- December 16, 1997 Answer #1 and any five of the remaining six problems! possible score 1. Multiple Choice 25 2. Traveling Salesman Problem 15 3.
More informationA Recovery Algorithm for a Disrupted Airline Schedule
1 A Recovery Algorithm for a Disrupted Airline Schedule Niklaus Eggenberg Matteo Salani and Prof. M. Bierlaire In collaboration with APM Technologies Index 2 Index Airline Scheduling in general The Disrupted
More informationBenders Decomposition
Benders Decomposition Using projections to solve problems thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline Introduction Using projections Benders decomposition Simple plant location
More informationA Column Generation based Heuristic for Maximum Lifetime Coverage in Wireless Sensor Networks
A Column Generation based Heuristic for Maximum Lifetime Coverage in Wireless Sensor Networks Karine Deschinkel LIFC Laboratory, Université de Franche-Comté Belfort, France Email: karine.deschinkel@univ-fcomte.fr
More informationIndex. optimal package assignments, 143 optimal package assignments, symmetrybreaking,
A Abstract approach, 79 Amphibian coexistence aquarium, 7 executes, 16 model, 13 15 modeling languages, 11 12 MPSolver, 12 OR-Tools library, 12 preys, 7 run a model, 17 18 solution, 17 three-step approach,
More informationSolving a Challenging Quadratic 3D Assignment Problem
Solving a Challenging Quadratic 3D Assignment Problem Hans Mittelmann Arizona State University Domenico Salvagnin DEI - University of Padova Quadratic 3D Assignment Problem Quadratic 3D Assignment Problem
More informationSolving the Euclidean Steiner Tree Problem in n-space
Solving the Euclidean Steiner Tree Problem in n-space Marcia Fampa (UFRJ), Jon Lee (U. Michigan), and Wendel Melo (UFRJ) January 2015 Marcia Fampa, Jon Lee, Wendel Melo Solving the Euclidean Steiner Tree
More informationApproximation Algorithms
Approximation Algorithms Prof. Tapio Elomaa tapio.elomaa@tut.fi Course Basics A 4 credit unit course Part of Theoretical Computer Science courses at the Laboratory of Mathematics There will be 4 hours
More informationDesign and Analysis of Algorithms (V)
Design and Analysis of Algorithms (V) An Introduction to Linear Programming Guoqiang Li School of Software, Shanghai Jiao Tong University Homework Assignment 2 is announced! (deadline Apr. 10) Linear Programming
More informationConstraint Satisfaction Problems
Last update: February 25, 2010 Constraint Satisfaction Problems CMSC 421, Chapter 5 CMSC 421, Chapter 5 1 Outline CSP examples Backtracking search for CSPs Problem structure and problem decomposition Local
More information5.4 Pure Minimal Cost Flow
Pure Minimal Cost Flow Problem. Pure Minimal Cost Flow Networks are especially convenient for modeling because of their simple nonmathematical structure that can be easily portrayed with a graph. This
More informationConstraint Satisfaction
Constraint Satisfaction Philipp Koehn 1 October 2015 Outline 1 Constraint satisfaction problems (CSP) examples Backtracking search for CSPs Problem structure and problem decomposition Local search for
More informationA Lagrangian heuristic for a real-life integrated planning problem of railway transportation resources
Author manuscript, published in "5th International Seminar on Railway Operations Modelling and Analysis - RailCopenhagen, Copenhagen : Denmark (2013)" A Lagrangian heuristic for a real-life integrated
More information11.1 Facility Location
CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local
More informationAn Introduction to Dual Ascent Heuristics
An Introduction to Dual Ascent Heuristics Introduction A substantial proportion of Combinatorial Optimisation Problems (COPs) are essentially pure or mixed integer linear programming. COPs are in general
More informationAccelerating Column Generation for a Survivable Network Design Problem
Accelerating Column Generation for a Survivable Network Design Problem Markus Leitner, Günther R. Raidl Ulrich Pferschy Department of Telematics and Network Engineering, Carinthia University of Applied
More informationPrimal Heuristics for Branch-and-Price Algorithms
Primal Heuristics for Branch-and-Price Algorithms Marco Lübbecke and Christian Puchert Abstract In this paper, we present several primal heuristics which we implemented in the branch-and-price solver GCG
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved.
More informationLecture 6: Constraint Satisfaction Problems (CSPs)
Lecture 6: Constraint Satisfaction Problems (CSPs) CS 580 (001) - Spring 2018 Amarda Shehu Department of Computer Science George Mason University, Fairfax, VA, USA February 28, 2018 Amarda Shehu (580)
More informationInstituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd. da Granja. CEP São José dos Campos S.P.
XXXIV THE MINIMIZATION OF TOOL SWITCHES PROBLEM AS A NETWORK FLOW PROBLEM WITH SIDE CONSTRAINTS Horacio Hideki Yanasse Instituto Nacional de Pesquisas Espaciais - INPE/LAC Av. dos Astronautas, 1758 Jd.
More informationImplementing Constraint Handlers in SCIP
Implementing Constraint Handlers in SCIP Gregor Hendel Ambros Gleixner, Felipe Serrano September 30 Outline Why use constraints? Motivation Callback: Default Constraint Handlers of SCIP Implementation
More informationSolving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh Nanyang Technological University Bruce Golden University of Maryland Edward Wasil American University
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity
MVE165/MMG631 Linear and integer optimization with applications Lecture 7 Discrete optimization models and applications; complexity Ann-Brith Strömberg 2019 04 09 Lecture 7 Linear and integer optimization
More informationGC-HDCN: A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks
IEEE International Conference on Ad hoc and Sensor Systems 19-22 October 2015, Dallas, USA GC-HDCN: A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks Boutheina Dab Ilhem Fajjari,
More informationDM515 Spring 2011 Weekly Note 7
Institut for Matematik og Datalogi Syddansk Universitet May 18, 2011 JBJ DM515 Spring 2011 Weekly Note 7 Stuff covered in Week 20: MG sections 8.2-8,3 Overview of the course Hints for the exam Note that
More information