Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem

Haneen Algethami, Dario Landa-Silva, Anna Martínez-Gavara

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.

References

  1. Aickelin, U. and Dowsland, K. A. (2004). An indirect genetic algorithm for a nurse-scheduling problem. Computers & Operations Research, 31(5):761 - 778.
  2. Algethami, H. and Landa-Silva, D. (2015). A study of genetic operators for the workforce scheduling and routing problem. In 11th Metaheuristics International Conference (MIC 2015), pages 1-11.
  3. Algethami, H., Pinheiro, R. L., and Landa-Silva, D. (2016). A genetic algorithm for a workforce scheduling and routing problem. In 2016 IEEE Congress on Evolutionary Computation (CEC), pages 927-934.
  4. Castillo-Salazar, J. A., Landa-Silva, D., and Qu, R. (2016). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research, 239(1):39-67.
  5. Chang, Y. and Chen, L. (2007). Solve the vehicle routing problem with time windows via a genetic algorithm. Discrete and continuous dynamical systems supplement, pages 240-249.
  6. Cicirello, V. A. and Cernera, R. (2013). Profiling the distance characteristics of mutation operators for permutation-based genetic algorithms. In BoonthumDenecke, C. and Youngblood, G. M., editors, FLAIRS Conference, Florida. AAAI Press.
  7. Cowling, P., Colledge, N., Dahal, K., and Remde, S. (2006). The trade-off between diversity and quality for multiobjective workforce scheduling. In Proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP'06, pages 13-24. Springer-Verlag.
  8. Eshelman, L. J. (1991). The CHC adaptive search algorithm : How to have safe search when engaging in nontraditional genetic recombination. Foundations of Genetic Algorithms, pages 265-283.
  9. Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics (NRL), 45(7):733-750.
  10. Kotecha, K., Sanghani, G., and Gambhava, N. (2004). Genetic algorithm for airline crew scheduling problem using cost-based uniform crossover. In Manandhar, S., Austin, J., Desai, U. B., Oyanagi, Y., and Talukder, A. K., editors, AACC, volume 3285 of Lecture Notes in Computer Science, pages 84-91, Kathmandu, Nepal. Springer.
  11. Laesanklang, W. and Landa-Silva, D. (2016). Decomposition techniques with mixed integer programming and heuristics for home healthcare planning. Annals of Operations Research, pages 1-35.
  12. Lenstra, J. K. and Kan, A. H. G. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2):221-227.
  13. Mankowska, D., Meisel, F., and Bierwirth, C. (2014). The home health care routing and scheduling problem with interdependent services. Health Care Management Science, 17(1):15-30.
  14. Misir, M., Smet, P., and Vanden Berghe, G. (2015). An analysis of generalised heuristics for vehicle routing and personnel rostering problems. Journal of the Operational Research Society, 66(5):858-870.
  15. Mitchell, M. (1998). An Introduction to Genetic Algorithms. The MIT Press, Cambridge, MA, USA.
  16. Mutingi, M. and Mbohwa, C. (2014). Health-care staff scheduling in a fuzzy environment: A fuzzy genetic algorithm approach. In Conference Proceedings (DFC Quality and Operations Management). International Conference on Industrial Engineering and Operations Management.
  17. Oliver, I. M., Smith, D. J., and Holland, J. R. C. (1987). A study of permutation crossover operators on the travelling salesman problem. In Proceedings of the Second International Conference on Genetic Algorithms and their application, pages 224-230, Hillsdale, NJ, USA. L. Erlbaum Associates Inc.
  18. Pinheiro, R. L., Landa-Silva, D., and Atkin, J. (2016). A variable neighbourhood search for the workforce scheduling and routing problem. In Advances in Nature and Biologically Inspired Computing, pages 247- 259. Springer, Pietermaritzburg, South Africa.
  19. Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12):1985 - 2002.
  20. Rothlauf, F. (2003). Representations for genetic and evolutionary algorithms. Studies in Fuzziness and Soft Computing, 104:9-32.
  21. Toth, P. and Vigo, D. (2014). The vehicle routing problem, volume 18. Siam.
  22. Vavak, F. and Fogarty, T. C. (1996). Comparison of steady state and generational genetic algorithms for use in nonstationary environments. In Evolutionary Computation, 1996., Proceedings of IEEE International Conference on, pages 192-195. IEEE.
  23. Zheng, D.-Z. and Wang, L. (2003). An effective hybrid heuristic for flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 21(1):38-44.
  24. Zhu, K. Q. (2000). A new genetic algorithm for VRPTW. In Proceedings of the International Conference on Artificial Intelligence. Citeseer.
Download


Paper Citation


in Harvard Style

Algethami H., Landa-Silva D. and Martínez-Gavara A. (2017). Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem . In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 416-423. DOI: 10.5220/0006203304160423


in Bibtex Style

@conference{icores17,
author={Haneen Algethami and Dario Landa-Silva and Anna Martínez-Gavara},
title={Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={416-423},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006203304160423},
isbn={978-989-758-218-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Selecting Genetic Operators to Maximise Preference Satisfaction in a Workforce Scheduling and Routing Problem
SN - 978-989-758-218-9
AU - Algethami H.
AU - Landa-Silva D.
AU - Martínez-Gavara A.
PY - 2017
SP - 416
EP - 423
DO - 10.5220/0006203304160423