Optimization Days 2019

HEC Montréal, May 13-15, 2019


HEC Montréal, 13 — 15 May 2019

Schedule Authors My Schedule

MB5 Healthcare Optimization I

May 13, 2019 10:30 AM – 12:10 PM

Location: Hélène-Desmarais

Chaired by Florian Grenouilleau

3 Presentations

  • 10:30 AM - 10:55 AM

    Time-space network formulation for biomedical samples transportation problem

    • Daniel M. Ocampo-Giraldo, presenter, Univerisdad Nacional de Colombia - Sede Medellin
    • Ana María Anaya Arenas, ESG - UQAM
    • Claudio Contardo, ESG UQÀM / GERAD

    We introduce a novel formulation over a time-expanded network for a vehicle routing problem arising in the collection and transportation of biomedical samples. The new model has better numerical properties than a classical three-index model from the literature. We provide computational evidence of the efficiency of the formulation to generate high quality bounds. We also depict a promising dynamic refinement algorithm to exploit the model properties.
    Key words: healthcare logistic; mathematical programming; time-space network

  • 10:55 AM - 11:20 AM

    Integration of user preferences for the home health care routing and scheduling multi-objective problem

    • Laura Musaraganyi, presenter,
    • Simon Germain,
    • Nadia Lahrichi, Polytechnique Montréal
    • Louis-Martin Rousseau, Polytechnique Montréal

    Home Health Care Services provide medical and paramedical services at the patients’ home rather than in a facility (such as a hospital). This means these HHCS need to optimize the schedule of the caregivers to visit all their assigned patients in the most efficient way possible. Each agency employ a number of schedulers whose task is to manually schedule the visits, taking into account multiple criteria. In this paper, we present a heuristic method aimed at finding the best solution according to the user preferences or priorities. Using a hierarchical ordering of the criteria our algorithm returns the best solution found regarding the strict order. In addition, it also suggests a list of near-equivalent solutions based on user tolerance levels. These solutions, Pareto-optimal alternatives to the best hierarchical solution, offer more decision-making power to the user. Finally, the performances of the proposed method are compared to those of the classic weighted sum approach.

  • 11:20 AM - 11:45 AM

    A decomposition method for the dynamic home health care routing and scheduling

    • Florian Grenouilleau, presenter, CIRRELT
    • Louis-Martin Rousseau, Polytechnique Montréal
    • Nadia Lahrichi, Polytechnique Montréal

    Due to the aging of the population, the demand in home health care services have
    greatly increased during the past decade. In order to manage this demand, an
    improvement of the resources utilization is necessary. In this work, we are
    interested in the dynamic home health care routing and scheduling problem. The
    objective here is to develop a decomposition method based on scenarios in order
    to dynamically accept and schedule new patients in the system while conserving a
    high quality of service for existing patients.