Abstract
Memetic algorithms (MA) have recently been applied successfully to solve decision and optimization problems. However, selecting a suitable local search technique remains a critical issue of MA, as this significantly affects the performance of the algorithms. This paper presents a new agent based memetic algorithm (AMA) for solving constrained real-valued optimization problems, where the agents have the ability to independently select a suitable local search technique (LST) from our designed set. Each agent represents a candidate solution of the optimization problem and tries to improve its solution through co-operation with other agents. Evolutionary operators consist of only crossover and one of the self-adaptively selected LSTs. The performance of the proposed algorithm is tested on five new benchmark problems along with 13 existing well-known problems, and the experimental results show convincing performance.
| Original language | English |
|---|---|
| Pages (from-to) | 741–762 |
| Number of pages | 22 |
| Journal | Soft Computing |
| Volume | 13 |
| Issue number | 8-9 |
| DOIs | |
| Publication status | Published - 9 Aug 2009 |
| Externally published | Yes |