IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v23y2020i7p285-294.html
   My bibliography  Save this article

Optimizing neotissue growth inside perfusion bioreactors with respect to culture and labor cost: a multi-objective optimization study using evolutionary algorithms

Author

Listed:
  • Mohammad Mehrian
  • Liesbet Geris

Abstract

Tissue engineering is a fast progressing domain where solutions are provided for organ failure or tissue damage. In this domain, computer models can facilitate the design of optimal production process conditions leading to robust and economically viable products. In this study, we use a previously published computationally efficient model, describing the neotissue growth (cells + their extracellular matrix) inside 3D scaffolds in a perfusion bioreactor. In order to find the most cost-effective medium refreshment strategy for the bioreactor culture, a multi-objective optimization strategy was developed aimed at maximizing the neotissue growth while minimizing the total cost of the experiment. Four evolutionary optimization algorithms (NSGAII, MOPSO, MOEA/D and GDEIII) were applied to the problem and the Pareto frontier was computed in all methods. All algorithms led to a similar outcome, albeit with different convergence speeds. The simulation results indicated that, given the actual cost of the labor compared to the medium cost, the most cost-efficient way of refreshing the medium was obtained by minimizing the refreshment frequency and maximizing the refreshment amount.

Suggested Citation

  • Mohammad Mehrian & Liesbet Geris, 2020. "Optimizing neotissue growth inside perfusion bioreactors with respect to culture and labor cost: a multi-objective optimization study using evolutionary algorithms," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 23(7), pages 285-294, May.
  • Handle: RePEc:taf:gcmbxx:v:23:y:2020:i:7:p:285-294
    DOI: 10.1080/10255842.2020.1719081
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10255842.2020.1719081
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/10255842.2020.1719081?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:gcmbxx:v:23:y:2020:i:7:p:285-294. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gcmb .

    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.