Parallel shared memory strategies for ant-based optimization algorithms

Thang N. Bui, Thanhvu Nguyen, Joseph R. Rizzo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the maximum clique problem. Extensive experimental results indicate that the parallel version provides noticeable improvements to the running time while maintaining comparable solution quality to that of the sequential version.

Original languageEnglish (US)
Title of host publicationProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Pages1-8
Number of pages8
DOIs
StatePublished - Dec 31 2009
Event11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 - Montreal, QC, Canada
Duration: Jul 8 2009Jul 12 2009

Publication series

NameProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Other

Other11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
CountryCanada
CityMontreal, QC
Period7/8/097/12/09

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Parallel shared memory strategies for ant-based optimization algorithms'. Together they form a unique fingerprint.

Cite this