A hybrid scatter search/electromagnetism meta-heuristic for project scheduling |
| |
Institution: | 1. School of Computer Science and Engineering, Southeast University, Nanjing 211189, China;2. Key Laboratory of Computer Network and Information Integration, Ministry of Education, Nanjing 211189, China;3. Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Ciudad Politécnica de la Innovación, Edifico 8G, Acc. B. Universitat Politècnica de València, Camino de Vera s/n, València 46021, Spain;1. Department of Industrial Engineering, South Tehran Branch, Islamic Azad University, Tehran, Iran;2. Department of Industrial Engineering, Faculty of Engineering, Shahed University, Tehran, Iran |
| |
Abstract: | In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-optimal heuristic solutions for relatively large instances. The procedure combines elements from scatter search, a generic population-based evolutionary search method, and from a recently introduced heuristic method for the optimisation of unconstrained continuous functions based on an analogy with electromagnetism theory. We present computational experiments on standard benchmark datasets, compare the results with current state-of-the-art heuristics, and show that the procedure is capable of producing consistently good results for challenging instances of the resource-constrained project scheduling problem. We also demonstrate that the algorithm outperforms state-of-the-art existing heuristics. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|