AMA: a new approach for solving constrained real-valued optimization problems

Authors:
Abu S. S. M. Barkat Ullah;Ruhul Sarker;David Cornforth;Chris Lokan
Affiliations:
University of New South Wales at the Australian Defence Force Academy, School of Information Technology and Electrical Engineering, 2600, Canberra, Australia;University of New South Wales at the Australian Defence Force Academy, School of Information Technology and Electrical Engineering, 2600, Canberra, Australia;University of New South Wales at the Australian Defence Force Academy, School of Information Technology and Electrical Engineering, 2600, Canberra, Australia;University of New South Wales at the Australian Defence Force Academy, School of Information Technology and Electrical Engineering, 2600, Canberra, Australia
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Emerging Trends in Soft Computing - Memetic Algorithms; Guest Editors: Yew-Soon Ong, Meng-Hiot Lim, Ferrante Neri, Hisao Ishibuchi
Year:
2009

Citing 0
Cited 5

An agent-based memetic algorithm (AMA) for nonlinear optimization with equality constraints

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Constrained optimization based on modified differential evolution algorithm

Information Sciences: an International Journal
Estimating meme fitness in adaptive memetic algorithms for combinatorial problems

Evolutionary Computation
A distributed agent-based approach for simulation-based optimization

Advanced Engineering Informatics
Comprehensive Survey of the Hybrid Evolutionary Algorithms

International Journal of Applied Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.