Skip to main content
SpringerLink
Log in

Ant-Based Approaches for Solving Autocorrelation Problems

  • Conference paper
Swarm Intelligence (ANTS 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7461))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bonabeau, E., Dorigo, M., Théraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  2. Chiarandini, M., Kotsireas, I.S., Koukouvinos, C., Paquete, L.: Heuristic algorithms for Hadamard matrices with two circulant cores. Th. Com. Sc. 407, 274–277 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of combinatorial designs. Discrete Mathematics and its Applications. Chapman & Hall/CRC, Boca Raton (2007)

    MATH  Google Scholar 

  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 

  5. Fletcher, R.J., Gysin, M., Seberry, J.: Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices. Australas. J. Combin. 23, 75–86 (2001)

    MathSciNet  MATH  Google Scholar 

  6. Golomb, S.W., Gong, G.: Signal design for good correlation. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  7. Stützle, T., Hoos, H.H.: Max–min ant system. Future Generation Computer Systems 16, 889–914 (2000)

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Canada

    Ilias S. Kotsireas

  2. Department of Computer Science, University of Ioannina, Greece

    Konstantinos E. Parsopoulos & Grigoris S. Piperagkas

  3. Department of Mathematics, University of Patras, Greece

    Michael N. Vrahatis

Authors
  1. Ilias S. Kotsireas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos E. Parsopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Grigoris S. Piperagkas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael N. Vrahatis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRIDIA, Université Libre de Bruxelles, CoDE, Av. F. Roosevelt 50, CP 194/6, 1050, Brussels, Belgium

    Marco Dorigo , Mauro Birattari  & Thomas Stützle ,  & 

  2. ALBCOM, Department Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Jordi Girona 1-3, Omega 112 Campus Nord, 08034, Barcelona, Spain

    Christian Blum

  3. Instituto de Telecomunicações & Instituto Universitário de Lisboa (ISCTE-IUL), Av. das Foras Armadas, 1649-026, Lisboa, Portugal

    Anders Lyhne Christensen

  4. Department of Computer Science, University of Pretoria, 0002, Pretoria, South Africa

    Andries P. Engelbrecht

  5. Department of Automatic Control and Systems Engineering, The University of Sheffield, Mappin Street, S1 3JD, Sheffield, UK

    Roderich Groß

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kotsireas, I.S., Parsopoulos, K.E., Piperagkas, G.S., Vrahatis, M.N. (2012). Ant-Based Approaches for Solving Autocorrelation Problems. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32650-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32649-3

  • Online ISBN: 978-3-642-32650-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation