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 Rela...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2022
|
| Online Access: | https://hdl.handle.net/1721.1/141629 |