当前位置: X-MOL 学术J. Sched. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics
Journal of Scheduling ( IF 2 ) Pub Date : 2021-04-12 , DOI: 10.1007/s10951-021-00682-x
Felix Hübner , Patrick Gerhards , Christian Stürck , Rebekka Volk

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.



中文翻译:

混合整数约束算法与元启发式算法相结合解决核拆除项目调度问题

大型项目的调度非常具有挑战性,因为它具有典型的特征,例如预期的项目持续时间长,具有多种模式的许多活动,稀缺的资源以及投资决策。此外,每个大型项目都有要考虑的其他特定特征。由于预计在未来几十年内全球核拆除项目的数量将大大增加,因此我们在本文中将这种类型的大型项目用作应用案例。因此,我们考虑受约束的可再生和不可再生资源的特定特征,多种模式,有无等待条件和没有等待条件的优先关系以及成本最小化的目标。为了在考虑所有相关特征的情况下以最小的成本可靠地进行计划,可以应用调度方法。但是,进行的大量文献回顾并未揭示考虑到核拆除项目特殊性的调度方法。因此,我们介绍了一种称为核拆除项目调度问题。此外,我们开发并实施了有效的元启发式方法,以获取约300个活动的项目的可行时间表。我们用德国三个不同核拆除项目的真实数据测试了我们的方法。平均而言,为我们的样本找到一个初始可行的解决方案只花了不到一秒钟的时间。使用元启发式程序和精确的优化技术(例如混合整数编程和约束编程)可以进一步改善此解决方案。计算研究表明,与标准元启发式算法相比,利用精确的优化技术是有益的。主要结果是开发了初始解决方案查找程序以及具有迭代销毁和重新创建操作的自适应大邻域搜索,该操作与相关问题的最新方法具有竞争力。所描述的问题和发现可以转移到其他大型项目中。

更新日期:2021-04-12
down
wechat
bug