×

Ant colony system with communication strategies. (English) Zbl 1094.90053

Summary: An ant colony system (ACS) with communication strategies is developed. The artificial ants are partitioned into several groups. Seven communication methods for updating the pheromone level between groups in ACS are proposed and work on the traveling salesman problem using our system is presented. Experimental results based on three well-known traveling salesman data sets demonstrate the proposed ACS with communication strategies are superior to the existing ant colony system (ACS) and ant system (AS) with similar or better running times.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90B99 Operations research and management science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: F. Varela, P. Bourgine (Eds.), First Eur. Conference Artificial Life, 1991, pp. 134-142; A. Colorni, M. Dorigo, V. Maniezzo, Distributed optimization by ant colonies, in: F. Varela, P. Bourgine (Eds.), First Eur. Conference Artificial Life, 1991, pp. 134-142
[2] Dorigo, M.; Maniezzo, V.; Colorni, A., Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, 26, 1, 29-41 (1996)
[3] Dorigo, J. M.; Gambardella, L. M., Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 1, 53-66 (1997)
[4] Maniezzo, V.; Colorni, A., The ant system applied to the quadratic assignment problem, IEEE Transactions on Knowledge and Data Engineering, 11, 5, 769-778 (1999)
[5] Parpinelli, R. S.; Lopes, H. S.; Freitas, A. A., Data mining with an ant colony optimization algorithm, IEEE Transactions on Evolutionary Computation, 6, 4, 321-332 (2002)
[6] Bland, J. A., Space-planning by ant colony optimization, International Journal of Computer Applications in Technology, 12, 6, 320-328 (1999)
[7] Dorigo, M.; Caro, G. D.; Gambardella, L. M., Ant algorithms for discrete optimization, Artificial Life, 5, 2, 137-172 (1999)
[8] B. Bullnheimer, G. Kotsis, C. Strauss, Parallelization strategies for the ant system, Technical Report POM 9/97, Institute of Applied Computer Science, University of Vienna, Austria, 1997; B. Bullnheimer, G. Kotsis, C. Strauss, Parallelization strategies for the ant system, Technical Report POM 9/97, Institute of Applied Computer Science, University of Vienna, Austria, 1997 · Zbl 0942.65065
[9] Stützle, T., Parallelization strategies for ant colony optimization, (Fifth International Conference on Parallel Problem Solving for Nature. Fifth International Conference on Parallel Problem Solving for Nature, Lecture Notes in Computer Science, vol. 1498 (1998), Springer-Verlag: Springer-Verlag Berlin, Heidelberg), 722-731
[10] J.P. Cohoon, S.U. Hegde, W.N. Martine, D. Richards, Punctuated equilibria: a parallel genetic algorithm, in: Second International Conference on Genetic Algorithms, 1987, pp. 148-154; J.P. Cohoon, S.U. Hegde, W.N. Martine, D. Richards, Punctuated equilibria: a parallel genetic algorithm, in: Second International Conference on Genetic Algorithms, 1987, pp. 148-154
[11] Pan, J. S.; McInnes, F. R.; Jack, M. A., Application of parallel genetic algorithm and property of multiple global optima to vq codevector index assignment for noisy channels, Electronics Letters, 32, 4, 296-297 (1996)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.