Paper Info
Title
Selecting Genetic Operators To Maximise Preference Satisfaction In A Workforce Scheduling And Routing Problem
Abstract
The Workforce Scheduling and Routing Problem (WSRP) is a combinatorial optimisation problem that involves scheduling and routing of workforce. Tackling this type of problem often requires handling a considerable number of requirements, including customers and workers preferences while minimising both operational costs and travelling distance. This study seeks to determine effective combinations of genetic operators combined with heuristics that help to find good solutions for this constrained combinatorial optimisation problem. In particular, it aims to identify the best set of operators that help to maximise customers and workers preferences satisfaction. This paper advances the understanding of how to effectively employ different operators within two variants of genetic algorithms to tackle WSRPs. To tackle infeasibility, an initialisation heuristic is used to generate a conflict-free initial plan and a repair heuristic is used to ensure the satisfaction of constraints. Experiments are conducted using three sets of real-world Home Health Care (HHC) planning problem instances.
Year
DOI
Venue
2017
10.5220/0006203304160423
PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES)
Keywords
Field
DocType
Genetic Operators, Constraints Satisfaction, Scheduling and Routing Problem, Home Health Care
Health care,Workforce scheduling,Heuristic,Mathematical optimization,Workforce,Computer science,Scheduling (computing),Heuristics,Operator (computer programming),Operations management,Genetic algorithm
Conference
Citations 
PageRank 
References 
1
0.35
3
Authors
3
Name
Order
Citations
PageRank
Haneen Algethami110.35
Dario Landa Silva231628.38
anna martinezgavara3162.77