Artificial immune system for dynamic economic dispatch,”

a b s t r a c t Dynamic economic dispatch determines the optimal scheduling of online generator outputs with predicted load demands over a certain period of time taking into consideration the ramp rate limits of the generators. This paper proposes artificial immune system based on the clonal selection principle for solving dynamic economic dispatch problem. This approach implements adaptive cloning, hyper-mutation, aging operator and tournament selection. Numerical results of a ten-unit system with nonsmooth fuel cost function have been presented to validate the performance of the proposed algorithm. The results obtained from the proposed algorithm are compared with those obtained from particle swarm optimization and evolutionary programming. From numerical results, it is found that the proposed artificial immune system based approach is able to provide better solution than particle swarm optimization and evolutionary programming in terms of minimum cost and computation time

Protein multiple sequence alignment by hybrid bio-inspired algorithms

This article presents an immune inspired algorithm to tackle the Multiple Sequence Alignment (MSA) problem. MSA is one of the most important tasks in biological sequence analysis. Although this paper focuses on protein alignments, most of the discussion and methodology may also be applied to DNA alignments. The problem of finding the multiple alignment was investigated in the study by Bonizzoni and Vedova and Wang and Jiang, and proved to be a NP-hard (non-deterministic polynomial-time hard) problem. The presented algorithm, called Immunological Multiple Sequence Alignment Algorithm (IMSA), incorporates two new strategies to create the initial population and specific ad hoc mutation operators. It is based on the ‘weighted sum of pairs’ as objective function, to evaluate a given candidate alignment. IMSA was tested using both classical benchmarks of BAliBASE (versions 1.0, 2.0 and 3.0), and experimental results indicate that it is comparable with state-of-the-art multiple alignment algorithms, in terms of quality of alignments, weighted Sums-of-Pairs (SP) and Column Score (CS) values. The main novelty of IMSA is its ability to generate more than a single suboptimal alignment, for every MSA instance; this behaviour is due to the stochastic nature of the algorithm and of the populations evolved during the convergence process. This feature will help the decision maker to assess and select a biologically relevant multiple sequence alignment. Finally, the designed algorithm can be used as a local search procedure to properly explore promising alignments of the search space