A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities

We present a tabu search-based hyper-heuristic algorithm for solving construction resource leveling problems, i.e. resource leveling under resource constraints with the prescribed maximum project duration to be equal or greater than the initial/minimum duration, as well as the related resource availability cost problem. The algorithm operates within a commercial project management software package by altering the priorities assigned to activities. The hyper-heuristic controls a set of low-level heuristics, which modify the priorities of selected activities by performing simple moves such as “replace” and “swap”. The most promising heuristics according to their efficiency are applied first, and a tabu list is used to prohibit heuristics with recently poor performance from being applied too soon. The application of the algorithm in three project cases showed that the proposed procedure is promising for handling resource optimization problems.

► Hyperheuristics recently introduced to treat construction project scheduling problems.
► THH is the first tabu hyperheuristic applied to construction scheduling problems.
► THH is a flexible procedure that easily can be applied to different problems.
► Application of the algorithm proved it as promising for treating leveling problems.