Parallel Ant System Based on OpenMP

Article Preview

Abstract:

To overcome the limitation of precocity and stagnation in classical ant colony algorithm, this article presents a Parallel Ant System Based on OpenMP. The ant colony is divided into three children ant colonies according to the characteristics of natural ant colony multi-group and pheromone updating features of ant colony algorithm. By Open Multi-Processing parallel programming idea, the parallel and cooperating optimization of children ant colonies was obtained. It organically combines local search and global search, makes full use of computing power of multi-core CPU, and improves the efficiency significantly. Contrastive experiments show that the algorithm has a better capability of global optimization than traditional ant colony algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

658-661

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Colorni, A., Dorigo, M., & Maniezzo, V. (1991, December). Distributed optimization by ant colonies. In Proceedings of the first European conference on artificial life (Vol. 142, pp.134-142).

Google Scholar

[2] Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on, 26(1), 29-41.

DOI: 10.1109/3477.484436

Google Scholar

[3] Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on, 1(1), 53-66.

DOI: 10.1109/4235.585892

Google Scholar

[4] Gambardella, L. M., Taillard, E. D., & Dorigo, M. (1997). Ant colonies for the QAP. Technical Report 4-97, IDSIA, Lugano, Switzerland, 1997. Accepted for publication in the Journal of the Operational Research Society (JORS).

Google Scholar

[5] Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant System algorithm for the vehicle Routing Problem. Annals of Operations Research, 89, 319-328.

DOI: 10.1023/a:1018940026670

Google Scholar

[6] Costa, D., & Hertz, A. (1997). Ants can colour graphs. Journal of the operational Research Society, 48(3), 295-305.

DOI: 10.1057/palgrave.jors.2600357

Google Scholar

[7] Gambardella, L. M., & Dorigo, M. (1997). HAS-SOP: Hybrid ant system for the sequential ordering problem.

Google Scholar

[8] OpenMP. http: /en. wikipedia. org/wiki/OpenMP.

Google Scholar