Abstract
AbstractScheduling 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.
Funder
Karlsruher Institut für Technologie (KIT)
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference46 articles.
1. Afshar, M. R., Shahhosseini, V., & Sebt, M. H. (2019). A genetic algorithm with a new local search method for solving the multimode resource-constrained project scheduling problem. International Journal of Construction Management, pp. 1–9
2. Alba, E., & Chicano, J. F. (2007). Software project management with GAs. Information Sciences, 177(11), 2380–2401.
3. Bartels, J. -H. (2009). Anwendung von Methoden der ressourcenbeschränkten Projektplanung mit multiplen Ausführungsmodi in der betriebswirtschaftlichen Praxis: Rückbauplanung für Kernkraftwerke und Versuchsträgerplanung in Automobilentwicklungsprojekten (Application of methods of resource-constrained project scheduling with multiple execution modes in the business-management practice: Dismantling planning for nuclear power plants and experimental vehicle planning in automotive development projects). Gabler Edition Wissenschaft : Produktion und Logistik. Gabler, Wiesbaden.
4. Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T. (2010). F-race and iterated f-race: An overview. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, & M. Preuss (Eds.), Experimental Methods for the Analysis of Optimization Algorithms (pp. 311–336). Berlin: Springer. 978-3-642-02537-2.
5. Brusa, L., DeSantis, R., Nurden, P. L., Walkden, P., Watson, B. (2002). The decommissioning of the trino nuclear power plant, URL https://www.osti.gov/servlets/purl/829556-bgfnku/native/. Waste Management 2002 Symposium, Tucson, AZ (US), 02/24/2002–02/28/2002.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献