{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:50Z","timestamp":1759132010087,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,8]]},"DOI":"10.1145\/1569901.1569903","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel shared memory strategies for ant-based optimization algorithms"],"prefix":"10.1145","author":[{"given":"Thang N.","family":"Bui","sequence":"first","affiliation":[{"name":"Penn State Harrisburg, Middletown, PA, USA"}]},{"given":"ThanhVu","family":"Nguyen","sequence":"additional","affiliation":[{"name":"University of New Mexico, Albuquerque, NM, USA"}]},{"suffix":"Jr.","given":"Joseph R.","family":"Rizzo","sequence":"additional","affiliation":[{"name":"Concurrent Technologies Corporation, Harrisburg, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"48","volume-title":"Idea Group Publishing","author":"Alonso S.","year":"2004","unstructured":"S. Alonso , O. Cordon , I. Fernandez de Viana , F. Herrera , \" Integrating Evolutionary Computation Components in Ant Colony Optimization ,\" Recent Developments in Biologically Inspired Computing , L. Nunes de Castro , F.J. Von Zuben (Eds.), Idea Group Publishing , 2004 , pp. 48 -- 180 . S. Alonso, O. Cordon, I. Fernandez de Viana, F. Herrera, \"Integrating Evolutionary Computation Components in Ant Colony Optimization,\" Recent Developments in Biologically Inspired Computing, L.Nunes de Castro, F.J. Von Zuben (Eds.), Idea Group Publishing, 2004, pp. 48--180."},{"key":"e_1_3_2_1_2_1","first-page":"340","volume-title":"Distributed Fault Diagnosis For Multiprocessor Systems,\" Proc. of the 20th Annual International Symposium on Fault-Tolerant Computing","author":"Berman P.","year":"1990","unstructured":"P. Berman and A. Pelc , \" Distributed Fault Diagnosis For Multiprocessor Systems,\" Proc. of the 20th Annual International Symposium on Fault-Tolerant Computing , Newcastle, UK , 1990 , pp. 340 -- 346 . P. Berman and A. Pelc, \"Distributed Fault Diagnosis For Multiprocessor Systems,\" Proc. of the 20th Annual International Symposium on Fault-Tolerant Computing, Newcastle, UK, 1990, pp. 340--346."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/35017500"},{"key":"e_1_3_2_1_4_1","first-page":"24","article-title":"Finding Maximum Cliques with Distributed Ants","author":"Bui T.","year":"2004","unstructured":"T. Bui and J. Rizzo , \" Finding Maximum Cliques with Distributed Ants ,\" Proc. of the Genetic and Evolutionary Computation Conf. , 2004 , pp. 24 -- 35 . T. Bui and J. Rizzo, \"Finding Maximum Cliques with Distributed Ants,\" Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 24--35.","journal-title":"Proc. of the Genetic and Evolutionary Computation Conf."},{"key":"e_1_3_2_1_5_1","first-page":"36","article-title":"Ant System for the k-Cardinality Tree Problem","author":"Bui T.","year":"2004","unstructured":"T. Bui and G. Sundarraj , \" Ant System for the k-Cardinality Tree Problem ,\" Proc. of the Genetic and Evolutionary Computation Conf. , 2004 , pp. 36 -- 47 . T. Bui and G. Sundarraj, \"Ant System for the k-Cardinality Tree Problem,\" Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 36--47.","journal-title":"Proc. of the Genetic and Evolutionary Computation Conf."},{"key":"e_1_3_2_1_6_1","first-page":"43","article-title":"An Ant System Algorithm for Graph Bisection","author":"Bui T.","year":"2002","unstructured":"T. Bui and L. Strite , \" An Ant System Algorithm for Graph Bisection ,\" Proc. of the Genetic and Evolutionary Computation Conf. , 2002 , pp. 43 -- 51 . T. Bui and L. Strite, \"An Ant System Algorithm for Graph Bisection,\" Proc. of the Genetic and Evolutionary Computation Conf., 2002, pp. 43--51.","journal-title":"Proc. of the Genetic and Evolutionary Computation Conf."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144000"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4613-3279-4_6","volume-title":"Parallelization Strategies for the Ant System,\" High Performance Algorithms and Software in Nonlinear Optimization","author":"Bullnheimer B.","year":"1998","unstructured":"B. Bullnheimer , G, Kotsis, and C. Strauss , \" Parallelization Strategies for the Ant System,\" High Performance Algorithms and Software in Nonlinear Optimization , Kluwer , Dordrecht , 1998 , pp. 87 -- 100 . B. Bullnheimer, G, Kotsis, and C. Strauss, \"Parallelization Strategies for the Ant System,\" High Performance Algorithms and Software in Nonlinear Optimization, Kluwer, Dordrecht, 1998, pp. 87--100."},{"key":"e_1_3_2_1_9_1","volume-title":"Barcelona","author":"Delisle P.","year":"2001","unstructured":"P. Delisle , M. Krajecki , M. Gravel , and C. Gagne , \" Parallel Implementation of An Ant colony Optimization Metaheuristic With OpenMP,\" Proc. of the 3rd European Workshop on OpenMP (EWOMP'01) , Barcelona , Spain , 2001 . P. Delisle, M. Krajecki, M. Gravel, and C. Gagne, \"Parallel Implementation of An Ant colony Optimization Metaheuristic With OpenMP,\" Proc. of the 3rd European Workshop on OpenMP (EWOMP'01), Barcelona, Spain, 2001."},{"key":"e_1_3_2_1_11_1","first-page":"11","article-title":"The Ant Colony Optimization Meta-Heuristic","author":"Dorigo M.","year":"1999","unstructured":"M. Dorigo and G. Di Caro , \" The Ant Colony Optimization Meta-Heuristic ,\" New Ideas in Optimization, McGraw-Hill , 1999 , pp. 11 -- 32 . M. Dorigo and G. Di Caro, \"The Ant Colony Optimization Meta-Heuristic,\" New Ideas in Optimization, McGraw-Hill, 1999, pp. 11--32.","journal-title":"New Ideas in Optimization, McGraw-Hill"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600676"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.09.016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2005.160"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1992-00318-X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11839088_20"},{"key":"e_1_3_2_1_19_1","first-page":"21","volume-title":"Ant Colony Optimization: An Overview,\" Essays and Surveys in Metaheuristics","author":"Maniezzo V.","year":"2001","unstructured":"V. Maniezzo and A. Carbonaro , \" Ant Colony Optimization: An Overview,\" Essays and Surveys in Metaheuristics , C. Ribeiro editor, Kluwer Academic Publishers , 2001 , pp. 21 -- 44 . V. Maniezzo and A. Carbonaro, \"Ant Colony Optimization: An Overview,\" Essays and Surveys in Metaheuristics, C. Ribeiro editor, Kluwer Academic Publishers, 2001, pp. 21--44."},{"key":"e_1_3_2_1_20_1","first-page":"51","volume-title":"An Ant System for the Shortest Common Supersequence Problem,\" in D","author":"Michels R.","year":"1999","unstructured":"R. Michels and M. Middendorf , \" An Ant System for the Shortest Common Supersequence Problem,\" in D . Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill , 1999 , pp. 51 -- 61 . R. Michels and M. Middendorf, \"An Ant System for the Shortest Common Supersequence Problem,\" in D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, pp. 51--61."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015057701750"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233516"},{"key":"e_1_3_2_1_23_1","volume-title":"Computer Organization and Design","author":"Patterson D.","year":"1998","unstructured":"D. Patterson and J. Hennessy , \" Computer Organization and Design ( 2 nd Edition),\" Morgan Kaufmann Publishers , 1998 . D. Patterson and J. Hennessy, \"Computer Organization and Design (2nd Edition),\" Morgan Kaufmann Publishers, 1998.","edition":"2"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2002.1854"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463768.1463780"},{"key":"e_1_3_2_1_26_1","first-page":"11","article-title":"Unsolved Problems in Graph Theory Arising from the Study of Codes","author":"Sloane N.","year":"1989","unstructured":"N. Sloane , \" Unsolved Problems in Graph Theory Arising from the Study of Codes ,\" Graph Theory Notes of New York , XVIII , 1989 , pp. 11 -- 20 . N. Sloane, \"Unsolved Problems in Graph Theory Arising from the Study of Codes,\" Graph Theory Notes of New York, XVIII, 1989, pp. 11--20.","journal-title":"Graph Theory Notes of New York"},{"key":"e_1_3_2_1_27_1","volume-title":"Amsterdam","author":"Sloane N.","year":"1979","unstructured":"N. Sloane and F. MacWilliams , \" The Theory of Correcting Codes,\" North Holland , Amsterdam , 1979 . N. Sloane and F. MacWilliams, \"The Theory of Correcting Codes,\" North Holland, Amsterdam, 1979."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668612"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Ant Colonies for Combinatorial Optimization Problems,\" Feitelson&amp","author":"Talbi E.-G.","year":"1999","unstructured":"E.-G. Talbi , O. Roux , C. Fonlupt , and D. Robillard , \" Parallel Ant Colonies for Combinatorial Optimization Problems,\" Feitelson&amp ;Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop, Lecture Notes in Computer Science , 949, Springer , Vol. 11 , 1999 . E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard, \"Parallel Ant Colonies for Combinatorial Optimization Problems,\" Feitelson&Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop, Lecture Notes in Computer Science, 949, Springer, Vol. 11, 1999."},{"key":"e_1_3_2_1_30_1","volume-title":"http:\/\/www.beowulf.org. Last accessed","author":"Project The Beowulf","year":"2009","unstructured":"The Beowulf Project . http:\/\/www.beowulf.org. Last accessed March 2009 . The Beowulf Project. http:\/\/www.beowulf.org. Last accessed March 2009."},{"key":"e_1_3_2_1_31_1","volume-title":"http:\/\/www-unix.mcs.anl.gov\/mpi\/. Last accessed","author":"The Message Passing Interface MPI","year":"2009","unstructured":"MPI - The Message Passing Interface Standard. http:\/\/www-unix.mcs.anl.gov\/mpi\/. Last accessed March 2009 . MPI - The Message Passing Interface Standard. http:\/\/www-unix.mcs.anl.gov\/mpi\/. Last accessed March 2009."},{"key":"e_1_3_2_1_32_1","volume-title":"http:\/\/www.openmp.org\/specs\/. Last accessed","author":"Architecture Review Board MP","year":"2009","unstructured":"Open MP Architecture Review Board . http:\/\/www.openmp.org\/specs\/. Last accessed March 2009 . OpenMP Architecture Review Board. http:\/\/www.openmp.org\/specs\/. Last accessed March 2009."},{"key":"e_1_3_2_1_33_1","volume-title":"http:\/\/www.cs.hbg.psu.edu\/benchmarks\/. Last accessed","author":"Instances Clique Benchmark","year":"2009","unstructured":"Clique Benchmark Instances . http:\/\/www.cs.hbg.psu.edu\/benchmarks\/. Last accessed March 2009 . Clique Benchmark Instances. http:\/\/www.cs.hbg.psu.edu\/benchmarks\/. Last accessed March 2009."},{"key":"e_1_3_2_1_34_1","unstructured":"BHOSLIB\n  : Benchmarks with Hidden Optimum Solutions for Graph Problems. http:\/\/www.nlsde.buaa.edu.cn\/ kexu\/benchmarks\/graphbenchmarks.htm. Last accessed March 2009.  BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems. http:\/\/www.nlsde.buaa.edu.cn\/ kexu\/benchmarks\/graphbenchmarks.htm. Last accessed March 2009."},{"key":"e_1_3_2_1_35_1","volume-title":"http:\/\/www.cs.unm.edu\/~tnguyen\/Files\/Papers\/mcsup.pdf. Last accessed","author":"Supplemental","year":"2009","unstructured":"Supplemental results. http:\/\/www.cs.unm.edu\/~tnguyen\/Files\/Papers\/mcsup.pdf. Last accessed March 2009 . Supplemental results. http:\/\/www.cs.unm.edu\/~tnguyen\/Files\/Papers\/mcsup.pdf. Last accessed March 2009."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569903","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1569901.1569903","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:49Z","timestamp":1750249069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1569901.1569903"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":34,"alternative-id":["10.1145\/1569901.1569903","10.1145\/1569901"],"URL":"https:\/\/doi.org\/10.1145\/1569901.1569903","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}