A comparison of three metaheuristics for the workover rig routing problem

DOI10.1016/J.EJOR.2012.01.031MaRDI QIDQ1926698zbMATH OpenOpenAlexFDO

Authors Glaydston Mattos Ribeiro, G. Laporte, Geraldo Regis Mauri

Publication date 29 December 2012

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.01.031

zbMATH Keywords

adaptive large neighborhood searchclustering searchiterated local searchmetaheuristicsworkover rig routing problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A branch-price-and-cut algorithm for the workover rig routing problem
• A hybrid algorithm for the drilling rig routing problem
• Scheduling workover rigs for onshore oil production
• Models and hybrid methods for the onshore wells maintenance problem
• scientific article; zbMATH DE number 1488069

Cites work

• A general heuristic for vehicle routing problems
• A new formulation for the traveling deliveryman problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• A unified heuristic for a large class of vehicle routing problems with backhauls
• Advances in Artificial Intelligence – SBIA 2004
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• Clustering search algorithm for the capacitated centered clustering problem
• Error detecting and error correcting codes
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2064412 (Why is no real title available?)
• Hybrid evolutionary algorithms.
• Iterated local search for the quadratic assignment problem
• Lagrangian duality applied to the vehicle routing problem with time windows
• Scheduling workover rigs for onshore oil production
• Special cases of traveling salesman and repairman problems with time windows
• The Delivery Man Problem and Cumulative Matroids
• The delivery man problem with time windows
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• Time‐dependent traveling salesman problem–the deliveryman case

Cited in

(11)

• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Scheduling workover rigs for onshore oil production
• A clustering search metaheuristic for the point-feature cartographic label placement problem
• Maintenance scheduling of geographically distributed assets with prognostics information
• Models and hybrid methods for the onshore wells maintenance problem
• A branch-price-and-cut algorithm for the workover rig routing problem
• A hybrid algorithm for the drilling rig routing problem
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem

This page was built for publication: A comparison of three metaheuristics 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 Q1926698)