Research Repository

See what's under the surface

A study of genetic operators for the Workforce Scheduling and Routing Problem

Algethami, Haneen; Landa-Silva, Dario

Authors

Haneen Algethami

Abstract

The Workforce Scheduling and Routing Problem (WSRP) is concerned with planning visits of qualified workers to different locations to perform a set of tasks, while satisfying each task time-window plus additional requirements such as customer/workers preferences. This type of mobile workforce scheduling problem arises in many real-world operational scenarios. We investigate a set of genetic operators including problem-specific and well-known generic operators used in related problems. The aim is to conduct an in-depth analysis on their performance on this very constrained scheduling problem. In particular, we want to identify genetic operators that could help to minimise the violation of customer/workers preferences. We also develop two cost-based genetic operators tailored to the WSRP. A Steady State Genetic Algorithm (SSGA) is used in the study and experiments are conducted on a set of problem instances from a real-world Home Health Care scenario (HHC). The experimental analysis allows us to better understand how we can more effectively employ genetic operators to tackle WSRPs.

Publication Date Jun 10, 2015
Peer Reviewed Peer Reviewed
Institution Citation Algethami, H., & Landa-Silva, D. (2015). A study of genetic operators for the Workforce Scheduling and Routing Problem
Keywords Personnel Scheduling, Genetic Operators, Evolutionary Algorithms
Related Public URLs http://www.lifl.fr/MIC2015/index.html
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

dls_mic2015_published.pdf (231 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf




You might also like


Downloadable Citations