Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Ö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. DOI https://doi.org/10.1016/j.ins.2016.09.010
Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Ö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. DOI https://doi.org/10.1016/j.ins.2016.09.010
Asta, Shahriar and Karapetyan, Daniel and Kheiri, Ahmed and Ö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. DOI https://doi.org/10.1016/j.ins.2016.09.010
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 |
---|---|
Uncontrolled Keywords: | Metaheuristics; Hybrid heuristics; Hyper-heuristics; Monte Carlo tree search; Permutation based local search; Multi-project scheduling |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
Depositing User: | Unnamed user with email elements@essex.ac.uk |
Date Deposited: | 17 Oct 2016 11:25 |
Last Modified: | 30 Oct 2024 20:02 |
URI: | http://repository.essex.ac.uk/id/eprint/17590 |
Available files
Filename: 1511.04387v2.pdf
Licence: Creative Commons: Attribution-Noncommercial-No Derivative Works 3.0