A hybrid approach for solving multi-mode resource-constrained project scheduling problem in construction
Jerzy Rosłon , Janusz Edward Kulejewski
AbstractPractical problems in construction can be easily qualified as NP-hard (non-deterministic, polynomial-time hard) problems. The time needed for solving these problems grows exponentially with the increase of the problem’s size – this is why mathematical and heuristic methods do not enable finding solutions to complicated construction problems within an acceptable period of time. In the view of many authors, metaheuristic algorithms seem to be the most appropriate measures for scheduling and task sequencing. However even metaheuristic approach does not guarantee finding the optimal solution and algorithms tend to get stuck around local optima of objective functions. This is why authors considered improving the metaheuristic approach by the use of neural networks. In the article, authors analyse possible benefits of using a hybrid approach with the use of metaheuristics and neural networks for solving the multi-mode, resource-constrained, project-scheduling problem (MRCPSP). The suggested approach is described and tested on a model construction project schedule. The results are promising for construction practitioners, the hybrid approach improved results in 87% of tests. Based on the research outcomes, authors suggest future research ideas.
|Journal series||Open Engineering, ISSN , e-ISSN 2391-5439, (0 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||MRCPSP; optimization; construction; scheduling; metaheuristic; neural networks|
|Score|| = 0.0, 17-04-2019, ArticleFromJournal|
= 0.0, 17-04-2019, ArticleFromJournal
|Publication indicators||= 0; = 0|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.