CoChat

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

Open access

The DOI matches its Crossref record; 112 of the 112 references it cites were found in a registry or an index.

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0182186

Cites

112 of 112 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig 1 Schematic representation of sequential algorithms.
Fig 1 Schematic representation of sequential algorithms.CC BY · PubMed Central
Fig 2 Schematic representation of saCeSS2 algorithm.
Fig 2 Schematic representation of saCeSS2 algorithm.CC BY · PubMed Central
Fig 3 Case study 1 SSP: Bean plots of execution time for np-eSS vs saCeSS2 using 10, 20 and 40 MPI processors. VTR = 10 and 20 independent runs for each experiment.
Fig 3 Case study 1 SSP: Bean plots of execution time for np-eSS vs saCeSS2 using 10, 20 and 40 MPI processors. VTR = 10 and 20 independent runs for each experiment.CC BY · PubMed Central
Fig 4 Case study 1 SSP: Convergence curves.
Fig 4 Case study 1 SSP: Convergence curves.CC BY · PubMed Central
Fig 5 Convergence curves for saCeSS2 using 1, 10, 20 and 40 processors corresponding to the runs in the median values of the results distribution.
Fig 5 Convergence curves for saCeSS2 using 1, 10, 20 and 40 processors corresponding to the runs in the median values of the results distribution.CC BY · PubMed Central
Fig 6 Case study 2 HePG2: Bean plots of execution time for NP-eSS vs saCeSS2 using 10, 20 and 40 MPI processors in the HePG2 problem. VTR = 33 and the number of runs is equal to 20.
Fig 6 Case study 2 HePG2: Bean plots of execution time for NP-eSS vs saCeSS2 using 10, 20 and 40 MPI processors in the HePG2 problem. VTR = 33 and the number of runs is equal to 20.CC BY · PubMed Central
Fig 7 Case study 2 HePG2: Convergence curves.
Fig 7 Case study 2 HePG2: Convergence curves.CC BY · PubMed Central
Fig 8 Convergence curves for saCeSS2 using 10, 20 and 40 processors corresponding to the runs in the median values of the results distribution.
Fig 8 Convergence curves for saCeSS2 using 10, 20 and 40 processors corresponding to the runs in the median values of the results distribution.CC BY · PubMed Central
Fig 9 Case study 3: HPN-DREAM convergence curves in the NEMO local cluster. Convergence curves using 10, 20, 40 and 60 cores.
Fig 9 Case study 3: HPN-DREAM convergence curves in the NEMO local cluster. Convergence curves using 10, 20, 40 and 60 cores.CC BY · PubMed Central
Fig 10 Case study 3: HPN-DREAM convergence curves in the EBI cluster. Convergence curves using 100, and 300 cores.
Fig 10 Case study 3: HPN-DREAM convergence curves in the EBI cluster. Convergence curves using 100, and 300 cores.CC BY · PubMed Central
Fig 11 Case study 1: Beanplots comparing results in terms of execution time in azure vs local cluster in the SSP problem.
Fig 11 Case study 1: Beanplots comparing results in terms of execution time in azure vs local cluster in the SSP problem.CC BY · PubMed Central
Fig 12 Case study 2: Beanplots comparing results in terms of execution time in azure vs local cluster in the HePG2 problem.
Fig 12 Case study 2: Beanplots comparing results in terms of execution time in azure vs local cluster in the HePG2 problem.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 112 references

Research works printed but not linked: 1

  1. C. Evangelinos, C. Hill, Cloud computing for parallel scientific HPC applications: Feasibility of running coupled atmosphere-ocean climate models on amazon’s EC2, in: 1st Workshop on Cloud Computing and its Applications (CCA’08), 2008, pp. 1–6.

Cited by

See all 16

Metadata

Authors
Penas, D. R., Henriques, D., González, P., Doallo, R., Saez-Rodriguez, J., & Banga, J. R.
Affiliations
  • Consejo Superior de Investigaciones Científicas (ES)
  • Universidade da Coruña (ES)
Corresponding author
  • González, Patricia
  • Banga, Julio R.
Venue
PLOS ONE
Published
2017-08-15
Volume
12
Issue
8
Pages
e0182186
ISSN
1932-6203 (ISSN-L)
OpenAlex
W2745970186
Cited by
16
References
112
Citations by year
2025: 2 · 2024: 3 · 2023: 2 · 2022: 1 · 2021: 1 · 2019: 3 · 2018: 4
FWCI
1.14
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DIGITAL.CSIC (Spanish National Research Council (CSIC)) (submittedVersion, cc-by)
  • LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • RWTH Publications (RWTH Aachen) (submittedVersion, cc-by)
  • RWTH Publications (RWTH Aachen)
Funders
  • Ministerio de Economía y Competitividad (ES) (TIN2016-75845-P, DPI2014-55276-C5-2-R)
  • Galician Government under the Consolidation Program of Competitive Research Units (R2016/045, GRC2013/055)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
mixed-integer dynamic optimization, parallel metaheuristics, scatter search, reverse engineering, computational systems biology, cell signaling dynamics, superlinear speedup
MeSH terms
Algorithms, Software, Signal Transduction, Computational Biology, Systems Biology

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology. https://app.cochat.ai/papers/10.1371/journal.pone.0182186
The paper
Penas, D. R., Henriques, D., González, P., Doallo, R., Saez-Rodriguez, J., & Banga, J. R. (2017). A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology. PLOS ONE. https://doi.org/10.1371/journal.pone.0182186

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.