Ant-Based Approaches for Solving Autocorrelation Problems
We propose two ant–based formulations for solving autocorrelation problems. The formulations are combined with different ACO variants. Preliminary experiments of the derived approaches are conducted on two hard instances of the problem. Their performance is compared to an efficient Tabu Search algorithm, offering useful conclusions and motivation for further investigation.
KeywordsCandidate Solution Hadamard Matrice Swarm Size Computational Budget Ternary Sequence
Unable to display preview. Download preview PDF.
- 4.Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. SMC – Part B 26(1), 29–41 (1996)Google Scholar
- 8.Tran, L.C., Wysocki, T.A., Mertins, A., Seberry, J.: Complex Orthogonal Space-Time Processing in Wireless Communications. Springer (2006)Google Scholar