Hybrid approaches for rostering: a case study in the integration of constraint programming and local search

Authors:
Raffaele Cipriano;Luca Di Gaspero;Agostino Dovier
Affiliations:
Dip. di Matematica e Informatica;Dip. di Ingegneria Elettrica, Gestionale e Meccanica, Università di Udine, Udine, Italy;Dip. di Matematica e Informatica
Venue:
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Year:
2006

Citing 7
Cited 6

Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
A Constraint Programming Framework for Local Search Methods

Journal of Heuristics
Local search with constraint propagation and conflict-based heuristics

Artificial Intelligence
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
EasyLocal++: an object-oriented framework for the flexible design of local-search algorithms

Software—Practice & Experience
The State of the Art of Nurse Rostering

Journal of Scheduling
Principles of Constraint Programming

Principles of Constraint Programming

Finding good nurse duty schedules: a case study

Journal of Scheduling
Compiling and Executing Declarative Modeling Languages to Gecode

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Hybridization of Constraint Programming and Local Search Techniques: Models and Software Tools

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Scheduling Medical Residents at Boston University School of Medicine

Interfaces
Multi-neighborhood Local Search for the Patient Admission Problem

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Constraint logic programming

A 25-year perspective on logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Different approaches in the hybridization of constraint programming and local search techniques have been recently proposed in the literature. In this paper we investigate two of them, namely the employment of local search to improve a solution found by constraint programming and the exploitation of a constraint model to perform the exploration of the local neighborhood. We apply the two approaches to a real-world personnel rostering problem arising at the department of neurology of the Udine University hospital and we report on computational studies on both real-world and randomly generated structured instances. The results highlight the benefits of the hybridization approach w.r.t. their component algorithms.