A comparison of three metaheuristics for the workover rig routing problem

DOI10.1016/j.ejor.2012.01.031zbMath1253.90062OpenAlexW2029899967MaRDI QIDQ1926698

Glaydston Mattos Ribeiro, Geraldo Regis Mauri, Gilbert Laporte

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

metaheuristicsiterated local searchadaptive large neighborhood searchclustering searchworkover rig routing problem

Mathematics Subject Classification ID

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

Related Items

Maintenance scheduling of geographically distributed assets with prognostics information, An adaptive large neighborhood search for the discrete and continuous berth allocation problem, A branch-price-and-cut algorithm for the workover 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, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning, A clustering search metaheuristic for the point-feature cartographic label placement problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• The delivery man problem with time windows
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• An effective memetic algorithm for the cumulative capacitated vehicle routing problem
• A new formulation for the traveling deliveryman problem
• Clustering search algorithm for the capacitated centered clustering problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Hybrid evolutionary algorithms.
• Scheduling workover rigs for onshore oil production
• Lagrangian duality applied to the vehicle routing problem with time windows
• Iterated local search for the quadratic assignment problem
• Special cases of traveling salesman and repairman problems with time windows
• The Delivery Man Problem and Cumulative Matroids
• Error Detecting and Error Correcting Codes
• Time‐dependent traveling salesman problem–the deliveryman case
• Advances in Artificial Intelligence – SBIA 2004