Dataset Information

A contraction approach to dynamic optimization problems.

ABSTRACT: An infinite-horizon, multidimensional optimization problem with arbitrary yet finite periodicity in discrete time is considered. The problem can be posed as a set of coupled equations. It is shown that the problem is a special case of a more general class of contraction problems that have unique solutions. Solutions are obtained by considering a vector-valued value function and by using an iterative process. Special cases of the general class of contraction problems include the classical Bellman problem and its stochastic formulations. Thus, our approach can be viewed as an extension of the Bellman problem to the special case of nonautonomy that periodicity represents, and our approach thereby facilitates consistent and rigorous treatment of, for example, seasonality in discrete, dynamic optimization, and furthermore, certain types of dynamic games. The contraction approach is illustrated in simple examples. In the main example, which is an infinite-horizon resource management problem with a periodic price, it is found that the optimal exploitation level differs between high and low price time intervals and that the solution time paths approach a limit cycle.

SUBMITTER: Sandal LK

PROVIDER: S-EPMC8608347 | biostudies-literature | 2021

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

A contraction approach to dynamic optimization problems.

Sandal Leif K LK Kvamsdal Sturla F SF Maroto José M JM Morán Manuel M

PloS one 20211122 11

An infinite-horizon, multidimensional optimization problem with arbitrary yet finite periodicity in discrete time is considered. The problem can be posed as a set of coupled equations. It is shown that the problem is a special case of a more general class of contraction problems that have unique solutions. Solutions are obtained by considering a vector-valued value function and by using an iterative process. Special cases of the general class of contraction problems include the classical Bellman ...[more]

PMID: 34807942

Similar Datasets

Project description:Several optimization problems can be abstracted into many-objective optimization problems (MaOPs). The key to solving MaOPs is designing an effective algorithm to balance the exploration and exploitation issues. This paper proposes a novel many-objective African vulture optimization algorithm (MaAVOA) that simulating the African vultures' foraging and navigation behaviours to solve the MaOPs. MaAVOA is an updated version of the African Vulture Optimization Algorithm (AVOA), which was recently proposed to solve the MaOPs. A new social leader vulture for the selection process is introduced and integrated into the proposed model. In addition, an environmental selection mechanism based on the alternative pool is adapted to improve the selection process to maintain diversity for approximating different parts of the whole Pareto Front (PF). The best-nondominated solutions are saved in an external Archive based on the Fitness Assignment Method (FAM) during the population evolution. FAM is based on a convergence measure that promotes convergence and a density measure that promotes variety. Also, a Reproduction of Archive Solutions (RAS) procedure is developed to improve the quality of archiving solutions. RAS has been designed to help reach out to the missing areas of the PF that the vultures easily miss. Two experiments are conducted to verify and validate the suggested MaAVOA's performance efficacy. First, MaAVOA was applied to the DTLZ functions, and its performance was compared to that of several popular many-objective algorithms and according to the results, MaAVOA outperforms the competitor algorithms in terms of inverted generational distance and hypervolume performance measures and has a beneficial adaptation ability in terms of both convergence and diversity performance measures. Also, statistical tests are implemented to demonstrate the suggested algorithm's statistical relevance. Second, MaAVOA has been applied to solve two real-life constrained engineering MaOPs applications, namely, the series-parallel system and overspeed protection for gas turbine problems. The experiments show that the suggested algorithm can tackle many-objective real-world applications and provide promising choices for decision-makers.

Project description:BackgroundDuring the last decade, a number of authors have shown that the genetic regulation of metabolic networks may follow optimality principles. Optimal control theory has been successfully used to compute optimal enzyme profiles considering simple metabolic pathways. However, applying this optimal control framework to more general networks (e.g. branched networks, or networks incorporating enzyme production dynamics) yields problems that are analytically intractable and/or numerically very challenging. Further, these previous studies have only considered a single-objective framework.ResultsIn this work we consider a more general multi-objective formulation and we present solutions based on recent developments in global dynamic optimization techniques. We illustrate the performance and capabilities of these techniques considering two sets of problems. First, we consider a set of single-objective examples of increasing complexity taken from the recent literature. We analyze the multimodal character of the associated non linear optimization problems, and we also evaluate different global optimization approaches in terms of numerical robustness, efficiency and scalability. Second, we consider generalized multi-objective formulations for several examples, and we show how this framework results in more biologically meaningful results.ConclusionsThe proposed strategy was used to solve a set of single-objective case studies related to unbranched and branched metabolic networks of different levels of complexity. All problems were successfully solved in reasonable computation times with our global dynamic optimization approach, reaching solutions which were comparable or better than those reported in previous literature. Further, we considered, for the first time, multi-objective formulations, illustrating how activation in metabolic pathways can be explained in terms of the best trade-offs between conflicting objectives. This new methodology can be applied to metabolic networks with arbitrary topologies, non-linear dynamics and constraints.

Project description:BackgroundWe 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).MethodsWe 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.ResultsWe 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).ConclusionsThese 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.

Project description:This research paper develops a novel hybrid approach, called hybrid particle swarm optimization-teaching-learning-based optimization (hPSO-TLBO), by combining two metaheuristic algorithms to solve optimization problems. The main idea in hPSO-TLBO design is to integrate the exploitation ability of PSO with the exploration ability of TLBO. The meaning of "exploitation capabilities of PSO" is the ability of PSO to manage local search with the aim of obtaining possible better solutions near the obtained solutions and promising areas of the problem-solving space. Also, "exploration abilities of TLBO" means the ability of TLBO to manage the global search with the aim of preventing the algorithm from getting stuck in inappropriate local optima. hPSO-TLBO design methodology is such that in the first step, the teacher phase in TLBO is combined with the speed equation in PSO. Then, in the second step, the learning phase of TLBO is improved based on each student learning from a selected better student that has a better value for the objective function against the corresponding student. The algorithm is presented in detail, accompanied by a comprehensive mathematical model. A group of benchmarks is used to evaluate the effectiveness of hPSO-TLBO, covering various types such as unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. In addition, CEC 2017 benchmark problems are also utilized for evaluation purposes. The optimization results clearly demonstrate that hPSO-TLBO performs remarkably well in addressing the benchmark functions. It exhibits a remarkable ability to explore and exploit the search space while maintaining a balanced approach throughout the optimization process. Furthermore, a comparative analysis is conducted to evaluate the performance of hPSO-TLBO against twelve widely recognized metaheuristic algorithms. The evaluation of the experimental findings illustrates that hPSO-TLBO consistently outperforms the competing algorithms across various benchmark functions, showcasing its superior performance. The successful deployment of hPSO-TLBO in addressing four engineering challenges highlights its effectiveness in tackling real-world applications.

Dataset Information

A contraction approach to dynamic optimization problems.

Publications

A contraction approach to dynamic optimization problems.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets