A Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits
|
|
- Henry George
- 5 years ago
- Views:
Transcription
1 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, Brazil
2 Title of the talk: A Priori Route Evaluation for the Lateral Transhipment Problem (ARELTP) with Piecewise Linear Profits and a Lotsizing Application with Requalification Costs. the presentation covers: problem definition lot sizing application solution approaches (DP, B&B) computational experiments and results 2 / 47
3 ARELTP with PLWP - origin of the problem 3 / 47 origin of the problem: Single Route Lateral Transhipment Problem (SRLTP) SRLTP: redistribution of inventories using one vehicle. extension to piecewise linear profits (PWLP). ARELTP: evaluation of a-priori routes for this problem
4 ARELTP with PLWP - origin of the problem 3 / 47 origin of the problem: Single Route Lateral Transhipment Problem (SRLTP) SRLTP: redistribution of inventories using one vehicle. extension to piecewise linear profits (PWLP). ARELTP: evaluation of a-priori routes for this problem
5 ARELTP with PLWP - origin of the problem 3 / 47 origin of the problem: Single Route Lateral Transhipment Problem (SRLTP) SRLTP: redistribution of inventories using one vehicle. extension to piecewise linear profits (PWLP). ARELTP: evaluation of a-priori routes for this problem
6 ARELTP with PLWP - origin of the problem 3 / 47 origin of the problem: Single Route Lateral Transhipment Problem (SRLTP) SRLTP: redistribution of inventories using one vehicle. extension to piecewise linear profits (PWLP). ARELTP: evaluation of a-priori routes for this problem
7 lateral transhipment for a single route - SRLTP 4 / 47 initial inventory levels I i at the local warehouses
8 lateral transhipment for a single route - SRLTP 5 / 47 the PWLP function F i for different inventory levels. profit inventory level
9 lateral transhipment for a single route - SRLTP 6 / 47 changes of the inventory level y i and the PWL profit function F i
10 lateral transhipment for a single route - SRLTP 7 / 47 What is a good redistribution? 2 1 depot
11 lateral transhipment for a single route - SRLTP 8 / 47 not considered: load capacity, tour length constraint, travel costs. 2 1 depot
12 lateral transhipment for a single route - SRLTP 9 / 47 considering the load capacity constraint
13 lateral transhipment for a single route - SRLTP considering the load capacity constraint 2 1 depot / 47
14 lateral transhipment for a single route - SRLTP considering the distance constraint 2 1 depot / 47
15 ARELTP: SRLTP for an a-priori route feasible solution for the a-priori route a route that starts in 1 and returns to 7 indices of the visited customers are increasing 3 2 depot 1= / 47
16 ARELTP: SRLTP for an a-priori route feasible route: depot 1= / 47
17 A-priori route and a-priori route evaluation 14 / 47 motivation to use a-priori routes robustness (simple to implement in practice) consistency (improve the service quality) performance issues may also be a motivation to use a-priori routes. This presentation is about evaluating a single a-priori route for a single scenario (parameter setting) of the SRLTP with PLP.
18 ARELTP: formulation decision variables arc selection: x ij inventory change: y i (remove y i ) Remark: load when leaving i is j i y j parameters depots for the truck: 1, n local warehouses: 2,... n 1: revenue change: f i f i (y i ) = F i (I i y i ) F i (I i ) (a i y i b i if i is visited) costs: c ij time consumption: t ij and upper bound T max load limit: Q max 15 / 47
19 ARELTP: MIP formulation min c ij x ij f i (y i ) (1) s.t. 1 i<j n 1 i n x ji = x ij 1 < i < n (2) j<i j>i x 1j = 1 (3) j>1 x jn = 1 j<n a i x ij y i b i x ij 1 i n (5) j>i j>i 0 y j Q max j i 1 i n (6) x ij {0, 1} 1 i < j n (7) y i R 1 i n (8) t ij x ij T max (9) 1 i<j n 16 / 47 (4)
20 ARELTP: MIP formulation min c ij x ij f i (y i ) (1) s.t. 1 i<j n 1 i n x ji = x ij 1 < i < n (2) j<i j>i x 1j = 1 (3) j>1 x jn = 1 j<n a i x ij y i b i x ij 1 i n (5) j>i j>i 0 y j Q max j i 1 i n (6) x ij {0, 1} 1 i < j n (7) y i R 1 i n (8) t ij x ij T max (9) 1 i<j n 16 / 47 (4)
21 ARELTP: complexity 17 / 47 A polynomially solvable variant of the ARELTP is presented in [Hartl and Romauch(2013)]; simplifications: c ij is not considered f i is linear T max is not considered ARELTP is NP hard if one of the following is true if: c ij is considered ( linear f i and T max = ) f i is piecewise linear (c ij = 0 and T max = ) T max is considered ( linear f i and c ij = 0 )
22 lot sizing application 18 / 47 lot sizing and tool qualifications frequent use of a tool may lower the setup costs (renewals for tool qualifications). pharmaceutical, food and semiconductor industry. violates the triangle inequality (frequent use of a tool may stretch the duration of a qualification)
23 lot sizing application - example 19 / 47 find the optimal production quantities
24 lot sizing application - example 20 / 47 three solutions
25 lot sizing application - example 21 / 47 three solutions
26 lot sizing application - parameters 22 / 47 Input data periods: i {1,... n} d i : demand f i : production cost for a given quantity [a i, b i ] interval for feasible production quantities - a i may be positive. h i inventory holding cost per unit (storage between end of period i to start of period i + 1) c ij setup cost t ij setup related resource consumption Q max is the maximum inventory level T max resource consumption limit
27 lotsizing application - decision variables Decision variables x ij = 1 if i and j are periods with production and there is no production in between. y i is the production quantity auxiliary varible: q i = j i (y j d j ) is the inventory level after period i 23 / 47
28 lotsizing application - MIP 24 / 47 min c ij x ij + f i (y i ) + h i q i 1 i<j n 1 i n 1 i n s.t. q i = (y j d j ) 1 i n j i x ji = x ij 1 < i < n j<i j>i x 1j = 1 and x jn = 1 j<n j>1 1 i<j n t ij x ij T max a i x ij y i b i j>i j>i x ij 1 i n 0 q i Q max 1 i n x ij {0, 1} 1 i < j n y i, q i 0 1 i n
29 DP - case without duration constraint 25 / 47 V i (q) is the minimum cost for inventory level q considering all customers j = 1, 2,..., i and it is PWL. recurrence formula superposition V 0 : {0} {0}, V 0 (0) = 0 (10) envelope { }} { V i = min j<i V j + c j,i }{{} f i ) (11) shifted value function } {{ } superposition (V f )(q) = min y D(f ) {V(q y) f (y)} (12) q y D(V)
30 superposition - example 26 / 47
31 DP (case without duration constraint) - complexity 27 / 47 recurrence formula - complexity V 0 : {0} {0}, V 0 (0) = 0 (13) V i = min j<i (V j + c j,i ) f i (14) The complexity for calculating stage i is O(α(M i ) log(i)m i ), where M i is the number of labels of all predecessor value functions.
32 Dynamic Programming - general case 28 / 47 considering the duration constraint 1 i<j n t ijx ij T max U i,t (q) is the minimum cost for inventory level q considering all customers j = 1, 2,..., i and a given duration budget t. recurrence formula U 0,0 = 0 (15) U i,t = min (U j<i,t j,t +t ji t + c ji) f i (16) superposition (U f )(q) = min y D(f ) {U(q y) f (y)} (17) q y D(U)
33 DP - general case - representation of the value function 29 / 47
34 DP - general case - linked lists 30 / 47
35 DP example - complexity I 31 / 47 (a) second stage: 5 segments (b) third stage: 6 segments
36 DP example - complexity II 32 / 47 (c) forth stage: 26 segments (d) fifth stage: 40 segments
37 Lagrangian Relaxation 33 / 47 L(λ) = min x,y: (2-7) 1 i<j n c ij x ij {}}{ f i (y i ) + λ ( t ij x ij T max ) 1 i n 1 i<j n ɛ(x) L(λ ) = max λ 0 L(λ) remarks L(λ ) is lower bound for the ARELTP calculating L(λ) is equivalent to ARELTP without duration constraint. L(λ) is concave. L(λ ) is associated to a feasible solution of the ARELTP
38 LR - example 34 / 47
39 LR - example 35 / 47
40 LR - example 36 / 47
41 LR - example 37 / 47
42 branch & bound solution branch A branch is defined by mandatory customers and forbidden customers. branching a new branch is generated by additionally excluding and including a customer. lower bounds LR provides lower bounds for the branches of the branch & bound tree. upper bounds Heuristic that locally optimizes the feasible dual optimal solution. 38 / 47
43 branch & bound - details 39 / 47 select active branch select the branch with the largest lower bound branching customer is randomly selected from a set where the heuristic solution is locally optimal.
44 design of experiments instances ARELTP Tisiligirides (size: 32 locations + PWLP 4 steps) Chao-Golden (size: 64/66 locations + PWLP 4 steps) a-priori routes: 20 per instance. lot sizing: new benchmark instances factors number customers / periods (n) duration limit / maximum resource consumtion (T max ) load capacity / maximum inventory level (Q max ) 40 / 47
45 Results: Tsiligirides and Chao-Golden (T max = ) small Qmax medium Qmax large Qmax DP GUROBI CPU time (sec) 1/8 1/16 1/32 1/64 1/128 1/256 1/512 1/1024 1/2048 1/4096 1/8192 1/ /8 1/16 1/32 1/64 1/128 1/256 1/512 1/1024 1/2048 1/4096 1/8192 1/16384 Chao Golden Tsiligirides number of customers 41 / 47
46 Results: lot sizing (T max = ) 42 / 47 small Qmax medium Qmax large Qmax 4 DP GUROBI 2 1 1/2 1/4 CPU time (sec) 1/8 1/16 1/32 1/64 1/128 1/256 1/ number of periods
47 Results: Tsiligirides BBDP DP GUROBI 1/1000 1/512 1/256 1/128 1/64 1/32 1/16 1/8 1/4 1/ number of periods CPU time (sec) small Qmax medium Qmax large Qmax 43 / 47
48 Results: Chao-Golden BBDP DP GUROBI 1/1000 1/512 1/256 1/128 1/64 1/32 1/16 1/8 1/4 1/ number of customers CPU time (sec) small Qmax medium Qmax large Qmax 44 / 47
49 Results: lot sizing large Qmax medium Qmax small Qmax BBDP DP GUROBI CPU time (sec) /2 1/4 1/8 1/16 1/32 1/64 1/128 1/256 1/512 1/ number of periods 45 / 47
50 conclusion and next steps 46 / 47 Conclusion With respect to the computational experiments, the presented B&B approach has in average the best performance. Very large load capacities Q max are beneficial for Gurobi Very large duration limits T max are beneficial for the proposed B&B Very good results for the lot sizing instances next steps integration of the ARELTP solver into a framework to solve lateral transhipment for PWLP. application: stochastic demands extension: more than one route/product, split deliveries...
51 Richard F Hartl and Martin Romauch. The influence of routing on lateral transhipment. In Computer Aided Systems Theory-EUROCAST 2013, pages Springer, / 47
arxiv: v1 [cs.ds] 23 Dec 2015
The lateral transhipment problem with a-priori routes, and a lot sizing application arxiv:1512.07449v1 [cs.ds] 23 Dec 2015 Martin Romauch Department of Business Administration University of Vienna, Austria
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 informationBranch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows
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 Outline Introduction
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 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 informationIntroduction into Vehicle Routing Problems and other basic mixed-integer problems
Introduction into Vehicle Routing Problems and other basic mixed-integer problems Martin Branda Charles University in Prague Faculty of Mathematics and Physics Department of Probability and Mathematical
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 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 informationOn the Approximate Linear Programming Approach for Network Revenue Management Problems
On the Approximate Linear Programming Approach for Network Revenue Management Problems Chaoxu Tong School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853,
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 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 informationInspection Route Optimization
Inspection Route Optimization Bernard Gendron Thibaut Vidal + August 11, 2017 CRM Industrial Problem Solving Workshop, Montréal, Canada CIRRELT and Département d informatique et de recherche opérationnelle,
More informationCAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES
CAPACITATED LOT-SIZING PROBLEM WITH SETUP TIMES, STOCK AND DEMAND SHORTAGES Nabil Absi,1 Safia Kedad-Sidhoum Laboratoire d Informatique d Avignon, 339 chemin des Meinajariès, 84911 Avignon Cedex 09, France
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 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 informationFacility Location and Distribution System Planning. Thomas L. Magnanti
Facility Location and Distribution System Planning Thomas L. Magnanti Today s Agenda Why study facility location? Issues to be modeled Basic models Fixed charge problems Core uncapacitated and capacitated
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 informationTravelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
More 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 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 informationInternational ejournals
ISSN 0976 1411 Available online at www.internationalejournals.com International ejournals International ejournal of Mathematics and Engineering 2 (2017) Vol. 8, Issue 1, pp 11 21 Optimization of Transportation
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 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 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 informationA mass-fow MILP formulation for energy-efficient supplying in assembly lines
1 / 21 A mass-fow MILP formulation for energy-efficient supplying in assembly lines Maria Muguerza Cyril Briand Nicolas Jozefowiez Sandra U. Ngueveu Victoria Rodríguez Matias Urenda Moris LAAS-CNRS, ROC
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 informationThe resource transfer problem
The resource transfer problem Illa Weiss and Christoph Schwindt Clausthal University of Technology, Germany {illa.weiss,christoph.schwindt}@tu-clausthal.de Keywords: vehicle routing and scheduling, project
More informationAlgorithms and Complexity theory
Algorithms and Complexity theory Thibaut Barthelemy Some slides kindly provided by Fabien Tricoire University of Vienna WS 2014 Outline 1 Algorithms Overview How to write an algorithm 2 Complexity theory
More informationChapter 3 THE TIME-DEPENDENT SHORTEST PAIR OF DISJOINT PATHS PROBLEM: COMPLEXITY, MODELS, AND ALGORITHMS
Chapter 3 THE TIME-DEPENDENT SHORTEST PAIR OF DISJOINT PATHS PROBLEM: COMPLEXITY, MODELS, AND ALGORITHMS 3.1 Introduction The general time-dependent shortest pair of disjoint paths problem (TD-2SP) can
More informationVNS for the TSP and its variants
VNS for the TSP and its variants Nenad Mladenović, Dragan Urošević BALCOR 2011, Thessaloniki, Greece September 23, 2011 Mladenović N 1/37 Variable neighborhood search for the TSP and its variants Problem
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 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 informationCable Trench Problem
Cable Trench Problem Matthew V Galati Ted K Ralphs Joseph C Hartman magh@lehigh.edu Department of Industrial and Systems Engineering Lehigh University, Bethlehem, PA Cable Trench Problem p.1 Cable Trench
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 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 informationTRAVELING SALESMAN PROBLEM WITH TIME WINDOWS (TSPTW)
TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS (TSPTW) Aakash Anuj 10CS30043 Surya Prakash Verma 10AE30026 Yetesh Chaudhary 10CS30044 Supervisor: Prof. Jitesh Thakkar TSP Given a list of cities and the distances
More informationSingle-part-type, multiple stage systems
MIT 2.853/2.854 Introduction to Manufacturing Systems Single-part-type, multiple stage systems Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Single-stage,
More information15.081J/6.251J Introduction to Mathematical Programming. Lecture 24: Discrete Optimization
15.081J/6.251J Introduction to Mathematical Programming Lecture 24: Discrete Optimization 1 Outline Modeling with integer variables Slide 1 What is a good formulation? Theme: The Power of Formulations
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 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 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 informationTeaching Integer Programming Formulations Using the Traveling Salesman Problem
SIAM REVIEW Vol. 45, No. 1, pp. 116 123 c 2003 Society for Industrial and Applied Mathematics Teaching Integer Programming Formulations Using the Traveling Salesman Problem Gábor Pataki Abstract. We designed
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 informationThe Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared
The Orienteering Problem under Uncertainty Stochastic Programming and Robust Optimization compared Lanah Evers a,b,c,, Kristiaan Glorie c, Suzanne van der Ster d, Ana Barros a,b, Herman Monsuur b a TNO
More informationInteger Linear Programming (ILP)
Integer Linear Programming (ILP) Zdeněk Hanzálek, Přemysl Šůcha hanzalek@fel.cvut.cz CTU in Prague March 8, 2017 Z. Hanzálek (CTU) Integer Linear Programming (ILP) March 8, 2017 1 / 43 Table of contents
More 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 informationReconnect 04 Introduction to Integer Programming
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, Reconnect 04 Introduction to Integer Programming Cynthia Phillips, Sandia National Laboratories Integer programming
More informationDecision Diagrams and Dynamic Programming
Decision Diagrams and Dynamic Programming J. N. Hooker Carnegie Mellon University CPAIOR 13 Decision Diagrams & Dynamic Programming Binary/multivalued decision diagrams are related to dynamic programming.
More informationImproved methods for the Travelling Salesperson with Hotel Selection
Improved methods for the Travelling Salesperson with Hotel Selection Marco Castro marco.castro@ua.ac.be ANT/OR November 23rd, 2011 Contents Problem description Motivation Mathematical formulation Solution
More 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 informationA Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem
Yongpei Guan 1 Shabbir Ahmed 1 George L. Nemhauser 1 Andrew J. Miller 2 A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem December 12, 2004 Abstract. This paper addresses a
More informationCapacitated ring arborescence problems with profits
Capacitated ring arborescence problems with profits Alessandro Hill 1, Roberto Baldacci 2, and Edna Ayako Hoshino 3 1 School of Business Universidad Adolfo Ibáñez Diagonal Las Torres 2640, Santiago, Chile
More informationA Principled Approach to Mixed Integer/Linear Problem Formulation
A Principled Approach to Mixed Integer/Linear Problem Formulation J N Hooker September 9, 2008 Abstract We view mixed integer/linear problem formulation as a process of identifying disjunctive and knapsack
More information21. Set cover and TSP
CS/ECE/ISyE 524 Introduction to Optimization Spring 2017 18 21. Set cover and TSP ˆ Set covering ˆ Cutting problems and column generation ˆ Traveling salesman problem Laurent Lessard (www.laurentlessard.com)
More 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 informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
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 information18 hours nodes, first feasible 3.7% gap Time: 92 days!! LP relaxation at root node: Branch and bound
The MIP Landscape 1 Example 1: LP still can be HARD SGM: Schedule Generation Model Example 157323 1: LP rows, still can 182812 be HARD columns, 6348437 nzs LP relaxation at root node: 18 hours Branch and
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 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 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 informationComplexity of Routing Problems with Release Dates and Deadlines
Complexity of Routing Problems with Release Dates and Deadlines Alan Erera, Damian Reyes, and Martin Savelsbergh H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology
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 informationto work with) can be solved by solving their LP relaxations with the Simplex method I Cutting plane algorithms, e.g., Gomory s fractional cutting
Summary so far z =max{c T x : Ax apple b, x 2 Z n +} I Modeling with IP (and MIP, and BIP) problems I Formulation for a discrete set that is a feasible region of an IP I Alternative formulations for the
More informationThe Stochastic Vehicle Routing Problem
The Stochastic Vehicle Routing Problem Research Paper Vrije Universiteit Amsterdam Faculty of Sciences Study programme Business Analytics De Boelelaan 08a 08 HV Amsterdam Dimitry Erkin, email:dimitry.erkin@gmail.com
More informationAn Exact Algorithm for the Steiner Tree Problem with Delays
Electronic Notes in Discrete Mathematics 36 (2010) 223 230 www.elsevier.com/locate/endm An Exact Algorithm for the Steiner Tree Problem with Delays Valeria Leggieri 1 Dipartimento di Matematica, Università
More informationBilinear Programming: Applications in the Supply Chain Management
Bilinear Programming: Applications in the Supply Chain Management Artyom G. Nahapetyan Center for Applied Optimization Industrial and Systems Engineering Department University of Florida Gainesville, Florida
More informationarxiv: v1 [math.oc] 22 Feb 2018
2VRP: a benchmark problem for small but rich VRPs. arxiv:1802.08042v1 [math.oc] 22 Feb 2018 Vladimir Deineko Bettina Klinz Abstract We consider a 2-vehicle routing problem (2VRP) which can be viewed as
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 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 informationWhat is an integer program? Modelling with Integer Variables. Mixed Integer Program. Let us start with a linear program: max cx s.t.
Modelling with Integer Variables jesla@mandtudk Department of Management Engineering Technical University of Denmark What is an integer program? Let us start with a linear program: st Ax b x 0 where A
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 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 informationOn the Equivalence of Strong Formulations for Capacitated Multi-level Lot Sizing Problems with Setup Times
On the Equivalence of Strong Formulations for Capacitated Multi-level Lot Sizing Problems with Setup Times Tao Wu 1, Leyuan Shi 1, Joseph Geunes 2, Kerem Akartunalı 3 1 Department of Industrial and Systems
More informationDepartment of Economics and Management University of Brescia Italy. Formulations for an inventory routing problem
+ Working Papers Department of Economics and Management University of Brescia Italy C. Archetti, N. Bianchessi, S. Irnich M.G. Speranza Formulations for an inventory routing problem WPDEM 2013/14 Via S.
More informationSolving LP and MIP Models with Piecewise Linear Objective Functions
Solving LP and MIP Models with Piecewise Linear Obective Functions Zonghao Gu Gurobi Optimization Inc. Columbus, July 23, 2014 Overview } Introduction } Piecewise linear (PWL) function Convex and convex
More informationSOME RESOURCE ALLOCATION PROBLEMS
SOME RESOURCE ALLOCATION PROBLEMS A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationPlowing with Multiple Plows
Plowing with Multiple Plows A Variant of the Windy Postman Problem May 22, 2012 ODYSSEUS 2012 Benjamin Dussault, Bruce Golden, and Edward Wasil 1 Overview Background The Chinese Postman Problem and the
More informationPractical Tips for Modelling Lot-Sizing and Scheduling Problems. Waldemar Kaczmarczyk
Decision Making in Manufacturing and Services Vol. 3 2009 No. 1 2 pp. 37 48 Practical Tips for Modelling Lot-Sizing and Scheduling Problems Waldemar Kaczmarczyk Abstract. This paper presents some important
More informationVehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology
Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part II: Algorithmic Enhancements Handling Practical Complexities
More informationStochastic Integer Programming An Algorithmic Perspective
Stochastic Integer Programming An Algorithmic Perspective sahmed@isye.gatech.edu www.isye.gatech.edu/~sahmed School of Industrial & Systems Engineering 2 Outline Two-stage SIP Formulation Challenges Simple
More informationMachine Scheduling with Deliveries to Multiple Customer Locations
This is the Pre-Published Version. Machine Scheduling with Deliveries to Multiple Customer Locations Chung-Lun Li George Vairaktarakis Chung-Yee Lee April 2003 Revised: November 2003 Abstract One important
More informationBranch 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 informationInteger Equal Flows. 1 Introduction. Carol A. Meyers Andreas S. Schulz
Integer Equal Flows Carol A Meyers Andreas S Schulz Abstract We examine an NP-hard generalization of the network flow problem known as the integer equal flow problem The setup is the same as a standard
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 informationNode Edge Arc Routing Problems (NEARP)
Node Edge Arc Routing Problems (NEARP) Nicolas Briot Coconut-LIRMM janvier 0 Nicolas Briot (Coconut-LIRMM) Node Edge Arc Routing Problems (NEARP) janvier 0 / What is NEARP? Arc and node routing problem
More informationColumn Generation for Extended Formulations
1 / 28 Column Generation for Extended Formulations Ruslan Sadykov 1 François Vanderbeck 2,1 1 INRIA Bordeaux Sud-Ouest, France 2 University Bordeaux I, France ISMP 2012 Berlin, August 23 2 / 28 Contents
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 informationBranching Rules for Minimum Congestion Multi- Commodity Flow Problems
Clemson University TigerPrints All Theses Theses 8-2012 Branching Rules for Minimum Congestion Multi- Commodity Flow Problems Cameron Megaw Clemson University, cmegaw@clemson.edu Follow this and additional
More informationA priori performance measures for arc-based formulations of the Vehicle Routing Problem
A priori performance measures for arc-based formulations of the Vehicle Routing Problem Fernando Ordóñez, Ilgaz Sungur, and Maged Dessouky Industrial and Systems Engineering, University of Southern California
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 informationA Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands
A Recourse Approach for the Capacitated Vehicle Routing Problem with Evidential Demands Nathalie Helal 1, Frédéric Pichon 1, Daniel Porumbel 2, David Mercier 1 and Éric Lefèvre1 1 Université d Artois,
More informationLagrangean Decomposition for Mean-Variance Combinatorial Optimization
Lagrangean Decomposition for Mean-Variance Combinatorial Optimization Frank Baumann, Christoph Buchheim, and Anna Ilyina Fakultät für Mathematik, Technische Universität Dortmund, Germany {frank.baumann,christoph.buchheim,anna.ilyina}@tu-dortmund.de
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 informationResource Constrained Project Scheduling Linear and Integer Programming (1)
DM204, 2010 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Resource Constrained Project Linear and Integer Programming (1) Marco Chiarandini Department of Mathematics & Computer Science University of Southern
More informationThe Downhill Plow Problem with Multiple Plows
The Downhill Plow Problem with Multiple Plows Benjamin Dussault, Bruce Golden, and Edward Wasil INFORMS Annual Meeting 2012 Phoenix, Arizona 1 Overview Background The Chinese Postman Problem and the Windy
More informationSolving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem
Solving a Production Scheduling Problem as a Time-Dependent Traveling Salesman Problem GABRIELLA STECCO Department of Applied Mathematics, University Ca Foscari of Venice, Dorsoduro n. 3825/E, 30123 Venice,
More informationA Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty
A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty Hatice Calik 1,2 and Bernard Fortz 1,3 1 Department of Computer Science, Université
More informationThe Probabilistic Pickup and Delivery Problem
The Probabilistic Pickup and Delivery Problem Enrique Benavent 1, M. Landete 2, J.J. Salazar 3, G. Tirado 4 1 Departament d'estadística i Investigació Operativa, Universitat de València, Spain 2 Universidad
More information