Parallel shared memory strategies for ant-based optimization algorithms

Thang Nguyen Bui, Thanhvu Nguyen, Joseph R. Rizzo

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

8 Citations (Scopus)

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

Fingerprint

Shared Memory
Optimization Algorithm
Data storage equipment
Parallel algorithms
Maximum Clique Problem
Convert
Experimental Results
Strategy

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Bui, T. N., Nguyen, T., & Rizzo, J. R. (2009). Parallel shared memory strategies for ant-based optimization algorithms. In Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 (pp. 1-8). (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009). https://doi.org/10.1145/1569901.1569903
Bui, Thang Nguyen ; Nguyen, Thanhvu ; Rizzo, Joseph R. / Parallel shared memory strategies for ant-based optimization algorithms. Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. 2009. pp. 1-8 (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009).
@inproceedings{ca339d6d3db04286929c92fc5ca3a0cc,
title = "Parallel shared memory strategies for ant-based optimization algorithms",
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.",
author = "Bui, {Thang Nguyen} and Thanhvu Nguyen and Rizzo, {Joseph R.}",
year = "2009",
month = "12",
day = "31",
doi = "10.1145/1569901.1569903",
language = "English (US)",
isbn = "9781605583259",
series = "Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009",
pages = "1--8",
booktitle = "Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009",

}

Bui, TN, Nguyen, T & Rizzo, JR 2009, Parallel shared memory strategies for ant-based optimization algorithms. in Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, pp. 1-8, 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, Montreal, QC, Canada, 7/8/09. https://doi.org/10.1145/1569901.1569903

Parallel shared memory strategies for ant-based optimization algorithms. / Bui, Thang Nguyen; Nguyen, Thanhvu; Rizzo, Joseph R.

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. 2009. p. 1-8 (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009).

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

TY - GEN

T1 - Parallel shared memory strategies for ant-based optimization algorithms

AU - Bui, Thang Nguyen

AU - Nguyen, Thanhvu

AU - Rizzo, Joseph R.

PY - 2009/12/31

Y1 - 2009/12/31

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=72749117394&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72749117394&partnerID=8YFLogxK

U2 - 10.1145/1569901.1569903

DO - 10.1145/1569901.1569903

M3 - Conference contribution

SN - 9781605583259

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

SP - 1

EP - 8

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

ER -

Bui TN, Nguyen T, Rizzo JR. Parallel shared memory strategies for ant-based optimization algorithms. In Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009. 2009. p. 1-8. (Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009). https://doi.org/10.1145/1569901.1569903