Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
DOI10.1016/J.EJOR.2020.06.039zbMATH Open1487.90074OpenAlexW3038339472MaRDI QIDQ2028802FDOQ2028802
Authors: Steffen J. Bakker, Akang Wang, Chrysanthos E. Gounaris 
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.039
Recommendations
- Planning of an offshore well plugging campaign: a vehicle routing approach
- Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms
- Learning effects on maintenance outsourcing
- A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy
- A state-of-the-art review on scheduling with learning effects
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A comparative analysis of several asymmetric traveling salesman problem formulations
- The vehicle routing problem
- Handbooks in operations Research \& management science: Transportation
- The vehicle routing problem with time windows and temporal dependencies
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- A state-of-the-art review on scheduling with learning effects
- New route relaxation and pricing strategies for the vehicle routing problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A comparison of three metaheuristics for the workover rig routing problem
- A branch and bound algorithm for the capacitated vehicle routing problem
- The precedence-constrained asymmetric traveling salesman polytope
- The vehicle-routing problem with time windows and driver-specific times
- Exact algorithms for the clustered vehicle routing problem
- Classification of travelling salesman problem formulations
- New mathematical models of the generalized vehicle routing problem and extensions
- Scheduling workover rigs for onshore oil production
- Some applications of the generalized vehicle routing problem
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Improved branch-cut-and-price for capacitated vehicle routing
- A generic exact solver for Vehicle Routing and related problems
- Multi-period technician scheduling with experience-based service times and stochastic customers
Cited In (1)
Uses Software
This page was built for publication: Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028802)
