Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics

被引:0
|
作者
Felix Hübner
Patrick Gerhards
Christian Stürck
Rebekka Volk
机构
[1] Karlsruhe Institute of Technology (KIT),Institute for Industrial Production (IIP)
[2] Helmut Schmidt University,Institute of Computer Science
[3] Helmut Schmidt University,Institute for Management Science and Operations Research
来源
Journal of Scheduling | 2021年 / 24卷
关键词
Project scheduling; Multi-mode resource investment problem; Mixed-integer programming; Constraint programming; Metaheuristic; Nuclear dismantling project scheduling problem;
D O I
暂无
中图分类号
学科分类号
摘要
Scheduling of megaprojects is very challenging because of typical characteristics, such as expected long project durations, many activities with multiple modes, scarce resources, and investment decisions. Furthermore, each megaproject has additional specific characteristics to be considered. Since the number of nuclear dismantling projects is expected to increase considerably worldwide in the coming decades, we use this type of megaproject as an application case in this paper. Therefore, we consider the specific characteristics of constrained renewable and non-renewable resources, multiple modes, precedence relations with and without no-wait condition, and a cost minimisation objective. To reliably plan at minimum costs considering all relevant characteristics, scheduling methods can be applied. But the extensive literature review conducted did not reveal a scheduling method considering the special characteristics of nuclear dismantling projects. Consequently, we introduce a novel scheduling problem referred to as the nuclear dismantling project scheduling problem. Furthermore, we developed and implemented an effective metaheuristic to obtain feasible schedules for projects with about 300 activities. We tested our approach with real-life data of three different nuclear dismantling projects in Germany. On average, it took less than a second to find an initial feasible solution for our samples. This solution could be further improved using metaheuristic procedures and exact optimisation techniques such as mixed-integer programming and constraint programming. The computational study shows that utilising exact optimisation techniques is beneficial compared to standard metaheuristics. The main result is the development of an initial solution finding procedure and an adaptive large neighbourhood search with iterative destroy and recreate operations that is competitive with state-of-the-art methods of related problems. The described problem and findings can be transferred to other megaprojects.
引用
收藏
页码:269 / 290
页数:21
相关论文
共 50 条
  • [41] Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
    Burgard, Jan Pablo
    Moreira Costa, Carina
    Hojny, Christopher
    Kleinert, Thomas
    Schmidt, Martin
    JOURNAL OF GLOBAL OPTIMIZATION, 2023, 87 (01) : 133 - 189
  • [42] Mixed-integer programming techniques for the connected max-k-cut problem
    Hojny, Christopher
    Joormann, Imke
    Luethen, Hendrik
    Schmidt, Martin
    MATHEMATICAL PROGRAMMING COMPUTATION, 2021, 13 (01) : 75 - 132
  • [43] Mixed-integer programming techniques for the connected max-k-cut problem
    Christopher Hojny
    Imke Joormann
    Hendrik Lüthen
    Martin Schmidt
    Mathematical Programming Computation, 2021, 13 : 75 - 132
  • [44] Bilevel Mixed-Integer Linear Programming Model for Solving the Single Airport Location Problem
    Hammad, Ahmed W. A.
    Akbarnezhad, Ali
    Rey, David
    JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 2017, 31 (05)
  • [45] Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem
    Lunardi, Willian T.
    Birgin, Ernesto G.
    Laborie, Philippe
    Ronconi, Debora P.
    Voos, Holger
    COMPUTERS & OPERATIONS RESEARCH, 2020, 123
  • [46] Erratum to: “Solving the Mixed-Integer Knapsack Problem by Decrease of Dimension and Use of Dynamic Programming”
    K. Sh. Mamedov
    K. K. Mamedov
    S. K. Yolchuyeva
    Automatic Control and Computer Sciences, 2016, 50 (1) : 63 - 63
  • [47] Grammatical evolution for constraint synthesis for mixed-integer linear programming
    Pawlak, Tomasz P.
    O'Neill, Michael
    SWARM AND EVOLUTIONARY COMPUTATION, 2021, 64
  • [48] Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations
    Al-Yakoob, Salem M.
    Sherali, Hanif D.
    ANNALS OF OPERATIONS RESEARCH, 2007, 155 (01) : 119 - 142
  • [49] Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations
    Salem M. Al-Yakoob
    Hanif D. Sherali
    Annals of Operations Research, 2007, 155 : 119 - 142
  • [50] Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
    Ignacio E. Grossmann
    Optimization and Engineering, 2002, 3 : 227 - 252