Improving the efficiency of the optimization algorithm angels & mortals

We present an improved algorithm called Angels and Mortals mainly used for NP problem solutions. The primary improvements are several modifications of cloning and mutation process and computation of mortals´ lifespan in order to faster the algorithm. We report our experience on the problems of Graph Coloring and Boolean Satisfiability. Comparing to the Classic evolutionary algorithm, the main advantages of the proposed algorithm are more setting parameters and omitting the crossing part to save execution time.