Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325753 
Year of Publication: 
2023
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 10 [Article No.:] 100267 [Year:] 2023 [Pages:] 1-12
Publisher: 
Elsevier, Amsterdam
Abstract: 
Despite a lot of research about predictive maintenance for onshore and offshore windmill farms, nearly no investigation has been performed to obtain the optimal sequence in which windmills are to be served in a predefined time frame. The higher fuel costs and the increasing time pressure on maintenance jobs urge the need for optimisation, so offshore windmills can be serviced at minimal costs and within a limited time frame. To minimise distance travelled, fuel consumption and average tardiness of all maintenance tasks to be carried out, a multi-objective, non-dominated sorting island model of genetic algorithms is used. The following novel contributions are realised: (i) A multi-objective island model is used, where on each island a different genetic algorithm is used to minimise a separate cost function per island. (ii) A set of non-dominated maintenance sequences, shown as a Pareto plane, are computed and (iii) these optimal solutions can be used by the planner to select the route to be followed by the CTV when travelling from windmill to windmill during a maintenance sequence. Tests on two of the islands have resulted in a relative improvement of around 65 to 70% on fuel consumption and distance in relation to a random sequence, while the third island has generated a relative gain of 69% in average weighed tardiness. The three islands combined have resulted in a set of Pareto optimal sequences for offshore windmill maintenance.
Subjects: 
Consumption and time
Genetic Algorithm
Island model
Offshore windmill parks
Optimisation in distance
Planning
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.