An agent-based memetic algorithm (AMA) for solving constrained optimazation problems

In recent years, memetic algorithms (MAs) have been proposed to enhance the performance of evolutionary algorithms by incorporating local search techniques with evolutionary algorithms´ global search ability, and applied successfully to solve different type of optimization problems. This paper proposes a new memetic algorithm and then introduces an agent-based memetic algorithm (AMA), for the first time, to further enhance the ability of MA in solving constrained optimization problems. In a lattice-like environment, each of the agents represents a candidate solution of the problem. The agents are able to sense and act on the society, and their performances i.e. fitness of the solution improves through co-evolutionary adaptation of society with the individual learning of the agents. The proposed algorithm is tested on 13 benchmark problems and the experimental results show promising performance.