Vessel route planning with worker schedule optimization for offshore windmill maintenance
- Author
- Erik De Kuyffer (UGent) , Toon De Pessemier (UGent) , Wout Joseph (UGent) and Luc Martens (UGent)
- Organization
- Abstract
- The high fuel prices and the important costs linked to the down-time of the windmills during maintenance urge the need for minimization of the travel time and the scheduling of jobs within a minimal time span. Since landing in windmills at sea is difficult and depends on meteorological parameters, the constraint of maintenance windows is added when searching for the optimal route. To minimize the distance traveled, the Vehicle Routing Problem with Time Windows (VRPTW) is solved, using three different methods. The VRPTW is applied to two separate databases, namely various sets of windmills to be maintained and several numbers of customers to be serviced. Applications with 8 to 175 windmills, divided over 3 farms have shown that the VRPTW solved by using three different methods resulted in a comparable relative gain in travel distance, compared to a randomly chosen route. The main difference between the methods studied is the amount of calculation time needed, which varies from 1 second to 6 minutes for the different methods. To demonstrate the general applicability, the same three methods were executed on a set of service tasks performed on 8 to 40 customers of a window decoration company, distributed throughout Belgium, resulting in similar results. In a second part of the paper, the Job Shop Scheduling Problem (JSSP) is solved to minimize the total maintenance span of offshore windmills as an additional objective function. This led to a relative gain of up to 62% in maintenance time, compared to the total maximum maintenance span for an application of 40 windmills. Finally, both objectives - minimal distance and minimal maintenance time span - are combined, resulting in a set of non-dominated maintenance sequences that the planner can use.
- Keywords
- VRPy, OR Tools, ACO, Job Shop Scheduling, Pareto., VRPTW
Downloads
-
Second Paper Conference Full 10112025 (2).pdf
- full text (Accepted manuscript)
- |
- open access
- |
- |
- 664.21 KB
-
(...).pdf
- full text (Published version)
- |
- UGent only
- |
- |
- 773.36 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-01KFRSKJD1VT026END85EZDW2T
- MLA
- De Kuyffer, Erik, et al. “Vessel Route Planning with Worker Schedule Optimization for Offshore Windmill Maintenance.” INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE, vol. 18, no. 3–4, 2025, pp. 158–68.
- APA
- De Kuyffer, E., De Pessemier, T., Joseph, W., & Martens, L. (2025). Vessel route planning with worker schedule optimization for offshore windmill maintenance. INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE, 18(3–4), 158–168.
- Chicago author-date
- De Kuyffer, Erik, Toon De Pessemier, Wout Joseph, and Luc Martens. 2025. “Vessel Route Planning with Worker Schedule Optimization for Offshore Windmill Maintenance.” INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE 18 (3–4): 158–68.
- Chicago author-date (all authors)
- De Kuyffer, Erik, Toon De Pessemier, Wout Joseph, and Luc Martens. 2025. “Vessel Route Planning with Worker Schedule Optimization for Offshore Windmill Maintenance.” INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE 18 (3–4): 158–168.
- Vancouver
- 1.De Kuyffer E, De Pessemier T, Joseph W, Martens L. Vessel route planning with worker schedule optimization for offshore windmill maintenance. INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE. 2025;18(3–4):158–68.
- IEEE
- [1]E. De Kuyffer, T. De Pessemier, W. Joseph, and L. Martens, “Vessel route planning with worker schedule optimization for offshore windmill maintenance,” INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE, vol. 18, no. 3–4, pp. 158–168, 2025.
@article{01KFRSKJD1VT026END85EZDW2T,
abstract = {{The high fuel prices and the important costs linked to the down-time of the windmills during maintenance urge the need for minimization of the travel time and the scheduling of jobs within a minimal time span. Since landing in windmills at sea is difficult and depends on meteorological parameters, the constraint of maintenance windows is added when searching for the optimal route. To minimize the distance traveled, the Vehicle Routing Problem with Time Windows (VRPTW) is solved, using three different methods. The VRPTW is applied to two separate databases, namely various sets of windmills to be maintained and several numbers of customers to be serviced. Applications with 8 to 175 windmills, divided over 3 farms have shown that the VRPTW solved by using three different methods resulted in a comparable relative gain in travel distance, compared to a randomly chosen route. The main difference between the methods studied is the amount of calculation time needed, which varies from 1 second to 6 minutes for the different methods. To demonstrate the general applicability, the same three methods were executed on a set of service tasks performed on 8 to 40 customers of a window decoration company, distributed throughout Belgium, resulting in similar results. In a second part of the paper, the Job Shop Scheduling Problem (JSSP) is solved to minimize the total maintenance span of offshore windmills as an additional objective function. This led to a relative gain of up to 62% in maintenance time, compared to the total maximum maintenance span for an application of 40 windmills. Finally, both objectives - minimal distance and minimal maintenance time span - are combined, resulting in a set of non-dominated maintenance sequences that the planner can use.}},
author = {{De Kuyffer, Erik and De Pessemier, Toon and Joseph, Wout and Martens, Luc}},
issn = {{1942-2628}},
journal = {{INTERNATIONAL JOURNAL ON ADVANCES IN SOFTWARE}},
keywords = {{VRPy,OR Tools,ACO,Job Shop Scheduling,Pareto.,VRPTW}},
language = {{eng}},
number = {{3-4}},
pages = {{158--168}},
title = {{Vessel route planning with worker schedule optimization for offshore windmill maintenance}},
url = {{https://www.thinkmind.org/library/Soft/Soft_v18_n34_2025/soft_v18_n34_2025_4.html}},
volume = {{18}},
year = {{2025}},
}