Mathematical programming approach for routing home care nurses

2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008

Volumn , Issue , 2008, Pages 107-111

  Elbenani, Bouazza ^a   Ferland, Jacques A ^b   Gascon, Viviane ^c  

^a MOHAMMED V UNIVERSITY   (Morocco)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITÉ DU QUÉBEC À TROIS RIVIÈRES   (Canada)

Author keywords

Home care nurses; Mathematical programming; Metaheuristics (Tabu); Routing

Indexed keywords

INDUSTRIAL ENGINEERING; MATHEMATICAL PROGRAMMING; NURSING;

HOME CARE NURSES; MEDICAL TREATMENTS; METAHEURISTICS (TABU); NUMERICAL RESULTS; ROUTING; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

VEHICLE ROUTING;

EID: 62749134971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IEEM.2008.4737841     Document Type: Conference Paper

References (8)

1. Bertels S., Fahle T. A Hybrid Setup for a Hybrid Scenario: Combining Heuristics for the Home Health Care Problem. Computers and Operations Research 2006; 33; 2866-2890.
2. Cheng E., Rich J. L A Home Health Care Routing and Scheduling Problem. Technical report CAAM TR-04 1998. Rice University.
3. Elbenani B. Problème de planification des tournées des intervenants pour les visites à domicile, Ph. D. Thesis, DIRO, Université de Montréal 2007.
4. Eveborn P., Flisberg P., Rönnqvist M. Laps Care - an operational system for staff planning of home care. European Journal of Operational Research 2006; 171; 962-976.
5. Glover F., Laguna M., Marti R. Scatter Search. Advances in Evolutionary Computing; Natural Computing Series, Springer 2003; 519-537.
6. Lau H. C., Sim M., Teo K. M. Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles, European Journal of Operational Research 2003; 148; 559-569.
7. Rochat Y., Taillard E. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal if Heuristics 1995; 1; 147-167.
8. Solomon M. M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 1987; 35(2); 254-265.