Artificial Bee Colony to solve seafaring staff scheduling problem: A real case

Abstract

Personnel scheduling problem is a combinatorial optimization problem which belongs to NP-hard set of problems. In this paper, we propose to solve a seafaring staff scheduling problem through the use of the Artificial Bee Colony method. The central aim of this work is to offer a productive way in order to release a benchmarking between the results produced by the artificial Bee Colony method and those obtained by the traditionally applied method. The results show that this method outperforms the traditional one. Besides, this algorithm enables us to give the maximum of coverage with a less computational time.