Table 7 Optimal solutions for 3-gene example under various T by Genetic Algorithm
From: On finite-horizon control of genetic regulatory networks with multiple hard-constraints
| Control Strategy σ = i1i2 …iT | Cost | Average Computing Time(sec) | ||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| T =10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 1 | 6.5 | 32.25 | ||||||||||
| T =15 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 4 | 30.23 | |||||
| T = 20 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 4 | 27.7 |