论文信息 - Ant-Based Approaches for Solving Autocorrelation Problems

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.

[1] Luís Paquete,et al. Heuristic algorithms for Hadamard matrices with two circulant cores , 2008, Theor. Comput. Sci..

[2] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[3] Le Chung Tran. Complex Orthogonal Space-Time Processing in Wireless Communications , 2006 .

[4] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[5] Jennifer Seberry,et al. Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices , 2001, Australas. J Comb..

[6] Barbara Webb,et al. Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[7] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[8] C. Colbourn,et al. Handbook of Combinatorial Designs , 2006 .

[9] Guang Gong,et al. Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar , 2005 .