Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search | Zendy

Raffaele Cipriano | Zendy; Luca Di Gaspero | Zendy; Agostino Dovier | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hybrid Approaches for Rostering: A Case Study in the Integration of Constraint Programming and Local Search

Author(s) -

Raffaele Cipriano,

Luca Di Gaspero,

Agostino Dovier

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-46384-4

DOI - 10.1007/11890584_9

Subject(s) - constraint programming , computer science , constraint (computer aided design) , local search (optimization) , constraint logic programming , hybrid algorithm (constraint satisfaction) , component (thermodynamics) , mathematical optimization , constraint satisfaction problem , constraint satisfaction , artificial intelligence , theoretical computer science , mathematics , physics , geometry , probabilistic logic , stochastic programming , thermodynamics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research