Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Li, Kwong Ho, Karunarathne, Wathsala
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2507.18398
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915408232054784
author Li, Kwong Ho
Karunarathne, Wathsala
author_facet Li, Kwong Ho
Karunarathne, Wathsala
contents This paper investigates the application of Reinforcement Learning (RL) to optimise call routing in call centres to minimise client waiting time and staff idle time. Two methods are compared: a model-based approach using Value Iteration (VI) under known system dynamics, and a model-free approach using Proximal Policy Optimisation (PPO) that learns from experience. For the model-based approach, a theoretical model is used, while a simulation model combining Discrete Event Simulation (DES) with the OpenAI Gym environment is developed for model-free learning. Both models frame the problem as a Markov Decision Process (MDP) within a Skills-Based Routing (SBR) framework, with Poisson client arrivals and exponentially distributed service and abandonment times. For policy evaluation, random, VI, and PPO policies are evaluated using the simulation model. After 1,000 test episodes, PPO consistently achives the highest rewards, along with the lowest client waiting time and staff idle time, despite requiring longer training time.
format Preprint
id arxiv_https___arxiv_org_abs_2507_18398
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Optimising Call Centre Operations using Reinforcement Learning: Value Iteration versus Proximal Policy Optimisation
Li, Kwong Ho
Karunarathne, Wathsala
Artificial Intelligence
This paper investigates the application of Reinforcement Learning (RL) to optimise call routing in call centres to minimise client waiting time and staff idle time. Two methods are compared: a model-based approach using Value Iteration (VI) under known system dynamics, and a model-free approach using Proximal Policy Optimisation (PPO) that learns from experience. For the model-based approach, a theoretical model is used, while a simulation model combining Discrete Event Simulation (DES) with the OpenAI Gym environment is developed for model-free learning. Both models frame the problem as a Markov Decision Process (MDP) within a Skills-Based Routing (SBR) framework, with Poisson client arrivals and exponentially distributed service and abandonment times. For policy evaluation, random, VI, and PPO policies are evaluated using the simulation model. After 1,000 test episodes, PPO consistently achives the highest rewards, along with the lowest client waiting time and staff idle time, despite requiring longer training time.
title Optimising Call Centre Operations using Reinforcement Learning: Value Iteration versus Proximal Policy Optimisation
topic Artificial Intelligence
url https://arxiv.org/abs/2507.18398