Redundancy Level Optimization in Modular Software System Models using ABC

摘要

The performance of optimization algorithms is problem dependent and as per no free lunch theorem, there exists no such algorithm which can be efficiently applied to every type of problem(s). However, we can modify the algorithm/ technique in a manner such that it is able to deal with a maximum type of problems. In this study we have modified the structure of basic Artificial Bee Colony (ABC), a recently proposed metaheuristic algorithm based on the concept of swarm intelligence to optimize the models of software reliability. The modified variant of ABC is termed as balanced ABC (B-ABC). The simulated results show the efficiency and capability of the variant to solve such type of the problems.