A Comparison Of Memetic Algorithms For The Spread Spectrum Radar Polyphase Codes Design Problem

摘要

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.