Skip to main content
SpringerLink
Log in

On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors

  • Conference paper
  • First Online:
Experimental Algorithms (SEA 2016)

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

Included in the following conference series:

  • 1054 Accesses

Abstract

Research on the existence of specific classes of combinatorial matrices such as the Circulant Weighing Matrices (CWMs) lies in the core of diverse theoretical and computational efforts. Modern metaheuristics have proved to be valuable tools for solving such problems. Recently, parallel Algorithm Portfolios (APs) composed of established search algorithms and sophisticated resource allocation procedures offered significant improvements in terms of time efficiency and solution quality. The present work aims at shedding further light on the latent quality of parallel APs on solving CWM problems. For this purpose, new AP configurations are considered along with specialized procedures that can enhance their performance. Experimental evaluation is conducted on a computationally restrictive, yet widely accessible, multi-core processor computational environment. Statistical analysis is used to reveal performance trends and extract useful conclusions.

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 EPUB and 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

Notes

  1. 1.

    http://www.intel.com/content/www/us/en/processors/core/core-i7-processor.html.

References

  1. Ang, M., Arasu, K., Ma, S., Strassler, Y.: Study of proper circulant weighing matrices with weigh 9. Discrete Math. 308, 2802–2809 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arasu, K., Dillon, J., Jungnickel, D., Pott, A.: The solution of the waterloo problem. J. Comb. Theor. Ser. A 71, 316–331 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arasu, K., Gulliver, T.: Self-dual codes over fp and weighing matrices. IEEE Trans. Inf. Theor. 47(5), 2051–2055 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Arasu, K., Gutman, A.: Circulant weighing matrices. Cryptogr. Commun. 2, 155–171 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Arasu, K., Leung, K., Ma, S., Nabavi, A., Ray-Chaudhuri, D.: Determination of all possible orders of weight 16 circulant weighing matrices. Finite Fields Appl. 12, 498–538 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chiarandini, M., Kotsireas, I., Koukouvinos, C., Paquete, L.: Heuristic algorithms for hadamard matrices with two circulant cores. Theoret. Comput. Sci. 407(1–3), 274–277 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cousineau, J., Kotsireas, I., Koukouvinos, C.: Genetic algorithms for orthogonal designs. Australas. J. Comb. 35, 263–272 (2006)

    MathSciNet  MATH  Google Scholar 

  8. van Dam, W.: Quantum algorithms for weighing matrices and quadratic residues. Algorithmica 34, 413–428 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Eades, P.: On the existence of orthogonal designs. Ph.D. thesis, Australian National University, Canberra (1997)

    Google Scholar 

  10. Eades, P., Hain, R.: On circulant weighing matrices. Ars Comb. 2, 265–284 (1976)

    MathSciNet  MATH  Google Scholar 

  11. Gendreau, M., Potvin, J.Y.: Tabu search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 41–59. Springer, New York (2010)

    Chapter  Google Scholar 

  12. Geramita, A., Sebery, J.: Orthogonical Designs: Quadratic Forms and Hadamard Matrices. Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, Inc., New York (1979)

    Google Scholar 

  13. Glover, F.: Tabu search - part I. ORSA J. Comput. 1, 190–206 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Glover, F.: Tabu search - part II. ORSA J. Comput. 2, 4–32 (1990)

    Article  MATH  Google Scholar 

  15. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)

    Book  MATH  Google Scholar 

  16. Gomes, C.P., Selman, B.: Algorithm portfolio design: theory vs. practice. In: Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 190–197 (1997)

    Google Scholar 

  17. Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 27, 51–53 (1997)

    Article  Google Scholar 

  18. Kotsireas, I.S., Parsopoulos, K.E., Piperagkas, G.S., Vrahatis, M.N.: Ant-based approaches for solving autocorrelation problems. In: Dorigo, M., Birattari, M., Blum, C., Christensen, A.L., Engelbrecht, A.P., Groß, R., Stützle, T. (eds.) ANTS 2012. LNCS, vol. 7461, pp. 220–227. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  19. Kotsireas, I.: Algorithms and metaheuristics for combinatorial matrices. In: Pardalos, P., Du, D.Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 283–309. Springer, New York (2013)

    Chapter  Google Scholar 

  20. Kotsireas, I., Koukouvinos, C., Pardalos, P., Shylo, O.: Periodic complementary binary sequences and combinatorial optimization algorithms. J. Comb. Optim. 20(1), 63–75 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kotsireas, I., Koukouvinos, C., Pardalos, P., Simos, D.: Competent genetic algorithms for weighing matrices. J. Comb. Optim. 24(4), 508–525 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kotsireas, I.S., Parsopoulos, K.E., Piperagkas, G.S., Vrahatis, M.N.: Ant-based approaches for solving autocorrelation problems. In: Dorigo, M., Birattari, M., Blum, C., Christensen, A.L., Engelbrecht, A.P., Groß, R., Stützle, T. (eds.) ANTS 2012. LNCS, vol. 7461, pp. 220–227. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  23. Koukouvinos, C., Seberry, J.: Weighing matrices and their applications. J. Stat. Plan. Infer. 62(1), 91–101 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  24. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 363–397. Springer, New York (2010)

    Chapter  Google Scholar 

  25. Peng, F., Tang, K., Chen, G., Yao, X.: Population-based algorithm portfolios for numerical optimization. IEEE Trans. Evol. Comp. 14(5), 782–800 (2010)

    Article  Google Scholar 

  26. Pham, D., Karaboga, D.: Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer, London (2000)

    Book  MATH  Google Scholar 

  27. Souravlias, D., Parsopoulos, K.E., Alba, E.: Parallel algorithm portfolio with market trading-based time allocation. In: Proceedings International Conference on Operations Research 2014 (OR 2014) (2014)

    Google Scholar 

  28. Souravlias, D., Parsopoulos, K.E., Kotsireas, I.S.: Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics. Optim. Lett. (2015)

    Google Scholar 

  29. Strassler, Y.: The classification of circulant weighing matrices of weight 9. Ph.D. thesis, Bar-Ilan University (1997)

    Google Scholar 

Download references

Acknowledgements

Research is partially supported by the Paul and Heidi Brown Preeminent Professorship in Industrial & Systems Engineering, University of Florida.

Author information

Authors and Affiliations

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

    Ilias S. Kotsireas

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  3. Department of Computer Science and Engineering, University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos & Dimitris Souravlias

Authors
  1. Ilias S. Kotsireas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Konstantinos E. Parsopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dimitris Souravlias
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Konstantinos E. Parsopoulos .

Editor information

Editors and Affiliations

  1. Amazon.com, Inc., Palo Alto, California, USA

    Andrew V. Goldberg

  2. Russian Academy of Sciences, St. Petersburg, Russia

    Alexander S. Kulikov

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kotsireas, I.S., Pardalos, P.M., Parsopoulos, K.E., Souravlias, D. (2016). On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-core Processors. In: Goldberg, A., Kulikov, A. (eds) Experimental Algorithms. SEA 2016. Lecture Notes in Computer Science(), vol 9685. Springer, Cham. https://doi.org/10.1007/978-3-319-38851-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-38851-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-38850-2

  • Online ISBN: 978-3-319-38851-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation