Parallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem
Name
500_2022_Article_6969.pdf
Size
627.49 KB
Format
Adobe PDF
Checksum (MD5)
b61d2421318a6ebefea86d3e8bf30a57
Author(s)
Vulakh, David
Finkel, Raphael
Date Issued
March 26, 2022
Publisher
Springer Berlin Heidelberg
Citation
Vulakh, David and Finkel, Raphael. 2022. "Parallel m-dimensional relative ant colony optimization (mDRACO) for the Costas-array problem."
Version
Final published version
Abstract
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 Colony Optimization (
$$m$$
m
DRACO) for combinatorial CSPs, focusing specifically on the Costas-array problem. This paper introduces the optimizations included in
$$m$$
m
DRACO, such as map-based association of pheromone with arbitrary-length component sequences and relative path storage. We assess the quality of the resulting
$$m$$
m
DRACO framework on the Costas-array problem by computing the efficiency of its processor utilization and comparing its run time to that of an ACO framework without the new optimizations.
$$m$$
m
DRACO gives promising results; it has efficiency greater than 0.5 and reduces time-to-first-solution for the
$$m = 16$$
m
=
16
Costas-array problem by a factor of over 300.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00500-022-06969-1
