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

被引:29
|
作者
Irawan, Chandra Ade [1 ,2 ]
Jones, Dylan [1 ]
Ouelhadj, Djamila [1 ]
机构
[1] Univ Portsmouth, Dept Math, Ctr Operat Res & Logist, Lion Gate Bldg,Lion Terrace, Portsmouth PO1 3HF, Hants, England
[2] Inst Teknol Nas, Dept Ind Engn, Bandung 40124, Indonesia
关键词
Variable Neighbourhood Search; Simulated Annealing; Multi-objectives; Compromise programming; Installation scheduling; Offshore wind farm; ALGORITHM; SYSTEM; GOAL;
D O I
10.1016/j.cor.2015.09.010
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:393 / 407
页数:15
相关论文
共 50 条
  • [21] Layout optimisation for an installation port of an offshore wind farm
    Irawan, Chandra Ade
    Song, Xiang
    Jones, Dylan
    Akbari, Negar
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 259 (01) : 67 - 83
  • [22] A combined supply chain optimisation model for the installation phase of offshore wind projects
    Irawan, Chandra Ade
    Akbari, Negar
    Jones, Dylan F.
    Menachof, David
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (03) : 1189 - 1207
  • [23] Stable maintenance tasks scheduling: A bi-objective robust optimization model
    Golpira, Heris
    Tirkolaee, Erfan Babaee
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 137
  • [24] Bi-objective scheduling on two dedicated processors
    Kacem, Adel
    Dammak, Abdelaziz
    [J]. EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2019, 13 (05) : 681 - 700
  • [25] A stochastic bi-objective project scheduling model under failure of activities
    Rezaei, Fatemeh
    Najafi, Amir Abbas
    Demeulemeester, Erik
    Ramezanian, Reza
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 338 (01) : 453 - 476
  • [26] A bi-objective model for robust resource-constrained project scheduling
    Al-Fawzan, MA
    Haouari, M
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2005, 96 (02) : 175 - 187
  • [27] A bi-objective model for robust yard allocation scheduling for outbound containers
    Liu, Changchun
    Zhang, Canrong
    Zheng, Li
    [J]. ENGINEERING OPTIMIZATION, 2017, 49 (01) : 113 - 135
  • [28] A Bi-Objective Model for a Stage Shop Scheduling Problem with HumanRobot Collaboration
    Ghasemkhani, Ahmad
    Tavakkoli-Moghaddam, Reza
    Hamid, Mahdi
    Nasiri, Mohammad Mahdi
    [J]. IFAC PAPERSONLINE, 2022, 55 (10): : 1290 - 1295
  • [29] A bi-objective robust model for berth allocation scheduling under uncertainty
    Xiang Xi
    Liu Changchun
    Miao Lixin
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 106 : 294 - 319
  • [30] Bi-objective orienteering for personal activity scheduling
    Matl, Piotr
    Nolz, Pamela C.
    Ritzinger, Ulrike
    Ruthmair, Mario
    Tricoire, Fabien
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 82 : 69 - 82