Journal
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
Volume 33, Issue 9, Pages 4989-5010Publisher
WILEY
DOI: 10.1002/rnc.6171
Keywords
assignment problem; dynamical system; impulse control; linear approximation; microalgae production; nonlinear problems; periodic control; periodic system; permutation; resource allocation; switched systems
Ask authors/readers for more resources
In this article, the authors investigate a periodic resource allocation problem in a dynamical system, which is applied to a biological system. The goal is to find optimal control strategies to optimize the cost or benefit of the system. The authors illustrate this problem using an industrial biological application and introduce a nonlinear optimization problem and a suboptimal solution to overcome the computational difficulty. Numerical experiments are performed to assess the benefits of optimal strategies in different settings.
In this article, we focus on a periodic resource allocation problem applied on a dynamical system which comes from a biological system. More precisely, we consider a system with N$$ N $$ resources and N$$ N $$ activities, each activity use the allocated resource to evolve up to a given time T>0$$ T>0 $$ where a control (represented by a given permutation) will be applied on the system to reallocate the resources. The goal is to find the optimal control strategies which optimize the cost or the benefit of the system. This problem can be illustrated by an industrial biological application, namely, the optimization of a mixing strategy to enhance the growth rate in a microalgal raceway system. A mixing device, such as a paddle wheel, is considered to control the rearrangement of the depth of the algae cultures, hence the light perceived at each lap. We prove that if the dynamics of the system is periodic, then the period corresponds to one reallocation whatever the order of the involved permutation matrix is. A nonlinear optimization problem for one reallocation process is then introduced. Since N!$$ N! $$ permutations need to be tested in the general case, it can be numerically solved only for a limited number of N$$ N $$. To overcome this difficulty, we introduce a second optimization problem which provides a suboptimal solution of the initial problem, but whose solution can be determined explicitly. A sufficient condition to characterize cases where the two problems have the same solution is given. Some numerical experiments are performed to assess the benefit of optimal strategies in various settings.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available