Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems

A new search-space-updating technique for genetic algorithms is proposed for continuous optimisation problems. Other than gradually reducing the search space during the evolution process with a fixed reduction rate set ‘a priori’, the upper and the lower boundaries for each variable in the objective function are dynamically adjusted based on its distribution statistics. To test the effectiveness, the technique is applied to a number of benchmark optimisation problems in comparison with three other techniques, namely the genetic algorithms with parameter space size adjustment (GAPSSA) technique [A.B. Djurišic, Elite genetic algorithms with adaptive mutations for solving continuous optimization problems – application to modeling of the optical constants of solids, Optics Communications 151 (1998) 147–159], successive zooming genetic algorithm (SZGA) [Y. Kwon, S. Kwon, S. Jin, J. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and Structures 81 (2003) 1715–1725] and a simple GA. The tests show that for well-posed problems, existing search space updating techniques perform well in terms of convergence speed and solution precision however, for some ill-posed problems these techniques are statistically inferior to a simple GA. All the tests show that the proposed new search space update technique is statistically superior to its counterparts.

Efficient computation algorithm for calculating load contributions to line flows and losses

In a deregulated power system, it is usually required to determine the shares of each load and generation in line flows, to permit fair allocation of transmission costs between the interested parties. The paper presents a new method of determining the contributions of each load to line flows and losses. The method is based on power-flow topology and has the advantage of being the least computationally demanding of similar methods.

Modelling the MAPK signalling pathway using a two-stage identification algorithm

Signal transduction pathways describe the dynamics of cellular response to input signalling molecules at receptors on the cell membrane. The Mitogen-Activated Protein Kinase (MAPK) cascade is one of such pathways that are involved in many important cellular processes including cell growth and proliferation. This paper describes a black-box model of this pathway created using an advanced two-stage identification algorithm. Identification allows us to capture the unique features and dynamics of the pathway and also opens up the possibility of regulatory control design. In the approach described, an optimal model is obtained by performing model subset selection in two stages, where the terms are first determined by a forward selection method and then modified using a backward selection model refinement. The simulation results demonstrate that the model selected using the two-stage algorithm performs better than with the forward selection method alone.