A hybrid approach for solving multi-mode resource-constrained project scheduling problem in construction

Abstract

Practical 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.

Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses

“…ese systems have long response times and even deadlocks when the amount of input and the constraints developed to reach a certain amount, so these scheduling systems mentioned above are less adaptable, and the usual situation is to first perform automatic scheduling and then make manual adjustments to the unreasonable parts of the results, and the manual adjustment is not less than the workload of rearranging all the courses. So according to this view, these scheduling systems do not thoroughly help the scheduling staff if the amount of scheduling data is very large 2 Complexity [12]. As mentioned earlier, many researchers have already laid the research foundation for the scheduling problem, and through their extensive research on the scheduling problem, several heuristic algorithms have been used to solve the scheduling problem in recent years [13].…”

Profit optimization for multi-mode repetitive construction project with cash flows using metaheuristics

“…Generalized RCPS/MRCPS problem is obtained by replacing the makespan minimization with other agentsany regular measure of performance: different types of tradeoffs, objective functions, constraints, and conditions, e.g., total cost [10], NPV [11], quality [12], deviations from average employment level [13], total project delay [14], monthly cash demand [15], cost minimization in regard to the baseplan [16], and schedule robustness [17]. Such problems can be referred to as the Generalized Resource-Constrained Project Scheduling Problem (GRCPSP) [9].…”

“…The same case has been optimized in terms of time, cost and quality, by Xu and Feng, with the use of hybrid algorithm [27]. Kulejewski and Rosłon reinforced the tabu search algorithm with artificial neural networks (ANN) to minimize the maximum monthly cash demand of apartment building construction [15]. Hegazy with other contributors minimized the total cost of multi-site [28] and repetitive projects [29].…”

Schedules Optimization with the Use of Value Engineering and NPV Maximization

“…From the contractor's point of view [34,35], the high level of customer satisfaction has a positive effect on winning new contracts, and significantly reduces the likelihood of being involved in harmful disputes and court hearings, and incurring additional costs. If the investor decides to implement the project on his own, it is in his own interest to meet the requirements.…”