A branch-price-and-cut algorithm for the workover rig routing problem

DOI10.1016/J.COR.2012.04.010MaRDI QIDQ339692zbMATH OpenOpenAlexFDO

Authors Glaydston Mattos Ribeiro, Guy Desaulniers, Jacques Desrosiers

Publication date 11 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2012.04.010

zbMATH Keywords

column generationvehicle routingbranch-price-and-cut\(ng\)-pathssubset-row inequalitiestabu search column generatorworkover rig routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• A comparison of three metaheuristics for the workover rig routing problem
• Models and hybrid methods for the onshore wells maintenance problem
• Scheduling workover rigs for onshore oil production
• A hybrid algorithm for the drilling rig routing problem
• Exact and hybrid methods for the multiperiod field service routing problem

Cites work

• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• A comparison of three metaheuristics for the workover rig routing problem
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• An exact solution framework for a broad class of vehicle routing problems
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
• Cutting planes for branch-and-price algorithms
• Decomposition Principle for Linear Programs
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• New route relaxation and pricing strategies for the vehicle routing problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Scheduling workover rigs for onshore oil production
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• The capacitated team orienteering and profitable tour problems

Cited in

(9)

• Scheduling workover rigs for onshore oil production
• A hybrid algorithm for the drilling rig routing problem
• A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
• The discrete time window assignment vehicle routing problem
• Bottleneck vehicle routing for planning power supply during disasters
• Models and hybrid methods for the onshore wells maintenance problem
• A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• A comparison of three metaheuristics for the workover rig routing problem

This page was built for publication: A branch-price-and-cut algorithm for the workover rig routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339692)