Hybrid heuristics for multimodal homecare scheduling

  • Authors:

  • Andrea Rendl;Matthias Prandtstetter;Gerhard Hiermann;Jakob Puchinger;Günther Raidl

  • Affiliations:

  • Mobility Department, Dynamic Transportation Systems, AIT Austrian Institute of Technology, Austria;Mobility Department, Dynamic Transportation Systems, AIT Austrian Institute of Technology, Austria;Vienna University of Technology, Austria;Mobility Department, Dynamic Transportation Systems, AIT Austrian Institute of Technology, Austria;Vienna University of Technology, Austria

  • Venue:
  • CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We focus on hybrid solution methods for a large-scale real-world multimodal homecare scheduling (MHS) problem, where the objective is to find an optimal roster for nurses who travel in tours from patient to patient, using different modes of transport. In a first step, we generate a valid initial solution using Constraint Programming (CP). In a second step, we improve the solution using one of the following metaheuristic approaches: (1) variable neighborhood descent, (2) variable neighborhood search, (3) an evolutionary algorithm, (4) scatter search and (5) a simulated annealing hyper heuristic. Our evaluation, based on computational experiments, demonstrates how hybrid approaches are particularly strong in finding promising solutions for large real-world MHS problem instances.