Hybrid Ant Colony Optimization Algorithm for Workforce Planning

Every organization and factory optimize their production process with a help of workforce planing. The aim is minimization of the assignment costs of the workers, who will do the jobs. The problem is very complex and needs exponential number of calculations, therefore special algorithms are developed to be solved. The problem is to select employers and to assign them to the jobs to be performed. This problem has very strong constraints and it is difficult to find feasible solutions. The objective is to fulfil the requirements and to minimize the assignment cost. We propose a hybrid Ant Colony Optimization (ACO) algorithm to solve the workforce problem, which is a combination between ACO and an appropriate local search procedure.