A study of distributed parallel processing for Queen Ant Strategy in ant colony optimization

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Volumn 2005, Issue , 2005, Pages 553-557

  Iimura, Ichiro ^a   Hamaguchi, Koji ^b   Ito, Toshiya ^c   Nakayama, Shigeru ^c  

^a PREFECTURAL UNIVERSITY OF KUMAMOTO   (Japan)

^b SVC Bldg   (Japan)

^c KAGOSHIMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER APPLICATIONS; COMPUTER SCIENCE; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; STRATEGIC PLANNING;

ANT COLONY OPTIMIZATION; DISTRIBUTED PARALLEL PROCESSING; PROCESSING METHOD; QUEEN ANT STRATEGY;

PARALLEL PROCESSING SYSTEMS;

EID: 33745123323     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2005.50     Document Type: Conference Paper

References (15)

1. E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm Intelligence - From Natural to Artificial Systems. Oxford University Press, New York, 1999.
2. B. Bullnheimer, R. F. Hartl, and C. Strauss. A new rank based version of the ant system: A computational study. Central European Journal for Operations Research and Economics, 7(1):25-38, 1999.
3. M. Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, 1992.
4. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Trans. Systems, Man, and Cybernetics Part B: Cybernetics, 26(1):29-41, 1996.
5. M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, Cambridge, Massachusetts, London, England, 2004.
6. E. Freeman, S. Hupfer, and K. Arnold. JavaSpaces Principles, Patterns, and Practice. Addison-Wesley, Reading, Mass., 1999.
7. D. Gelernter. Generative communication in Linda. ACM Trans. Program. Lang. Syst., 7(1):80-112, 1985.
8. I. Iimura, S. Ikehata, and S. Nakayama. Consideration on Noah's ark strategy in parallel genetic algorithm with object-shared space. JSIK Journal, 13(2):1-17, 2003. (in Japanese).
9. I. Iimura, S. Ikehata, and S. Nakayama. Noah's ark strategy for avoidance of excess convergence by a parallel genetic algorithm with an object-shared space. In Proc. 4th International Conference on PDCAT, pages 527-531, 2003.
10. I. Iimura, T. Matsudome, T. Nakanishi, and S. Nakayama. Consideration on individuality ant strategy by ant colony optimization in traveling salesman problem. IEICE Trans., J88-D-I(4):900-905, 2005. (in Japanese).
11. I. Iimura, T. Matsudome, and S. Nakayama. Consideration on queen ant strategy in ant colony optimization. IEICE Trans., J88-D-I(10), 2005. (in Japanese) (in press).
12. I. Iimura, K. Matsuoka, and S. Nakayama. Consideration on islands' distance strategy in a genetic local search based on one-dimensional torus type island model. IEEJ Trans., 125-C(1):84-92, 2005. (in Japanese).
13. Y. Nakamichi and T. Arita. The effects of diversity control based on random selection in ant colony optimization. IPSJ Journal, 43(9):2939-2947, 2002. (in Japanese).
14. H. Tsurusawa, I. Iimura, and S. Nakayama. Experiment on object persistency in distributed parallel processing for prime factorization. JSIK Journal, 14(3):50-54, 2004. (in Japanese).
15. Y. Yamamoto and M. Kubo. Invitation to Traveling Salesman Problem. ASAKURA Publishing, Tokyo, 1997. (in Japanese).