Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/21378
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | Hartl, Richard F. | - |
dc.contributor.author | Parragh, Sophie N. | - |
dc.contributor.author | Tricoire, Fabien | - |
dc.date.accessioned | 2016-06-01T12:28:17Z | - |
dc.date.available | 2016-06-01T12:28:17Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | VeRoLog 2015 - 4th Meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization, Vienna, 8-10 June 2015 | - |
dc.identifier.uri | http://hdl.handle.net/1942/21378 | - |
dc.description.abstract | Organizations providing home care services are inclined to optimize their activities in order to meet the constantly increasing demand for home care. In this context, home care providers are confronted with multiple, often conflicting, objectives such as minimizing their operating costs while maximizing the service level offered to their clients by taking into account their preferences. This paper sheds some light on the trade-off relationship between these two objectives by modeling the home care routing and scheduling problem as a bi-objective problem. The proposed model accounts for qualifications, working regulations and overtime costs of the nurses, travel costs depending on the mode of transportation, hard time windows, and client preferences on visit times and nurses. A distinguishing characteristic of the problem is that the scheduling problem for a single route is a bi-objective problem in itself, thereby complicating the problem considerably. A metaheuristic algorithm, embedding a Large Neighborhood Search heuristic in a Multi-Directional Local Search framework, is proposed to the solve the problem. Computational experiments on a set of benchmark instances based on real-life data are presented. A comparison with exact solutions on small instances shows that the algorithm performs well. An analysis of the results reveals that service providers face a considerable trade-off between costs and client convenience. However, starting from a minimum cost solution, the average service level offered to the clients may already be improved drastically with limited additional costs. | - |
dc.language.iso | en | - |
dc.subject.other | vehicle routing and freight transportation; heuristic and metaheuristic solution methods; multi objective problems and methods | - |
dc.title | A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience | - |
dc.type | Conference Material | - |
local.bibliographicCitation.conferencedate | 8-10 June 2015 | - |
local.bibliographicCitation.conferencename | VeRoLog 2015 - 4th Meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization | - |
local.bibliographicCitation.conferenceplace | Vienna | - |
local.bibliographicCitation.jcat | C2 | - |
local.type.refereed | Non-Refereed | - |
local.type.specified | Presentation | - |
item.fullcitation | BRAEKERS, Kris; Hartl, Richard F.; Parragh, Sophie N. & Tricoire, Fabien (2015) A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience. In: VeRoLog 2015 - 4th Meeting of the EURO Working Group on Vehicle Routing and Logistics Optimization, Vienna, 8-10 June 2015. | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | Hartl, Richard F. | - |
item.contributor | Parragh, Sophie N. | - |
item.contributor | Tricoire, Fabien | - |
item.accessRights | Closed Access | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | Research publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.