zbMATH — the first resource for mathematics

Optimisation of maintenance routing and scheduling for offshore wind farms. (English) Zbl 1394.90278
Summary: An optimisation model and a solution method for maintenance routing and scheduling at offshore wind farms are proposed. The model finds the optimal schedule for maintaining the turbines and the optimal routes for the crew transfer vessels to service the turbines along with the number of technicians required for each vessel. The model takes into account multiple vessels, multiple periods (days), multiple Operation & Maintenance (O&M) bases, and multiple wind farms. We develop an algorithm based on the Dantzig-Wolfe decomposition method, where a mixed integer linear program is solved for each subset of turbines to generate all feasible routes and maintenance schedules for the vessels for each period. The routes have to consider several constraints such as weather conditions, the availability of vessels, and the number of technicians available at the O&M base. An integer linear program model is then proposed to find the optimal route configuration along with the maintenance schedules that minimise maintenance costs, including travel, technician and penalty costs. The computational experiments show that the proposed optimisation model and solution method find optimal solutions to the problem in reasonable computing times.

90B35 Deterministic scheduling theory in operations research
90B25 Reliability, availability, maintenance, inspection in operations research
90C27 Combinatorial optimization
90C11 Mixed integer programming
Full Text: DOI
[1] Baldacci, R.; Bartolini, E.; Mingozzi, A., An exact algorithm for the pickup and delivery problem with time windows, Operations Research, 59, 414-426, (2011) · Zbl 1233.90058
[2] Barnhart, C.; Johnson, E. L.; Nemhauser, G. L.; Savelsbergh, M. V.P.; Vance, P. H., Column generation for solving huge integer programs, Operations Research, 46, 3, 316-329, (1998) · Zbl 0979.90092
[3] Berbeglia, G.; Cordeau, J-F.; Gribkovskaia, I.; Laporte, G., Static pickup and delivery problems: A classification scheme and survey, TOP, 15, 1-31, (2007) · Zbl 1121.90001
[4] Besnard, F.; Patriksson, M.; Strőmberg, A.; Wojciechowski, A.; Bertling, L., An optimization framework for opportunistic maintenance of offshore wind power system, (Proceedings of IEEE Bucharest powertech conference, Bucharest, Romania, (2009))
[5] Besnard, F.; Patriksson, M.; Strőmberg, A.; Wojciechowski, A.; Bertling, L., A stochastic model for opportunistic service maintenance planning of offshore wind farms, (Proceedings of the IEEE powertech conference, Trondheim, Norway, (2011))
[6] Bjelić, N.; Vidović, M.; Popović, D., Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows, Expert Systems with Applications, 40, 5997-6006, (2013)
[7] Bock, S., Solving the traveling repairman problem on a line with general processing times and deadlines, European Journal of Operational Research, 244, 690-703, (2015) · Zbl 1346.90692
[8] Brønmo, G.; Nygreen, B.; Lysgaard, J., Column generation approaches to ship routing and scheduling with flexible cargo sizes, European Journal of Operational Research, 200, 139-150, (2010) · Zbl 1190.90068
[9] Byon, E.; Pérez, E.; Ding, Y.; Ntaimo, L., Simulation of wind farm operations and maintenance using discrete event system specification, Simulation, 87, 1093-1117, (2011)
[10] Camci, F., The travelling maintainer problem: integration of condition-based maintenance with the travelling salesman problem, Journal of the Operational Research Society,, 65, 1423-1436, (2014)
[11] Camci, F., Maintenance scheduling of geographically distributed assets with prognostics information, European Journal of Operational Research, 245, 506-516, (2015) · Zbl 1346.90331
[12] Cordeau, J.-F.; Laporte, G., The dial-a-ride problem: models and algorithms, Annals of Operations Research, 153, 29-46, (2007) · Zbl 1157.90353
[13] Dantzig, G. B.; Wolfe, P., Decomposition principle for linear programs, Operations Research, 8, 101-111, (1960) · Zbl 0093.32806
[14] Dumas, Y.; Desrosiers, J.; Soumis, F., The pickup and delivery problem with time windows, European Journal of Operational Research, 54, 1, 7-22, (1991) · Zbl 0736.90028
[15] Dai, L.; Stålhane, M.; Utne, I. B., Routing and scheduling of maintenance fleet for offshore wind farms, Wind Engineering, 39, 15-30, (2015)
[16] Dewilde, T.; Cattrysse, D.; Coene, S.; Spieksma, F. C.R.; Vansteenwegen, P., Heuristics for the traveling repairman problem with profits, Computers & Operations Research, 40, 1700-1707, (2013) · Zbl 1348.90634
[17] European Committee for Standardization (2010). Maintenance: Maintenance terminology. EN 13306: 2010.
[18] García-González, J.; delaMuela, R. M.R.; Santos, L. M.; Gonzalez, A. M., Stochastic joint optimization of wind generation and pumped-storage units in an electricity market, IEEE Transactions on Power Systems, 23, 460-468, (2008)
[19] Gschwind, T., A comparison of column-generation approaches to the synchronized pickup and delivery problem, European Journal of Operational Research, 247, 1, 60-71, (2015) · Zbl 1346.90117
[20] Kovács, A.; Erdős, G.; Viharos, Z. J.; Monostori, L., A system for the detailed scheduling of wind farm maintenance, CIRP Annals Manufacturing Technology, 60, 497-501, (2011)
[21] Luo, Z.; Qin, H.; Lim, A., Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, European Journal of Operational Research, 234, 49-60, (2014) · Zbl 1305.90408
[22] Parikh, N. D. (2012). Optimizing maintenance cost of wind farms by scheduling preventive maintenance and replacement of critical components using mathematical approach. (Master thesis). Texas A&M University, US.
[23] Parragh, S. N.; Pinho de Sousa, J.; Almada-Lobo, B., The dial-a-ride problem with split requests and profits, Transportations Science, 49, 2, 311-334, (2015)
[24] Perez-Canton, S.; Rubio-Romero, J. C., A model for the preventive maintenance scheduling of power plants including wind farms, Reliability Engineering & System Safety, 119, 67-75, (2013)
[25] Poggi, M.; Uchoa, E., New exact algorithms for the capacitated vehicle routing problem, (Toth, P.; Vigo, D., Vehicle routing problems, methods, and applications, (2014), SIAM), 59-86
[26] Røpke, S.; Cordeau, J-F., Branch-and-cut-and-price for the pickup and delivery problem with time windows, Transportation Science, 43, 3, 267-286, (2009)
[27] Salehipour, A.; Sörensen, K.; Goos, P.; Bräysy, O., Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem, 4Q Journal of Operations Research, 9, 189-209, (2011) · Zbl 1221.90077
[28] Savelsbergh, M.; Sol, M., Drive: dynamic routing of independent vehicles, Operations Research, 46, 4, 474-490, (1998) · Zbl 0987.90511
[29] Shafiee, M., Maintenance logistics organization for offshore wind energy: current progress and future perspectives, Renewable Energy, 77, 182-193, (2015)
[30] Snyder, B.; Kaiser, M., Ecological and economic cost-benefit analysis of offshore wind energy, Renewable Energy, 34, 6, 1567-1578, (2009)
[31] Stålhane, M.; Hvattum, L. M.; Skaar, V., Optimization of routing and scheduling of vessels to perform maintenance at offshore wind farms, Energy Procedia, 80, 92-99, (2015)
[32] Van Horenbeek, A.; Van Ostaeyen, J.; Duflou, J.; Pintelon, L., Prognostic maintenance scheduling for offshore wind turbine farms, (Proceedings of the 4th production & operations management world conference, Amsterdam, the Netherlands, (2012))
[33] Zhang, J.; Chowdhury, S.; Zhang, J., Optimal preventive maintenance time windows for offshore wind farms subject to wake losses, (Proceedings of the 14th AIAA/ISSMO multidisciplinary analysis and optimization conference, Indianapolis, US, (2012))
[34] Zhang, Z.; Kusiak, A.; Song, Z., Scheduling electric power production at a wind farm, European Journal of Operational Research, 224, 227-238, (2013) · Zbl 1292.90129
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.