Bi-objective optimisation model for installation scheduling in offshore wind farms

Chandra Ade Irawan, Dylan Jones, Djamila Ouelhadj

Research output: Journal PublicationArticlepeer-review

37 Citations (Scopus)


A bi-objective optimisation using a compromise programming approach is proposed for installation scheduling of an offshore wind farm. As the installation cost and the completion period of the installation are important aspects in the construction of an offshore wind farm, the proposed method is used to deal with those conflicting objectives. We develop a mathematical model using integer linear programming (ILP) to determine the optimal installation schedule considering several constraints such as weather condition and the availability of vessels. We suggest two approaches to deal with the multi-objective installation scheduling problem, namely compromise programming with exact method and with metaheuristic techniques. In the exact method the problem is solved by CPLEX whereas in the metaheuristic approach we propose Variable Neighbourhood Search (VNS) and Simulated Annealing (SA). Moreover, greedy algorithms and a local search for solving the scheduling problem are introduced. Two generated datasets are used for testing our approaches. The computational experiments show that the proposed metaheuristic approaches produce interesting results as the optimal solution for some cases is obtained.

Original languageEnglish
Pages (from-to)393-407
Number of pages15
JournalComputers and Operations Research
Publication statusPublished - 1 Feb 2017
Externally publishedYes


  • Compromise programming
  • Installation scheduling
  • Multi-objectives
  • Offshore wind farm
  • Simulated Annealing
  • Variable Neighbourhood Search

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Bi-objective optimisation model for installation scheduling in offshore wind farms'. Together they form a unique fingerprint.

Cite this