Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem

A hyper-heuristic performs search over a set of other search mechanisms. During the search, it does not require any problem-dependent data. This structure makes hyper-heuristics problem-independent indirect search mechanisms. In this study, we propose a learning strategy to explore elite heuristic subsets for different phases of a search. For that purpose, we apply a number of hyper-heuristics with the proposed approach to a set of home care scheduling problem instances. The results show that the learning strategy increases the performance of the different hyper-heuristics by excluding some heuristics from the heuristic set over the tested problem instances.

[1]  Graham Kendall,et al.  Evolving Bin Packing Heuristics with Genetic Programming , 2006, PPSN.

[2]  Sanja Petrovic,et al.  Case-based heuristic selection for timetabling problems , 2006, J. Sched..

[3]  Graham Kendall,et al.  A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology , 2004, PATAT.

[4]  Jesper Larsen,et al.  The Home Care Crew Scheduling Problem , 2008 .

[5]  Edmund K. Burke,et al.  Examination timetabling using late acceptance hyper-heuristics , 2009, 2009 IEEE Congress on Evolutionary Computation.

[6]  Torsten Fahle,et al.  A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem , 2006, Comput. Oper. Res..

[7]  Alexander Nareyek,et al.  Choosing search heuristics by non-stationary reinforcement learning , 2004 .

[8]  Mikael Rönnqvist,et al.  Operations Research Improves Quality and Efficiency in Home Care , 2009, Interfaces.

[9]  A. Matta,et al.  A Home Care Scheduling Model For Human Resources , 2006, 2006 International Conference on Service Systems and Service Management.

[10]  Graham Kendall,et al.  An Investigation of a Tabu-Search-Based Hyper-Heuristic for Examination Timetabling , 2005 .

[11]  Alex S. Fukunaga,et al.  Automated Discovery of Local Search Heuristics for Satisfiability Testing , 2008, Evolutionary Computation.

[12]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[13]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[14]  G. Kendall,et al.  Channel assignment optimisation using a hyper-heuristic , 2004, IEEE Conference on Cybernetics and Intelligent Systems, 2004..

[15]  Peter I. Cowling,et al.  Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework , 2005, EvoCOP.

[16]  Patrick De Causmaecker,et al.  A Hyper-heuristic Approach to the Home Care Scheduling Problem , 2009 .

[17]  Jennifer Lynn Rich,et al.  A Home Health Care Routing and Scheduling Problem , 1998 .

[18]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[19]  G. Dueck.  New optimization heuristics , 1993 .

[20]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, 23rd ACM/IEEE Design Automation Conference.

[21]  Mikael Rönnqvist,et al.  Laps Care - an operational system for staff planning of home care , 2006, Eur. J. Oper. Res..

[22]  Bruce L. Golden,et al.  A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

[23]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[24]  Matthew Hyde Ender,et al.  Multilevel Search for Evolving the Acceptance Criteria of a Hyper-Heuristic , 2009 .

[25]  David M. Miller,et al.  An Integrated Spatial DSS for Scheduling and Routing Home-Health-Care Nurses , 1997 .

[26]  Sartaj Sahni,et al.  Simulated Annealing and Combinatorial Optimization , 1986, DAC 1986.

[27]  Ender Özcan,et al.  A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..

[28]  Stefan Nickel,et al.  Planning for home health care services , 2009 .

[29]  Riccardo Poli,et al.  Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework , 2007, Artificial Evolution.

[30]  Katja Verbeeck,et al.  A New Learning Hyper-heuristic for the Traveling Tournament Problem , 2009 .

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

[32]  Edmund K. Burke,et al.  A self-organising hyper-heuristic framework , 2009 .

[33]  Olli Bräysy,et al.  The potential of optimization in communal routing problems: case studies from Finland , 2009 .

[34]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[35]  Edmund K. Burke,et al.  An ant algorithm hyperheuristic for the project presentation scheduling problem , 2005, 2005 IEEE Congress on Evolutionary Computation.

[36]  Graham Kendall,et al.  A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine , 2003 .

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

[38]  Yves Dallery,et al.  Exploring new operational research opportunities within the Home Care context: the chemotherapy at home , 2009, Health care management science.

[39]  Ender Özcan,et al.  A self-organising hyper-heuristic framework , 2009 .

[40]  Graham Kendall,et al.  An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[41]  Graham Kendall,et al.  Channel assignment in cellular communication using a great deluge hyper-heuristic , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[42]  Graham Kendall,et al.  An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic , 2005 .

[43]  Graham Kendall,et al.  An investigation of a tabu assisted hyper-heuristic genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..