skip to main content
10.1145/2684103.2684163acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmommConference Proceedingsconference-collections
research-article

A Different Perspective on Parallel Sub-Ant-Colonies

Published: 08 December 2014 Publication History

Abstract

In the past, several parallel processing approaches were proposed to speed up the execution of the ant colony optimization. The approaches for parallel runs or multiple colonies usually set the ant number in each run or each colony the same as that in sequential ant colony optimization. In this paper, we revisit the parallel ant colony optimization from a different viewpoint, by partitioning a whole colony into sub-groups and analyze its behavior. An algorithm is proposed and experiments are conducted on the data of a traveling salesman problem to show the effectiveness of the proposed approach.

References

[1]
A. Colorni, M. Dorigo and V. Maniezzo, "Distributed optimization by ant colonies," the European Conference on Artificial Life, pp. 134--142, 1991.
[2]
M. Dorigo and C. Blum, "Ant colony optimization theory: A survey," Theoretical Computer Science, 344(2-3), pp. 243--278, 2005.
[3]
M. Dorigo and L. M. Gambardella, "Ant Colony System: A cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation, 1(1), pp. 53--66, 1997.
[4]
M. Dorigo and L. M. Gambardella, "Ant colonies for the traveling salesman problem," Biosystems, 43(2), pp. 73--81, 1997.
[5]
M. Dorigo, V. Maniezzo and A. Colorni, "Positive feedback as a search strategy," Dept. of Electronics, Polytechnic Univ. of Milan, Milan, Italy, Tech. Rep. 91-016, 1991.
[6]
M. Dorigo, V. Maniezzo, and A. Colorni, "Ant System: Optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man, and Cybernetics, Part B, 26(1), pp. 29--41, 1996.
[7]
T. P. Hong, Y. C. Lee and M. T. Wu, "Using master-slave parallel architecture for GA-fuzzy data mining," The 2005 IEEE International Conference on Systems, Man, and Cybernetics, pp. 3232--3237, 2005.
[8]
M. Manfrin, M. Birattari, T. Stützle and Dorigo, "Parallel ant colony optimization for the traveling salesman problem," The Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence, 2006.
[9]
M. Pedemonte, S. Nesmachnow and H. Cancela, "A survey on parallel ant colony optimization," Applied Soft Computing, 11(8), pp. 5181--5197, 2011.
[10]
E. G. Talbi, O. Roux, C. Fonlupt and D. Robillard, "Parallel ant colonies for combinatorial optimization problems," Parallel and Distributed Processing, vol 1856, pp. 239--247, 1999.
[11]
Universität Heidelberg, Library of Traveling Salesman Problems, {online} 1998, http://www.iwr.uniheidelberg.de/groups/comopt/ software/TSPLIB95/tsp/.
[12]
T. P. Hong, A Study of Parallel Processing and Noise Management on Machine Learning, Ph.D. Dissertation, National Chiao-Tung University, Taiwan, 1992.
[13]
M. Randall and A. Lewis, "A parallel implementation of Ant Colony Optimization," Journal of Parallel and Distributed Computing, 62(9), pp. 1421--1432, 2002.
[14]
T. Stutzle, "Parallelization strategies for ant colony optimization", Lecture Notes in Computer Science, Vol. 1498, pp. 722--741, 1998.
[15]
J. Xiong, X. Meng and C. Liu, "An improved parallel ant colony optimization based on message passing interface," The First International Conference on Advances in Swarm Intelligence, 6145, pp. 249--256, 2010.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
MoMM '14: Proceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia
December 2014
464 pages
ISBN:9781450330084
DOI:10.1145/2684103
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

  • JKU: Johannes Kepler Universität Linz

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 December 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Ant Colony Optimization
  2. Bio-inspired Computation
  3. Parallel Programming
  4. Sub-ant-colony

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

MoMM '14

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 37
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media