Ant-based approaches for solving autocorrelation problems

Authors:
Ilias S. Kotsireas;Konstantinos E. Parsopoulos;Grigoris S. Piperagkas;Michael N. Vrahatis
Affiliations:
Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Canada;Department of Computer Science, University of Ioannina, Greece;Department of Computer Science, University of Ioannina, Greece;Department of Mathematics, University of Patras, Greece
Venue:
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Year:
2012

Citing 7
Cited 0

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
MAX-MIN Ant system

Future Generation Computer Systems
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar

Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Complex Orthogonal Space-Time Processing in Wireless Communications

Complex Orthogonal Space-Time Processing in Wireless Communications
Heuristic algorithms for Hadamard matrices with two circulant cores

Theoretical Computer Science
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.