Explaining A Staff Rostering Problem By Mining Trajectory Variance Structures

Citation

Fyvie M, McCall JAW, Christie LA, Zavoianu A, Brownlee AEI & Ainslie R (2023) Explaining A Staff Rostering Problem By Mining Trajectory Variance Structures. In: TBC. Lecture Notes in Artificial Intelligence. AI-2023 Forty-third SGAI International Conference on Artificial Intelligence, Cambridge, 12.12.2023-14.12.2023. Cham, Switzerland: Springer.

Abstract
The use of Artificial Intelligence-driven solutions in domains involving end-user interaction and cooperation has been continually growing. This has also lead to an increasing need to communicate crucial information to end-users about algorithm behaviour and the quality of solutions. In this paper, we apply our method of search trajectory mining through decomposition to the solutions created by a Genetic Algorithm-a non-deterministic, population-based metaheuristic. We complement this method with the use of One-Way ANOVA statistical testing to help identify explanatory features found in the search trajectories-subsets of the set of optimization variables having both high and low influence on the search behaviour of the GA and solution quality. This allows us to highlight these to an end-user to allow for greater flexibility in solution selection. We demonstrate the techniques on a real-world staff rostering problem and show how, together, they identify the personnel who are critical to the optimality of the rosters being created.

Keywords
Evolutionary Algorithms; PCA; Explainability; Population Diversity

Notes
Output Status: Forthcoming

People

Dr Sandy Brownlee

Senior Lecturer in Computing Science, Computing Science and Mathematics - Division