4 présentations

• 
  10h45 - 11h10

  Measuring the concordance of colon cancer patient pathways using inverse optimization

  • Timothy C.Y. Chan, University of Toronto
  • Yusuf Shalaby, University of Toronto
  • Nasrin Yousefi, prés., University of Toronto

  A sequence of activities that cancer patients should take as they go through the processes of diagnosis and treatment are called clinical pathways. However, many patients deviate from these clinical pathways. We develop a metric to measure the concordance of each patient’s pathway to the clinical pathways using an inverse optimization-based approach.
  Keywords: disease pathway concordance, inverse optimization, inverse network flow
• 
  11h10 - 11h35

  Operating theater weekly planning

  • Thierry Garaix, prés., École Nationale Supérieure des Mines de Saint-Étienne
  • Xiaolan Xie, École des Mines de Saint-Étienne
  • Roberto Bargetto, École des Mines de Saint-Étienne

  In this research we propose a branch-and-cut-and-price algorithm able to solve a weekly operating theater planning problem. Surgeries of different specialties are selected from a waiting list. Operating rooms, surgeons and nurses define resource constraints. Our approach is compared againsIn this research we propose a branch-and-cut-and-price algorithm able to solve a weekly operating theater planning problem. Surgeries of different specialties are selected from a waiting list. Operating rooms, surgeons and nurses define resource constraints. Our approach is compared against state-of-the-art algorithm on 120 surgeries instances.
  keywords: Operating theater planning ; Surgery scheduling ; Branch-and-price
• 
  11h35 - 12h00

  A mathematical model for blood collection planning using bloodmobile facilities and according to the logistic characteristics of blood

  • Elaheh Ghasemi, Polytechnique Montreal
  • Guy Desaulniers, GERAD - Polytechnique Montréal
  • Louis-Martin Rousseau, prés., Polytechnique Montréal

  This study focuses on a real-life problem in the blood supply chain management. We propose a two-step routing model that aims at collecting enough blood units within the processing time limit while minimizing the distance traveled. To evaluate the performance of the proposed model several numerical examples are presented.

  Keywords
  Blood Supply Chain, Vehicle Routing Problem, Processing Time Limit
• 
  12h00 - 12h25

  Fair liver transplant allocation: A scalable optimization model

  • Shubham Akshat, University of Maryland
  • Sommer Gentry, United States Naval Academy
  • S. (Raghu) Raghavan, prés., University of Maryland

  U.S. Department of Health and Human Services is interested in increasing geographic equity in liver transplants. Organ supply to demand ratio is viewed as a good proxy for evaluating access to organs by patients on a waitlist by the transplant community. We assess the current state-of-affairs by comparing the organ supply to demand ratio at each transplant center. We then develop a nonlinear integer programming model that maximizes the minimum supply to demand ratio across all transplant centers. We discuss a variable transformation that enables linearization of this model. Our results indicate that the worst supply/demand ratio across transplant centers is improved upon significantly by our model. Further, the variation in this ratio across transplant centers is significantly reduced.