scholarly journals Dynamic Optimization with Particle Swarms (DOPS): a meta-heuristic for parameter estimation in biochemical models

2018 ◽  
Vol 12 (1) ◽  
Author(s):  
Adithya Sagar ◽  
Rachel LeCover ◽  
Christine Shoemaker ◽  
Jeffrey Varner
2017 ◽  
Author(s):  
Adithya Sagar ◽  
Rachel LeCover ◽  
Christine Shoemaker ◽  
Jeffrey Varner

AbstractBackgroundMathematical modeling is a powerful tool to analyze, and ultimately design biochemical networks. However, the estimation of the parameters that appear in biochemical models is a significant challenge. Parameter estimation typically involves expensive function evaluations and noisy data, making it difficult to quickly obtain optimal solutions. Further, biochemical models often have many local extrema which further complicates parameter estimation. Toward these challenges, we developed Dynamic Optimization with Particle Swarms (DOPS), a novel hybrid meta-heuristic that combined multi-swarm particle swarm optimization with dynamically dimensioned search (DDS). DOPS uses a multi-swarm particle swarm optimization technique to generate candidate solution vectors, the best of which is then greedily updated using dynamically dimensioned search.ResultsWe tested DOPS using classic optimization test functions, biochemical benchmark problems and real-world biochemical models. We performed trials with function evaluations per trial, and compared the performance of DOPS with other commonly used meta-heuristics such as differential evolution (DE), simulated annealing (SA) and dynamically dimensioned search (DDS). On average, DOPS outperformed other common meta-heuristics on the optimization test functions, benchmark problems and a real-world model of the human coagulation cascade.ConclusionsDOPS is a promising meta-heuristic approach for the estimation of biochemical model parameters in relatively few function evaluations. DOPS source code is available for download under a MIT license at http://www.varnerlab.org.


2006 ◽  
Vol 110 (3) ◽  
pp. 971-976 ◽  
Author(s):  
Adam B. Singer ◽  
James W. Taylor ◽  
Paul I. Barton ◽  
William H. Green

2021 ◽  
Vol 2 (1) ◽  
pp. 25-30
Author(s):  
Józef Lisowski

The article presents four main chapters that allow you to formulate an optimization task and choose a method for solving it from static and dynamic optimization methods to single-criterion and multi-criteria optimization. In the group of static optimization methods, the methods are without constraints and with constraints, gradient and non-gradient and heuristic. Dynamic optimization methods are divided into basic - direct and indirect and special. Particular attention has been paid to multi-criteria optimization in single-object approach as static and dynamic optimization, and multi-object optimization in game control scenarios. The article shows not only the classic optimization methods that were developed many years ago, but also the latest in the field, including, but not limited to, particle swarms.


Sign in / Sign up

Export Citation Format

Share Document