IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02312395.html
   My bibliography  Save this paper

Optimizing Treatment Combination for Lymphoma Using an Optimization Heuristic

Author

Listed:
  • Nicolas Houy

    (EM - EMLyon Business School)

  • François Le Grand

Abstract

Background. The standard treatment for high-grade non-Hodgkin lymphoma involves the combination of chemotherapy and immunotherapy. We characterize in-silico the optimal combination protocol that maximizes the overall survival probability. We rely on a pharmacokinetics/pharmacodynamics (PK/PD) model that describes the joint evolution of tumor and effector cells, as well as the effects of both chemotherapy and immunotherapy. The toxicity is taken into account through ad-hoc constraints. We develop an optimization algorithm that belongs to the class of Monte-Carlo tree search algorithms. Our simulations rely on an in-silico population of heterogeneous patients differing with respect to their PK/PD parameters. The optimization objective consists in characterizing the combination protocol that maximizes the overall survival probability of the patient population under consideration. Results. We compare using in-silico experiments our results to standard protocols and observe a gain in overall survival probabilities that vary from 4 to 9 percentage points. The gains increase with the complexity of the potential protocol. Gains are larger in presence of a higher number of injections or of an actual combination with immunotherapy. Conclusions. In in-silico experiments, optimal protocols achieve significant gains over standard protocols when considering overall survival probabilities. Our optimization algorithm enables us to efficiently tackle this numerical problem with a large dimensionality. The in-vivo implications of our in-silico results remain to be explored.

Suggested Citation

  • Nicolas Houy & François Le Grand, 2019. "Optimizing Treatment Combination for Lymphoma Using an Optimization Heuristic," Post-Print hal-02312395, HAL.
    • Handle: RePEc:hal:journl:hal-02312395
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-02312395. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.