A comparison of memetic algorithms for the spread spectrum radar polyphase codes design problem

Authors:
Ángel M. Pérez-Bellido;Sancho Salcedo-Sanz;Emilio G. Ortiz-García;José A. Portilla-Figueras;Francisco López-Ferreras
Affiliations:
Department of Signal Theory and Communications, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain;Department of Signal Theory and Communications, Universidad de Alcalá, Alcalá de Henares, Madrid, Spain
Venue:
Engineering Applications of Artificial Intelligence
Year:
2008

Citing 3
Cited 3

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design

Proceedings of the 9th annual conference on Genetic and evolutionary computation

Multiobjective memetic algorithms for time and space assembly line balancing

Engineering Applications of Artificial Intelligence
A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem

Expert Systems with Applications: An International Journal
A differential memetic algorithm

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents three memetic algorithms to solve the spread spectrum radar polyphase code design problem, based on Evolutionary Programming, Particle Swarm Optimization and Differential Evolution, respectively. These global search heuristics are hybridized with a gradient-based local search procedure which includes a dynamic step adaptation procedure to perform accurate and efficient local search for better solutions. We have compared the different memetic algorithms proposed in several numerical examples, and we have also demonstrated the performance of our approaches against existing approaches for this problem.