2015
DOI: 10.1016/j.asoc.2015.04.025
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced parallel Differential Evolution algorithm for problems in computational systems biology

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
33
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 48 publications
(33 citation statements)
references
References 50 publications
0
33
0
Order By: Relevance
“…Previous works in the literature have already pointed out that, for sequential implementations, eSS performs better than DE in those problems where local searches are instrumental in refining the solution [51]. Thus, to ensure a more fair comparison here, we chose a parallel DE implementation (asynPDE [43]) that performs a global search through an asynchronous parallel implementation based on a cooperative island-model, and that also improves the local search phase by means of several heuristics also used in the eSS (i.e. an efficient local solver, a tabu list and a logarithmic space search).…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Previous works in the literature have already pointed out that, for sequential implementations, eSS performs better than DE in those problems where local searches are instrumental in refining the solution [51]. Thus, to ensure a more fair comparison here, we chose a parallel DE implementation (asynPDE [43]) that performs a global search through an asynchronous parallel implementation based on a cooperative island-model, and that also improves the local search phase by means of several heuristics also used in the eSS (i.e. an efficient local solver, a tabu list and a logarithmic space search).…”
Section: Resultsmentioning
confidence: 99%
“…repeated local searches started from different initial guesses inside a bounded domain) also enjoys great popularity, but it has been shown to be rather inefficient, even when exploiting high-quality gradient information [35]. Parallel global optimization strategies have been considered in several system biology studies, including parallel variants of simulated annealing [36], evolution strategies [3740], particle swarm optimization [41, 42] and differential evolution [43]. …”
Section: Introductionmentioning
confidence: 99%
“…The same previous experiments were carried out with the implementation of the asynchronous parallel DE described in [16]. This implementation is coded in C and uses the OpenMPI library.…”
Section: Resultsmentioning
confidence: 99%
“…A feature of many but not all of these algorithms is the maintenance of a population of good parameter sets, which are used to generate new trial parameter sets. Many modern descriptions of population-based metaheuristic algorithms (e.g [39,40,41]) allow for parallelized function evaluations within a single run of the algorithm, which enables these algorithms to take advantage of high-performance computing resources.…”
Section: Metaheuristic Optimizationmentioning
confidence: 99%