Coordinating technician allocation and maintenance routing for offshore wind farms

Abstract A maintenance activity at offshore wind farms requires a combination of technicians with different skills. At an operational level, it is important to fully utilize and coordinate technicians in order to increase efficiency of the short-term maintenance planning. In this paper, we investigate sharing of technicians between wind farms over multiple periods, while determining per period vessel routes for delivering and picking up technicians. The problem can be considered as a novel variant of the multi-period multi-commodity pickup and delivery problem. We develop an Adaptive Large Neighborhood Search heuristic which achieves high-quality, and often optimal, solutions on benchmark instances from the literature. The heuristic is used to explore the benefits of different sharing policies. By sharing technicians, both the flexibility of the daily planning is improved and the expected maintenance costs are reduced. In addition, the increased flexibility results in fewer vessel trips and increases the decision maker’s ability to cope with extreme scenarios encountered in the short-term maintenance planning.

[1]  Maciek Nowak,et al.  Workforce Management in Periodic Delivery Operations , 2013, Transp. Sci..

[2]  Atul Bhandari,et al.  An Exact and Efficient Algorithm for the Constrained Dynamic Operator Staffing Problem for Call Centers , 2008, Manag. Sci..

[3]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[4]  Kenneth Sörensen,et al.  Determining collaborative profits in coalitions formed by two partners with varying characteristics , 2016 .

[5]  Thomas Stützle,et al.  A destroy and repair algorithm for the Bike sharing Rebalancing Problem , 2016, Comput. Oper. Res..

[6]  M. Shafiee Maintenance logistics organization for offshore wind energy: Current progress and future perspectives , 2015 .

[7]  Tom Van Woensel,et al.  An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines , 2016, Comput. Oper. Res..

[8]  Demetrio Laganà,et al.  An Integrated Algorithm for Shift Scheduling Problems for Local Public Transport Companies , 2018, AIRO Springer Series.

[9]  Gilbert Laporte,et al.  Rejoinder on: Static pickup and delivery problems: a classification scheme and survey , 2007 .

[10]  Roberto Baldacci,et al.  An Exact Algorithm for the Pickup and Delivery Problem with Time Windows , 2011, Oper. Res..

[11]  Magnus Stålhane,et al.  Optimization of routing and scheduling of vessels to perform maintenance at offshore wind farms , 2015 .

[12]  Chandra Ade Irawan,et al.  Optimisation of maintenance routing and scheduling for offshore wind farms , 2017, Eur. J. Oper. Res..

[13]  M. Sol The general pickup and delivery problem , 2010 .

[14]  Simona Mancini,et al.  A real-life Multi Depot Multi Period Vehicle Routing Problem with a Heterogeneous Fleet: Formulation and Adaptive Large Neighborhood Search based Matheuristic , 2016 .

[15]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[16]  D. Rogers,et al.  A Meta‐Analysis of Supply Chain Integration and Firm Performance , 2013 .

[17]  Inmaculada Rodríguez Martín,et al.  A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem , 2016, Eur. J. Oper. Res..

[18]  Chung-Piaw Teo,et al.  Resource Pooling and Allocation Policies to Deliver Differentiated Service , 2014, Manag. Sci..

[19]  Juan José Salazar González,et al.  The multi‐commodity pickup‐and‐delivery traveling salesman problem , 2014, Networks.

[20]  Juan José Salazar González,et al.  Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem , 2004, Transp. Sci..

[21]  Margaret Comerford Freda The solution? , 2005, MCN. The American journal of maternal child nursing.

[22]  Iris F. A. Vis,et al.  A solution approach for deriving alternative fuel station infrastructure requirements , 2018 .

[23]  Inmaculada Rodríguez Martín,et al.  A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem , 2009, Comput. Oper. Res..

[24]  Mahdi Alinaghian,et al.  Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search , 2018 .

[25]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

[26]  Oded Berman,et al.  On the Benefits of Risk Pooling in Inventory Management , 2011 .

[27]  Paolo Detti,et al.  A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare☆ , 2017 .

[28]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[29]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[30]  Gilbert Laporte,et al.  The static bike relocation problem with multiple vehicles and visits , 2018, Eur. J. Oper. Res..

[31]  Magnus Stålhane,et al.  Routing and Scheduling of Maintenance Fleet for Offshore Wind Farms , 2015 .