Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem

Asta, Shahriar, Karapetyan, Daniel, Kheiri, Ahmed ORCID: https://orcid.org/0000-0002-6716-2130, Özcan, Ender and Parkes, Andrew J. 2016. Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Information Sciences 373 , pp. 476-498. 10.1016/j.ins.2016.09.010

Preview

PDF - Accepted Post-Print Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (448kB) | Preview

Abstract

Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem. An important variant of the problem requires scheduling of activities for multiple projects considering availability of local and global resources while respecting a range of constraints. A critical aspect of the benchmarks addressed in this paper is that the primary objective is to minimise the sum of the project completion times, with the usual makespan minimisation as a secondary objective. We observe that this leads to an expected different overall structure of good solutions and discuss the effects this has on the algorithm design. This paper presents a carefully-designed hybrid of Monte-Carlo tree search, novel neighbourhood moves, memetic algorithms, and hyper-heuristic methods. The implementation is also engineered to increase the speed with which iterations are performed, and to exploit the computing power of multicore machines. Empirical evaluation shows that the resulting information-sharing multi-component algorithm significantly outperforms other solvers on a set of “hidden” instances, i.e. instances not available at the algorithm design phase.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Metaheuristics; Hybrid heuristics; Hyper-heuristics; Monte Carlo tree search; Permutation based local search; Multi-project scheduling
Publisher:	Elsevier
ISSN:	0020-0255
Date of First Compliant Deposit:	30 September 2016
Date of Acceptance:	5 September 2016
Last Modified:	11 Nov 2023 03:17
URI:	https://orca.cardiff.ac.uk/id/eprint/94934

Citation Data

Cited 13 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item