Aktivität: Vortrag ohne Tagungsband / Vorlesung › Präsentation auf einer wissenschaftlichen Konferenz / Workshop
Beschreibung
Abstract. In this work we consider solving a large-scale real-world mul- timodal homecare scheduling problem (MHS), where the objective is to find a roster for homecare nurses that travel from patient to patient in a tour, using different modes of transport, respecting a set of side con- straints, and maximising customer, nurse and employer satisfaction. We tackle the problem using a metaheuristical approach, where in a first step, we generate a valid initial solution using Constraint Programming (CP) and in a second step we use different metaheuristics to improve the solution. We present a novel and efficient CP-model for the MHS and in- troduce an effective clustering technique to decompose the problem into simpler subproblems by which valid initial solutions can be generated in very little time. Our experimental results show how the metaheuristics´performance is considerably improved by using valid initial solutions and produce useful rosters for the MHS Problem.
Zeitraum
16 Juli 2012 → 20 Juli 2012
Ereignistitel
Operational Research Peripatetic Postgraduate Program (ORP3)