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

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.

[1]  Peter I. Cowling,et al.  The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling , 2006, EvoCOP.

[2]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[3]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[4]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[5]  Peter I. Cowling,et al.  Evolution of Fitness Functions to Improve Heuristic Performance , 2008, LION.

[6]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.

[7]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[8]  Charles Mbohwa,et al.  Home Healthcare Worker Scheduling: A Group Genetic Algorithm Approach , 2013 .

[9]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[10]  Dario Landa Silva,et al.  Workforce scheduling and routing problems: literature survey and computational study , 2014, Annals of Operations Research.

[11]  Dario Landa Silva,et al.  Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem , 2015, ICORES.

[12]  Ketan Kotecha,et al.  Genetic Algorithm for Airline Crew Scheduling Problem Using Cost-Based Uniform Crossover , 2004, AACC.

[13]  Mike Wright,et al.  Using particle swarm optimization to determine visit times in community nurse timetabling , 2008 .

[14]  Volker Nissen,et al.  A Comparison of Neighbourhood Topologies for Staff Scheduling with Particle Swarm Optimisation , 2009, KI.

[15]  Ling Wang,et al.  An Effective Hybrid Heuristic for Flow Shop Scheduling , 2003 .

[16]  Vincent A. Cicirello,et al.  Profiling the Distance Characteristics of Mutation Operators for Permutation-Based Genetic Algorithms , 2013, FLAIRS Conference.

[17]  Pisal Yenradee,et al.  PSO-based algorithm for home care worker scheduling in the UK , 2007, Comput. Ind. Eng..

[18]  Rong Qu,et al.  A Greedy Heuristic for Workforce Scheduling and Routing With Time-dependent Activities Constraints , 2015, ICORES.

[19]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .