Evolutionary computing in personnel rostering in Vienna
Evolutionary computing in personnel rostering on the 13th European Conference on Evolutionary Computation in Combinatorial Optimisation (Vienna, Austria)
EvoCOP is a multidisciplinary conference that brings together researchers working on metaheuristics that are used to solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics include: evolutionary algorithms, simulated annealing, tabu search, scatter search and path relinking, memetic algorithms, ant colony and bee colony optimization, particle swarm optimization, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and hyperheuristics. Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, travelling salesman, graph problems, satisfiability, energy optimization problems, packing problems, planning problems, and general mixed integer programming.
Today, Friday, April 5, 2013, we will present the paper "An artificial immune system based approach for solving the nurse rerostering problem" written bij Broos Maenhout and Mario Vanhoucke.
Abstract: Personnel resources can introduce uncertainty in the operational processes. Constructed personnel rosters can be disrupted and render infeasible rosters. Feasibility has to be restored by adapting the original announced personnel rosters. In this paper, an Artificial Immune System for the nurse re-rostering problem is presented. The proposed algorithm uses problem-specific and even roster-specific mechanisms which are inspired on the vertebrate immune system. We observe the performance of the different algorithmic components and compare the proposed procedure with the existing literature.
Download the presentation here.