Cargando…

A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology

BACKGROUND: We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested in applying this framework to the reverse engineering problem in computational systems biolo...

Descripción completa

Detalles Bibliográficos
Autores principales: Penas, David R., Henriques, David, González, Patricia, Doallo, Ramón, Saez-Rodriguez, Julio, Banga, Julio R.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5557587/
https://www.ncbi.nlm.nih.gov/pubmed/28813442
http://dx.doi.org/10.1371/journal.pone.0182186
_version_ 1783257237451440128
author Penas, David R.
Henriques, David
González, Patricia
Doallo, Ramón
Saez-Rodriguez, Julio
Banga, Julio R.
author_facet Penas, David R.
Henriques, David
González, Patricia
Doallo, Ramón
Saez-Rodriguez, Julio
Banga, Julio R.
author_sort Penas, David R.
collection PubMed
description BACKGROUND: We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested in applying this framework to the reverse engineering problem in computational systems biology, which yields very large mixed-integer dynamic optimization (MIDO) problems. In particular, we consider the framework of logic-based ordinary differential equations (ODEs). METHODS: We present saCeSS2, a parallel method for the solution of this class of problems. This method is based on an parallel cooperative scatter search metaheuristic, with new mechanisms of self-adaptation and specific extensions to handle large mixed-integer problems. We have paid special attention to the avoidance of convergence stagnation using adaptive cooperation strategies tailored to this class of problems. RESULTS: We illustrate its performance with a set of three very challenging case studies from the domain of dynamic modelling of cell signaling. The simpler case study considers a synthetic signaling pathway and has 84 continuous and 34 binary decision variables. A second case study considers the dynamic modeling of signaling in liver cancer using high-throughput data, and has 135 continuous and 109 binaries decision variables. The third case study is an extremely difficult problem related with breast cancer, involving 690 continuous and 138 binary decision variables. We report computational results obtained in different infrastructures, including a local cluster, a large supercomputer and a public cloud platform. Interestingly, the results show how the cooperation of individual parallel searches modifies the systemic properties of the sequential algorithm, achieving superlinear speedups compared to an individual search (e.g. speedups of 15 with 10 cores), and significantly improving (above a 60%) the performance with respect to a non-cooperative parallel scheme. The scalability of the method is also good (tests were performed using up to 300 cores). CONCLUSIONS: These results demonstrate that saCeSS2 can be used to successfully reverse engineer large dynamic models of complex biological pathways. Further, these results open up new possibilities for other MIDO-based large-scale applications in the life sciences such as metabolic engineering, synthetic biology, drug scheduling.
format Online
Article
Text
id pubmed-5557587
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-55575872017-08-25 A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology Penas, David R. Henriques, David González, Patricia Doallo, Ramón Saez-Rodriguez, Julio Banga, Julio R. PLoS One Research Article BACKGROUND: We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested in applying this framework to the reverse engineering problem in computational systems biology, which yields very large mixed-integer dynamic optimization (MIDO) problems. In particular, we consider the framework of logic-based ordinary differential equations (ODEs). METHODS: We present saCeSS2, a parallel method for the solution of this class of problems. This method is based on an parallel cooperative scatter search metaheuristic, with new mechanisms of self-adaptation and specific extensions to handle large mixed-integer problems. We have paid special attention to the avoidance of convergence stagnation using adaptive cooperation strategies tailored to this class of problems. RESULTS: We illustrate its performance with a set of three very challenging case studies from the domain of dynamic modelling of cell signaling. The simpler case study considers a synthetic signaling pathway and has 84 continuous and 34 binary decision variables. A second case study considers the dynamic modeling of signaling in liver cancer using high-throughput data, and has 135 continuous and 109 binaries decision variables. The third case study is an extremely difficult problem related with breast cancer, involving 690 continuous and 138 binary decision variables. We report computational results obtained in different infrastructures, including a local cluster, a large supercomputer and a public cloud platform. Interestingly, the results show how the cooperation of individual parallel searches modifies the systemic properties of the sequential algorithm, achieving superlinear speedups compared to an individual search (e.g. speedups of 15 with 10 cores), and significantly improving (above a 60%) the performance with respect to a non-cooperative parallel scheme. The scalability of the method is also good (tests were performed using up to 300 cores). CONCLUSIONS: These results demonstrate that saCeSS2 can be used to successfully reverse engineer large dynamic models of complex biological pathways. Further, these results open up new possibilities for other MIDO-based large-scale applications in the life sciences such as metabolic engineering, synthetic biology, drug scheduling. Public Library of Science 2017-08-15 /pmc/articles/PMC5557587/ /pubmed/28813442 http://dx.doi.org/10.1371/journal.pone.0182186 Text en © 2017 Penas et al http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
spellingShingle Research Article
Penas, David R.
Henriques, David
González, Patricia
Doallo, Ramón
Saez-Rodriguez, Julio
Banga, Julio R.
A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title_full A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title_fullStr A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title_full_unstemmed A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title_short A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
title_sort parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5557587/
https://www.ncbi.nlm.nih.gov/pubmed/28813442
http://dx.doi.org/10.1371/journal.pone.0182186
work_keys_str_mv AT penasdavidr aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT henriquesdavid aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT gonzalezpatricia aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT doalloramon aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT saezrodriguezjulio aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT bangajulior aparallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT penasdavidr parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT henriquesdavid parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT gonzalezpatricia parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT doalloramon parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT saezrodriguezjulio parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology
AT bangajulior parallelmetaheuristicforlargemixedintegerdynamicoptimizationproblemswithapplicationsincomputationalbiology