Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
|
|
- Douglas Fitzgerald
- 5 years ago
- Views:
Transcription
1 Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows Guy Desaulniers École Polytechnique de Montréal and GERAD Column Generation 2008 Aussois, France
2 Outline Introduction 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
3 Outline Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
4 Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Vehicle Routing Problem with Time Windows (VRPTW) Given unlimited number of identical vehicles with a given capacity, housed in a single depot set of customers with known demands a time window for each customer Find vehicle routes such that all customer demands are met each customer is visited by a single vehicle each route starts and ends at the depot each route satisfies vehicle capacity and time windows total distance is minimized
5 Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Vehicle Routing Problem with Time Windows (VRPTW) Given unlimited number of identical vehicles with a given capacity, housed in a single depot set of customers with known demands a time window for each customer Find vehicle routes such that all customer demands are met each customer is visited by a single vehicle each route starts and ends at the depot each route satisfies vehicle capacity and time windows total distance is minimized
6 The Split Delivery VRPTW (SDVRPTW) Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Same as the VRPTW except several vehicles can visit each customer demand can be split (split deliveries) demand can be greater than vehicle capacity SDVRP was introduced by Dror and Trudeau (1989, 1990) SDVRPTW was studied first by Frizzell and Giffin (1995)
7 Literature on the SDVRP Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Not well-studied problem Close to 10 heuristics (2 based on branch-and-price) A few exact methods Branch-and-cut method by Dror et al. (1994) Cutting plane method by Belenguer et al. (2000) Dynamic programming method by Lee et al. (2006) Iterative two-stage method by Jin et al. (2007)
8 Literature on the SDVRPTW Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Very few papers Construction and improvement heuristics by Frizzell and Giffin (1995) and Mullaseril et al. (1997) One exact branch-and-price method by Gendreau et al. (2006)
9 Branch-and-price Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Leading methodology for the VRPTW Each column in the master problem corresponds to a feasible route Subproblem is an elementary shortest path problem with resource constraints
10 Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Main difficulty with branch-and-price for SDVRPTW Delivered quantities are decision variables Branch-and-price heuristics of Sierksma and Tijssen (1998) and Jin et al. (2008) For a given route, determining the delivered quantities in the subproblem is the linear relaxation of a bounded knapsack problem Maximum of one split customer per route All other customers receive a full delivery Integrality requirements on the master problem dynamic columns (not valid for an exact method)
11 Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Main difficulty with branch-and-price for SDVRPTW Delivered quantities are decision variables Branch-and-price heuristics of Sierksma and Tijssen (1998) and Jin et al. (2008) For a given route, determining the delivered quantities in the subproblem is the linear relaxation of a bounded knapsack problem Maximum of one split customer per route All other customers receive a full delivery Integrality requirements on the master problem dynamic columns (not valid for an exact method)
12 Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW Main difficulty with branch-and-price for SDVRPTW Exact branch-and-price method of Gendreau et al. (2006) Subproblem generates only routes Quantities are decided in the master problem Exponential numbers of quantity variables and constraints in the master problem (depend on number of generated routes)
13 Our contribution Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW New branch-and-price method Subproblem is an elementary shortest path problem with resource constraints, combined with the linear relaxation of a bounded knapsack problem Maximum of one split customer per route Other customers receive a zero or a full delivery Integrality requirements not on the master problem dynamic columns Convex combinations of these columns can yield routes with multiple split deliveries Specialized dynamic programming algorithm for the subproblem
14 Our contribution Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW New branch-and-price method Subproblem is an elementary shortest path problem with resource constraints, combined with the linear relaxation of a bounded knapsack problem Maximum of one split customer per route Other customers receive a zero or a full delivery Integrality requirements not on the master problem dynamic columns Convex combinations of these columns can yield routes with multiple split deliveries Specialized dynamic programming algorithm for the subproblem
15 Our contribution Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW New branch-and-price method Subproblem is an elementary shortest path problem with resource constraints, combined with the linear relaxation of a bounded knapsack problem Maximum of one split customer per route Other customers receive a zero or a full delivery Integrality requirements not on the master problem dynamic columns Convex combinations of these columns can yield routes with multiple split deliveries Specialized dynamic programming algorithm for the subproblem
16 Our contribution Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW New branch-and-price method Subproblem is an elementary shortest path problem with resource constraints, combined with the linear relaxation of a bounded knapsack problem Maximum of one split customer per route Other customers receive a zero or a full delivery Integrality requirements not on the master problem dynamic columns Convex combinations of these columns can yield routes with multiple split deliveries Specialized dynamic programming algorithm for the subproblem
17 Outline Introduction Master problem Subproblem 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
18 Integer master problem Master problem Subproblem subject to : Minimize c r θ rw r R w W r δ iw θ rw d i, r R w W r a ir θ rw ki C, r R w W r θ rw = H, w W r r R\{0} i N i N H [ k C (N), F ], integer,
19 Integer master problem (cont d) Master problem Subproblem θ rw 0, x ijr θ rw = y ij, r R w W r b ijlr θ rw = z ijl, r R w W r y ij binary, y ij integer, r R,w W r (i,j) A (i,j,l) B (i,j) A(N) (i,j) A \ A(N) z ijl binary, (i,j,l) B.
20 Master problem Subproblem A small example with n = 3 customers and Q = 4 d 1 = 5 [20,25] 1 (20,20) (20,22) (2,4) [0,60] [0,60] [25,30] (20,20) (20,22) d 2 = 2 (2,4) (20,20) (20,22) 3 [30,35] d = 5 3 Optimal solution is (delivered quantities in parenthesis) 0-1(4)-4 with a flow of 1, 0-3(4)-4 with a flow of 1 0-1(2)-2(2)-3(0)-4 with a flow of (0)-2(2)-3(2)-4 with a flow of 0.5
21 Subproblem Introduction Master problem Subproblem Minimize ( ) cij α i ν ij xij π i δ i β µ ijl ζ ijl (i,j) A i N (i,j,l) B subject to : x ij x 0,i = 1, i N j V + (i) j V (i) x ji = 0, x ij (s i + t ij s j ) 0, e i s i l i, i N (i,j) A i V
22 Subproblem (cont d) Master problem Subproblem δ i Q, i N 0 δ i d i j V + (i) x ij, x ij {0,1}, i N (i,j) A x ij + x jl ζ ijl + 1 x ij + x jl 2 + 1, (i,j,l) B ζ ijl {0,1}, (i,j,l) B. Assuming no ζ variables, the subproblem is an elementary shortest path problem with time windows and vehicle capacity, combined with the linear relaxation of a bounded knapsack problem
23 Outline Introduction Column generation Cutting and branching 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
24 Branch-and-price-and-cut Column generation Cutting and branching Column generation used to compute lower bounds Cutting planes added to strengthen linear relaxations Branching used to derive integer solutions
25 Column generation Introduction Column generation Cutting and branching Standard column generation Label-setting algorithm for solving the subproblem Accelerating strategies
26 Label-setting algorithm Column generation Cutting and branching For the VRPTW Label E C : reduced cost S : time L : total quantity delivered V i : customer i reachable or not Extension functions : e.g., S j = max{e j,s i + t ij } Dominance : E 1 dominates E 2 if C 1 C 2 S 1 S 2 L 1 L 2 V i 1 V i 2, i N
27 Label-setting algorithm Column generation Cutting and branching Not applicable because delivered quantities are decision variables reduced cost and load resource are functions of these quantities New algorithm for the SDVRPTW When extending a label along an arc, up to three labels can be created : zero, split, and full deliveries New binary resource to limit the number of split deliveries Reduced cost is a linear function of the total quantity delivered Dominance procedure must compare such functions
28 Label-setting algorithm Column generation Cutting and branching Not applicable because delivered quantities are decision variables reduced cost and load resource are functions of these quantities New algorithm for the SDVRPTW When extending a label along an arc, up to three labels can be created : zero, split, and full deliveries New binary resource to limit the number of split deliveries Reduced cost is a linear function of the total quantity delivered Dominance procedure must compare such functions
29 Label-setting algorithm (cont d) Column generation Cutting and branching Label E C : reduced cost excluding cost of split delivery (if any) S : time L : total quantity delivered in full deliveries V i : customer i reachable or not P : split delivery done or not : maximum quantity that can be delivered in the split delivery (if any) Π : unit dual price for the split delivery (if any) Adapted extension functions
30 Label-setting algorithm (cont d) Column generation Cutting and branching Label E C : reduced cost excluding cost of split delivery (if any) S : time L : total quantity delivered in full deliveries V i : customer i reachable or not P : split delivery done or not : maximum quantity that can be delivered in the split delivery (if any) Π : unit dual price for the split delivery (if any) Adapted extension functions
31 Label-setting algorithm (cont d) Column generation Cutting and branching E 1 dominates E 2 if E 1 and E 2 are associated with the same node all feasible extensions of E 2 are also feasible for E 1 cost of every feasible extension of E 2 is greater than or equal to the cost of a similar extension of E 1
32 Label-setting algorithm (cont d) Column generation Cutting and branching Cost of a label E = (C,S,L,V i,p,,π) is Z(G) = C Π(G L) for G [L,L + ] Z E 2 E 1 E 3 E 1 can dominate E 2, but not the other labels E 5 E 4 G
33 Label-setting algorithm (cont d) Column generation Cutting and branching E 1 can dominate E 2 if S 1 S 2 L 1 L 2 V i 1 V i 2, i N P 1 P 2 C 1 1 Π 1 C 2 2 Π 2 C 1 (L 2 L 1 )Π 1 C 2 C 1 (L L 1 )Π 1 C 2 2 Π 2
34 Accelerating strategies Column generation Cutting and branching 1 Initial columns : dedicated trips 0 i n If π j = 0, then only zero deliveries at j 3 Bounded bidirectional search and decremental search space (Righini and Salani, 2006, 2007, Boland et al., 2006) 4 Heuristic column generator (omit V1 i V 2 i, i N, in the dominance rule)
35 Accelerating strategies Column generation Cutting and branching 1 Initial columns : dedicated trips 0 i n If π j = 0, then only zero deliveries at j 3 Bounded bidirectional search and decremental search space (Righini and Salani, 2006, 2007, Boland et al., 2006) 4 Heuristic column generator (omit V1 i V 2 i, i N, in the dominance rule)
36 Accelerating strategies Column generation Cutting and branching 1 Initial columns : dedicated trips 0 i n If π j = 0, then only zero deliveries at j 3 Bounded bidirectional search and decremental search space (Righini and Salani, 2006, 2007, Boland et al., 2006) 4 Heuristic column generator (omit V1 i V 2 i, i N, in the dominance rule)
37 Accelerating strategies Column generation Cutting and branching 1 Initial columns : dedicated trips 0 i n If π j = 0, then only zero deliveries at j 3 Bounded bidirectional search and decremental search space (Righini and Salani, 2006, 2007, Boland et al., 2006) 4 Heuristic column generator (omit V1 i V 2 i, i N, in the dominance rule)
38 Cutting Introduction Column generation Cutting and branching k-path inequalities (Kohl et al., 1999) k U = max{ku C, kt U }, where ku C = P d i : minimum according to vehicle capacity Q i U k T U : minimum according to time windows (1 or 2) Arc-flow inequalities (Gendreau et al, 2006) Maximum flow of 1 on arcs (i, j) and (j, i) for i, j N
39 Cutting Introduction Column generation Cutting and branching k-path inequalities (Kohl et al., 1999) k U = max{ku C, kt U }, where ku C = P d i : minimum according to vehicle capacity Q i U k T U : minimum according to time windows (1 or 2) Arc-flow inequalities (Gendreau et al, 2006) Maximum flow of 1 on arcs (i, j) and (j, i) for i, j N
40 Branching Introduction Column generation Cutting and branching In order of priority, we branch on number of vehicles used (H) number of vehicles visiting a customer ( j y ij ) add y ij and corresponding constraint in the master problem number of vehicles on an arc (y ij ) add y ij and corresponding constraint in the master problem number of vehicles on two consecutive arcs (z ijl ) add z ijl and corresponding constraint in the master problem modify the subproblem algorithm
41 Outline Introduction 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
42 Instances Introduction Modified VRPTW instances of Solomon (1987) Allow split deliveries Solomon : 56 instances with 100 customers (6 classes) 2 56 other instances taking the first 25 and 50 customers Q = 30,50,100 Total of 504 instances Same instances as in Gendreau et al. (2006) Maximum CPU time = 1 hour, 2.8GHz PC
43 Linear relaxation results Computational time increases with number of customers decreases with capacity Q Slower increase than with the method of Gendreau et al. (2006) who used a 1.6GHz PC Example (C1 instances with Q = 30) Gendreau et al. : 0.3, 8, 304 seconds for n = 25,50,100 Our method : 0.4, 3, 17 seconds for n = 25,50,100
44 Integer solution results Nb numbers gap (%) numbers times (s) n class Q inst solved veh splits lp lp+cuts cuts nodes lp cuts total 25 R < C < < RC < <1 < < < R C <1 < < RC < < < <1 19 Maximum CPU time = 1 hour, 2.8GHz PC
45 Integer solution results (cont d) Nb numbers gap (%) numbers times (s) n class Q inst solved veh splits lp lp+cuts cuts nodes lp cuts total 50 R < RC < < < R C RC < < < R < Maximum CPU time = 1 hour, 2.8GHz PC
46 Integer solution results (cont d) Remarks Gap decreases with capacity Q (need split deliveries) Cycling increases with capacity Q Large gaps for C1 and C2 instances k-path inequalities are useful Arc-flow inequalities are not useful Gendreau et al. (2006) solved 27 instances We solved 175 instances (1.6GHz PC) (2.8GHz PC)
47 Outline Introduction 1 Introduction Problem definition Literature review Main difficulty with branch-and-price for SDVRPTW 2 Master problem Subproblem 3 Column generation Cutting and branching 4 5
48 In this paper Novel decomposition New subproblem type New label-setting algorithm Relatively good results We can do better Accelerating strategies for solving the subproblem Heuristics for solving the subproblem Other valid inequalities to reduce gaps
Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows
Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows Matteo Salani Ilaria Vacca December 24, 2009 Report TRANSP-OR 091224 Transport and Mobility Laboratory Ecole
More informationAn Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem
An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem Claudia Archetti (1) Martin W.P. Savelsbergh (2) M. Grazia Speranza (1) (1) University of Brescia, Department of Quantitative
More informationPartial Path Column Generation for the Vehicle Routing Problem with Time Windows
Partial Path Column Generation for the Vehicle Routing Problem with Time Windows Bjørn Petersen & Mads Kehlet Jepsen } DIKU Department of Computer Science, University of Copenhagen Universitetsparken 1,
More informationInteger linear programming models for a cement delivery problem
Integer linear programming models for a cement delivery problem Alain Hertz Département de mathématiques et de génie industriel École Polytechnique de Montréal alain.hertz@gerad.ca Marc Uldry and Marino
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective Vehicle routing problem 1 / 33 Cutting stock
More informationA generalized formulation for vehicle routing problems
Working paper A generalized formulation for vehicle routing problems Pedro Munari a, Twan Dollevoet b, Remy Spliet b a Production Engineering Department, Federal University of São Carlos, Brazil b Econometric
More informationBranch-and-Price algorithm for Vehicle Routing Problem: tutorial
Branch-and-Price algorithm for Vehicle Routing Problem: tutorial Kyuree AHN Department of Industrial and Systems Engineering KAIST, Republic of Korea Friday, May 17, 2017 Presentation Overview Problem
More informationPartial Path Column Generation for the Elementary Shortest Path Problem with Resource Constraints
Partial Path Column Generation for the Elementary Shortest Path Problem with Resource Constraints Mads Kehlet Jepsen & Bjørn Petersen Department of Computer Science, University of Copenhagen Universitetsparken
More informationPartial Path Column Generation for the Vehicle Routing Problem
Partial Path Column Generation for the Vehicle Routing Problem Report 12.2009 DTU Management Engineering Mads Kehlet Jepsen Bjørn Petersen November 2009 Partial Path Column Generation for the Vehicle Routing
More informationColumn Generation. i = 1,, 255;
Column Generation The idea of the column generation can be motivated by the trim-loss problem: We receive an order to cut 50 pieces of.5-meter (pipe) segments, 250 pieces of 2-meter segments, and 200 pieces
More informationPedro Munari - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2
Pedro Munari [munari@dep.ufscar.br] - COA 2017, February 10th, University of Edinburgh, Scotland, UK 2 Outline Vehicle routing problem; How interior point methods can help; Interior point branch-price-and-cut:
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making (discrete optimization) problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock,
More informationColumn Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
Author manuscript, published in "ATMOS - 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - 2013 33 (2013) 137--149" DOI : 10.4230/OASIcs.ATMOS.2013.137 Column
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock, crew scheduling, vehicle
More informationCut-First Branch-and-Price-Second for the CARP Workshop on Large Scale Optimization 2012 Vevey, Switzerland
Cut-First Branch-and-Price-Second for the CARP Workshop on Large Scale Optimization 2012 Vevey, Switzerland Claudia Bode and Stefan Irnich {claudia.bode,irnich}@uni-mainz.de Chair for Logistics Management
More informationLarge-scale optimization and decomposition methods: outline. Column Generation and Cutting Plane methods: a unified view
Large-scale optimization and decomposition methods: outline I Solution approaches for large-scaled problems: I Delayed column generation I Cutting plane methods (delayed constraint generation) 7 I Problems
More informationDecomposition Methods for Integer Programming
Decomposition Methods for Integer Programming J.M. Valério de Carvalho vc@dps.uminho.pt Departamento de Produção e Sistemas Escola de Engenharia, Universidade do Minho Portugal PhD Course Programa Doutoral
More informationA Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem. Ryutsu Keizai University Naoto KATAYAMA
A Capacity Scaling Procedure for the Multi-Commodity Capacitated Network Design Problem Ryutsu Keizai University Naoto KATAYAMA Problems 2006 1 Multi-Commodity Network Design Problem The basic model for
More informationA Column Generation Based Heuristic for the Dial-A-Ride Problem
A Column Generation Based Heuristic for the Dial-A-Ride Problem Nastaran Rahmani 1, Boris Detienne 2,3, Ruslan Sadykov 3,2, François Vanderbeck 2,3 1 Kedge Business School, 680 Cours de la Libération,
More informationNotes on Dantzig-Wolfe decomposition and column generation
Notes on Dantzig-Wolfe decomposition and column generation Mette Gamst November 11, 2010 1 Introduction This note introduces an exact solution method for mathematical programming problems. The method is
More informationPart 4. Decomposition Algorithms
In the name of God Part 4. 4.4. Column Generation for the Constrained Shortest Path Problem Spring 2010 Instructor: Dr. Masoud Yaghini Constrained Shortest Path Problem Constrained Shortest Path Problem
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 informationBranch-and-cut (and-price) for the chance constrained vehicle routing problem
Branch-and-cut (and-price) for the chance constrained vehicle routing problem Ricardo Fukasawa Department of Combinatorics & Optimization University of Waterloo May 25th, 2016 ColGen 2016 joint work with
More informationIGERT Experience In SwitzerlandLogistics at Galenica Pharmaceutical p.1
IGERT Experience In Switzerland Logistics at Galenica Pharmaceutical Matthew V Galati Gérard Hêche Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA September 27, 2002
More informationLecture 9: Dantzig-Wolfe Decomposition
Lecture 9: Dantzig-Wolfe Decomposition (3 units) Outline Dantzig-Wolfe decomposition Column generation algorithm Relation to Lagrangian dual Branch-and-price method Generated assignment problem and multi-commodity
More informationClassification of Dantzig-Wolfe Reformulations for MIP s
Classification of Dantzig-Wolfe Reformulations for MIP s Raf Jans Rotterdam School of Management HEC Montreal Workshop on Column Generation Aussois, June 2008 Outline and Motivation Dantzig-Wolfe reformulation
More informationThe Fixed Charge Transportation Problem: A Strong Formulation Based On Lagrangian Decomposition and Column Generation
The Fixed Charge Transportation Problem: A Strong Formulation Based On Lagrangian Decomposition and Column Generation Yixin Zhao, Torbjörn Larsson and Department of Mathematics, Linköping University, Sweden
More informationNetwork Flows. 6. Lagrangian Relaxation. Programming. Fall 2010 Instructor: Dr. Masoud Yaghini
In the name of God Network Flows 6. Lagrangian Relaxation 6.3 Lagrangian Relaxation and Integer Programming Fall 2010 Instructor: Dr. Masoud Yaghini Integer Programming Outline Branch-and-Bound Technique
More informationOutline. Relaxation. Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING. 1. Lagrangian Relaxation. Lecture 12 Single Machine Models, Column Generation
Outline DMP204 SCHEDULING, TIMETABLING AND ROUTING 1. Lagrangian Relaxation Lecture 12 Single Machine Models, Column Generation 2. Dantzig-Wolfe Decomposition Dantzig-Wolfe Decomposition Delayed Column
More informationA Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price
A Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price Gleb Belov University of Dresden Adam N. Letchford Lancaster University Eduardo Uchoa Universidade Federal Fluminense August 4, 2011
More informationBranch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicle Routing Problems
Downloaded from orbit.dtu.dk on: Oct 31, 2018 Branch-and-cut and Branch-and-Cut-and-Price Algorithms for Solving Vehicle Routing Problems Jepsen, Mads Kehlet; Pisinger, David Publication date: 2011 Document
More informationImproved BCP for Capacitated Vehicle Routing
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing Diego Pecin Artur Pessoa Marcus Poggi Eduardo Uchoa PUC - Rio de Janeiro Universidade Federal Fluminense January, 0 Aussois-0 Pecin, Pessoa,
More informationStronger Multi-Commodity Flow Formulations of the Capacitated Vehicle Routing Problem
Stronger Multi-Commodity Flow Formulations of the Capacitated Vehicle Routing Problem Adam N. Letchford Juan-José Salazar-González June 2014 Abstract The Capacitated Vehicle Routing Problem is a much-studied
More informationExtended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications
Extended Formulations, Lagrangian Relaxation, & Column Generation: tackling large scale applications François Vanderbeck University of Bordeaux INRIA Bordeaux-Sud-Ouest part : Defining Extended Formulations
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 informationAn Exact Algorithm for the Traveling Salesman Problem with Deliveries and Collections
An Exact Algorithm for the Traveling Salesman Problem with Deliveries and Collections R. Baldacci DISMI, University of Modena and Reggio E., V.le Allegri 15, 42100 Reggio E., Italy E. Hadjiconstantinou
More informationIntroduction to Integer Programming
Lecture 3/3/2006 p. /27 Introduction to Integer Programming Leo Liberti LIX, École Polytechnique liberti@lix.polytechnique.fr Lecture 3/3/2006 p. 2/27 Contents IP formulations and examples Total unimodularity
More information1 Column Generation and the Cutting Stock Problem
1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when
More informationSolving Elementary Shortest-Path Problems as Mixed-Integer Programs
Gutenberg School of Management and Economics Discussion Paper Series Solving Elementary Shortest-Path Problems as Mixed-Integer Programs Michael Drexl and Stefan Irnich Januar 2012 Discussion paper number
More informationBenders Decomposition for the Uncapacitated Multicommodity Network Design Problem
Benders Decomposition for the Uncapacitated Multicommodity Network Design Problem 1 Carlos Armando Zetina, 1 Ivan Contreras, 2 Jean-François Cordeau 1 Concordia University and CIRRELT, Montréal, Canada
More informationInteger Programming ISE 418. Lecture 16. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 16 Dr. Ted Ralphs ISE 418 Lecture 16 1 Reading for This Lecture Wolsey, Chapters 10 and 11 Nemhauser and Wolsey Sections II.3.1, II.3.6, II.3.7, II.5.4 CCZ Chapter 8
More informationVehicle Routing and MIP
CORE, Université Catholique de Louvain 5th Porto Meeting on Mathematics for Industry, 11th April 2014 Contents: The Capacitated Vehicle Routing Problem Subproblems: Trees and the TSP CVRP Cutting Planes
More informationBranch-and-Price for Routing with Probabilistic Customers
Branch-and-Price for Routing with Probabilistic Customers Felipe Lagos 1, Mathias A. Klapp 2, Alejandro Toriello 1 1 H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
More informationJohannes Gutenberg University Mainz Gutenberg School of Management and Economics Jakob-Welder-Weg Mainz Germany wiwi.uni-mainz.
Gutenberg School of Management and Economics & Research Unit Interdisciplinary Public Policy Discussion Paper Series Branch-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node
More informationVehicle Scheduling for Accessible. Transportation Systems
Beauchamp 1 2 Furkan Enderer 3 Mounira Groiez 1 Nadia Lahrichi 1 Mehdi Mahnam 1 Odile Marcotte 4 Sofiane Soualah 5 6 1 École Polytechnique 2 UQAM 3 Concordia University 4 CRM and UQAM 5 Université de Montréal
More informationOn the exact solution of a large class of parallel machine scheduling problems
1 / 23 On the exact solution of a large class of parallel machine scheduling problems Teobaldo Bulhões 2 Ruslan Sadykov 1 Eduardo Uchoa 2 Anand Subramanian 3 1 Inria Bordeaux and Univ. Bordeaux, France
More informationA computational study of enhancements to Benders Decomposition in uncapacitated multicommodity network design
A computational study of enhancements to Benders Decomposition in uncapacitated multicommodity network design 1 Carlos Armando Zetina, 1 Ivan Contreras, 2 Jean-François Cordeau 1 Concordia University and
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 informationInteger Linear Programming Modeling
DM554/DM545 Linear and Lecture 9 Integer Linear Programming Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. Assignment Problem Knapsack Problem
More informationExact Solution of the Soft-Clustered Vehicle-Routing Problem
Exact Solution of the Soft-Clustered Vehicle-Routing Problem Timo Hintsch,a, Stefan Irnich a a Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University
More informationLecture 8 Network Optimization Algorithms
Advanced Algorithms Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2013-2014 Lecture 8 Network Optimization Algorithms 1 21/01/14 Introduction Network models have
More informationA maritime version of the Travelling Salesman Problem
A maritime version of the Travelling Salesman Problem Enrico Malaguti, Silvano Martello, Alberto Santini May 31, 2015 Plan 1 The Capacitated TSP with Pickup and Delivery 2 The TSPPD with Draught Limits
More informationInteger programming: an introduction. Alessandro Astolfi
Integer programming: an introduction Alessandro Astolfi Outline Introduction Examples Methods for solving ILP Optimization on graphs LP problems with integer solutions Summary Introduction Integer programming
More informationLogic, Optimization and Data Analytics
Logic, Optimization and Data Analytics John Hooker Carnegie Mellon University United Technologies Research Center, Cork, Ireland August 2015 Thesis Logic and optimization have an underlying unity. Ideas
More informationStabilized Branch-and-cut-and-price for the Generalized Assignment Problem
Stabilized Branch-and-cut-and-price for the Generalized Assignment Problem Alexandre Pigatti, Marcus Poggi de Aragão Departamento de Informática, PUC do Rio de Janeiro {apigatti, poggi}@inf.puc-rio.br
More informationA Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits
1 / 47 A Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits Martin Romauch 1 Richard Hartl 1 Thibaut Vidal 2 1 University of Vienna 2 PUC-Rio, Rio de Janeiro,
More informationEXERCISES SHORTEST PATHS: APPLICATIONS, OPTIMIZATION, VARIATIONS, AND SOLVING THE CONSTRAINED SHORTEST PATH PROBLEM. 1 Applications and Modelling
SHORTEST PATHS: APPLICATIONS, OPTIMIZATION, VARIATIONS, AND SOLVING THE CONSTRAINED SHORTEST PATH PROBLEM EXERCISES Prepared by Natashia Boland 1 and Irina Dumitrescu 2 1 Applications and Modelling 1.1
More informationAn Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory
An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory by Troels Martin Range Discussion Papers on Business and Economics No. 10/2006 FURTHER INFORMATION Department of Business
More informationLagrangian Relaxation in MIP
Lagrangian Relaxation in MIP Bernard Gendron May 28, 2016 Master Class on Decomposition, CPAIOR2016, Banff, Canada CIRRELT and Département d informatique et de recherche opérationnelle, Université de Montréal,
More informationAccelerating Benders Decomposition by Local Branching
Accelerating Benders Decomposition by Local Branching Walter Rei, Michel Gendreau Département d informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université demontréal,
More informationLecture 8: Column Generation
Lecture 8: Column Generation (3 units) Outline Cutting stock problem Classical IP formulation Set covering formulation Column generation A dual perspective 1 / 24 Cutting stock problem 2 / 24 Problem description
More informationComputational Integer Programming. Lecture 2: Modeling and Formulation. Dr. Ted Ralphs
Computational Integer Programming Lecture 2: Modeling and Formulation Dr. Ted Ralphs Computational MILP Lecture 2 1 Reading for This Lecture N&W Sections I.1.1-I.1.6 Wolsey Chapter 1 CCZ Chapter 2 Computational
More information0-1 Reformulations of the Network Loading Problem
0-1 Reformulations of the Network Loading Problem Antonio Frangioni 1 frangio@di.unipi.it Bernard Gendron 2 bernard@crt.umontreal.ca 1 Dipartimento di Informatica Università di Pisa Via Buonarroti, 2 56127
More informationInteger program reformulation for robust branch-and-cut-and-price
Integer program reformulation for robust branch-and-cut-and-price Marcus Poggi de Aragão Informática PUC-Rio Eduardo Uchoa Engenharia de Produção Universidade Federal Fluminense Outline of the talk Robust
More informationOperations Research Lecture 6: Integer Programming
Operations Research Lecture 6: Integer Programming Notes taken by Kaiquan Xu@Business School, Nanjing University May 12th 2016 1 Integer programming (IP) formulations The integer programming (IP) is the
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationDiscrete (and Continuous) Optimization WI4 131
Discrete (and Continuous) Optimization WI4 131 Kees Roos Technische Universiteit Delft Faculteit Electrotechniek, Wiskunde en Informatica Afdeling Informatie, Systemen en Algoritmiek e-mail: C.Roos@ewi.tudelft.nl
More informationDesigning Survivable Networks: A Flow Based Approach
Designing Survivable Networks: A Flow Based Approach Prakash Mirchandani 1 University of Pittsburgh This is joint work with Anant Balakrishnan 2 of the University of Texas at Austin and Hari Natarajan
More informationBranch-and-Price for a Multi-Attribute Technician Routing and Scheduling Problem
Branch-and-Price for a Multi-Attribute Technician Routing and Scheduling Problem Ines Mathlouthi Michel Gendreau Jean-Yves Potvin August 2017 Branch-and-Price for a Multi-Attribute Technician Routing and
More informationWeighted Acyclic Di-Graph Partitioning by Balanced Disjoint Paths
Weighted Acyclic Di-Graph Partitioning by Balanced Disjoint Paths H. Murat AFSAR Olivier BRIANT Murat.Afsar@g-scop.inpg.fr Olivier.Briant@g-scop.inpg.fr G-SCOP Laboratory Grenoble Institute of Technology
More informationThe Separation Problem for Binary Decision Diagrams
The Separation Problem for Binary Decision Diagrams J. N. Hooker Joint work with André Ciré Carnegie Mellon University ISAIM 2014 Separation Problem in Optimization Given a relaxation of an optimization
More informationA Lagrangian relaxation method for solving choice-based mixed linear optimization models that integrate supply and demand interactions
A Lagrangian relaxation method for solving choice-based mixed linear optimization models that integrate supply and demand interactions Meritxell Pacheco Shadi Sharif Azadeh, Michel Bierlaire, Bernard Gendron
More informationVehicle Routing with Traffic Congestion and Drivers Driving and Working Rules
Vehicle Routing with Traffic Congestion and Drivers Driving and Working Rules A.L. Kok, E.W. Hans, J.M.J. Schutten, W.H.M. Zijm Operational Methods for Production and Logistics, University of Twente, P.O.
More informationLinear and Integer Programming - ideas
Linear and Integer Programming - ideas Paweł Zieliński Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland http://www.im.pwr.wroc.pl/ pziel/ Toulouse, France 2012 Literature
More informationColumn Generation. ORLAB - Operations Research Laboratory. Stefano Gualandi. June 14, Politecnico di Milano, Italy
ORLAB - Operations Research Laboratory Politecnico di Milano, Italy June 14, 2011 Cutting Stock Problem (from wikipedia) Imagine that you work in a paper mill and you have a number of rolls of paper of
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 information3.7 Strong valid inequalities for structured ILP problems
3.7 Strong valid inequalities for structured ILP problems By studying the problem structure, we can derive strong valid inequalities yielding better approximations of conv(x ) and hence tighter bounds.
More informationStochastic Vehicle Routing: an Application of Stochastic Optimization Models
Stochastic Vehicle Routing: an Application of Stochastic Optimization Models Michel Gendreau CIRRELT and MAGI École Polytechnique de Montréal Summer School on Dynamic Discrete Choice Models: Econometric
More informationSection Notes 9. Midterm 2 Review. Applied Math / Engineering Sciences 121. Week of December 3, 2018
Section Notes 9 Midterm 2 Review Applied Math / Engineering Sciences 121 Week of December 3, 2018 The following list of topics is an overview of the material that was covered in the lectures and sections
More informationThe Shortest-Path Problem with Resource Constraints with (k; 2)-Loop Elimination and Its Application to the Capacitated Arc-Routing Problem
Gutenberg School of Management and Economics Discussion Paper Series The Shortest-Path Problem with Resource Constraints with (k; 2-Loop Elimination and Its Application to the Capacitated Arc-Routing Problem
More informationScenario Grouping and Decomposition Algorithms for Chance-constrained Programs
Scenario Grouping and Decomposition Algorithms for Chance-constrained Programs Siqian Shen Dept. of Industrial and Operations Engineering University of Michigan Joint work with Yan Deng (UMich, Google)
More informationWorld Academy of Science, Engineering and Technology International Journal of Computer and Information Engineering Vol:5, No:4, 2011
A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times Jinghao Sun, Guozhen Tan, and Guangjian Hou Abstract The Chinese Postman Problem (CPP) is one of the
More informationExact and Heuristic Algorithms for the Symmetric and Asymmetric Vehicle Routing Problem with Backhauls
Exact and Heuristic Algorithms for the Symmetric and Asymmetric Vehicle Routing Problem with Backhauls Paolo Toth, Daniele Vigo ECCO IX - Dublin 1996 Exact and Heuristic Algorithms for VRPB 1 Vehicle Routing
More informationA Joint Routing and Speed Optimization Problem
A Joint Routing and Speed Optimization Problem Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song March 5, 2017 Abstract Fuel cost contributes to a significant portion of operating cost in cargo transportation.
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 information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationThe fire and rescue vehicle location problem
The fire and rescue vehicle location problem Henrik Andersson Norwegian University of Science and Technology Tobias Andersson Granberg Linköping University Introduction The Swedish Civil Contingencies
More informationDecomposition-based Methods for Large-scale Discrete Optimization p.1
Decomposition-based Methods for Large-scale Discrete Optimization Matthew V Galati Ted K Ralphs Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA, USA Départment de Mathématiques
More informationFeasibility Pump Heuristics for Column Generation Approaches
1 / 29 Feasibility Pump Heuristics for Column Generation Approaches Ruslan Sadykov 2 Pierre Pesneau 1,2 Francois Vanderbeck 1,2 1 University Bordeaux I 2 INRIA Bordeaux Sud-Ouest SEA 2012 Bordeaux, France,
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 informationProgressive Hedging-Based Meta- Heuristics for Stochastic Network Design
Progressive Hedging-Based Meta- Heuristics for Stochastic Network Design Teodor Gabriel Crainic Xiaorui Fu Michel Gendreau Walter Rei Stein W. Wallace January 2009 1. 2. 3. 4. 5. Progressive Hedging-Based
More informationIntuitionistic Fuzzy Estimation of the Ant Methodology
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,
More informationDisconnecting Networks via Node Deletions
1 / 27 Disconnecting Networks via Node Deletions Exact Interdiction Models and Algorithms Siqian Shen 1 J. Cole Smith 2 R. Goli 2 1 IOE, University of Michigan 2 ISE, University of Florida 2012 INFORMS
More informationIntroduction to Integer Linear Programming
Lecture 7/12/2006 p. 1/30 Introduction to Integer Linear Programming Leo Liberti, Ruslan Sadykov LIX, École Polytechnique liberti@lix.polytechnique.fr sadykov@lix.polytechnique.fr Lecture 7/12/2006 p.
More informationOptimization Bounds from Binary Decision Diagrams
Optimization Bounds from Binary Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University ICS 203 Binary Decision Diagrams BDDs historically
More informationVehicle Routing Problems with Time Windows and Convex Node Costs
Vehicle Routing Problems with Time Windows and Convex Node Costs Qie He Yongjia Song August 30, 2016 Abstract We consider a variant of the vehicle routing problems with time windows, where the objective
More informationA column generation approach to the discrete lot sizing and scheduling problem on parallel machines
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines António J.S.T. Duarte and J.M.V. Valério de Carvalho Abstract In this work, we study the discrete lot
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 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 information