Citation
Home health care problem: An extended multiple Traveling Salesman Problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 85-92, 2009.
Paper
Abstract
This paper deals with the routing problem of health care staff in a home health care problem. Given a list of patients needing several cares, the problem is to assign cares to care workers. Some cares have to be performed by several persons and some cares cannot be performed with others. If a patient needs several cares, he may want to be treated by the same person. Moreover, some skills constraints and time windows have to be satisfied. We show that this problem is equivalent to a multiple traveling salesman problem with time windows (mTSPWT) with some specific constraints. For solving this problem, we propose an integer linear program with some technical improvements.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-085-092-P, author = {Y. Kergosien and C. Lente and J-C. Billaut},
title = {Home health care problem: An extended multiple Traveling Salesman Problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {85--92},
note = {Paper},
abstract = {This paper deals with the routing problem of health care staff in a home health care problem. Given a list of patients needing several cares, the problem is to assign cares to care workers. Some cares have to be performed by several persons and some cares cannot be performed with others. If a patient needs several cares, he may want to be treated by the same person. Moreover, some skills constraints and time windows have to be satisfied. We show that this problem is equivalent to a multiple traveling salesman problem with time windows (mTSPWT) with some specific constraints. For solving this problem, we propose an integer linear program with some technical improvements.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-085-092-P.pdf} }