Parallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem

Abstract The Costas-array problem is a combinatorial constraint-satisfaction problem (CSP) that remains unsolved for many array sizes greater than 30. In order to reduce the time required to solve large instances, we present an Ant Colony Optimization algorithm called m-Dimensional Relative Ant Colo...

Full description

Bibliographic Details
Main Authors: Vulakh, David (Author), Finkel, Raphael (Author)
Format: Article
Language:English
Published: Springer Berlin Heidelberg, 2022-04-04T12:36:20Z.
Subjects:
Online Access:Get fulltext

Similar Items