Coloured Ant System and Local Search to Design Local Telecommunication Networks

  • Roberto Cordone
  • Francesco Maffioli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


This work combines local search with a variant of the Ant System recently proposed for partitioning problems with cardinality constraints. The Coloured Ant System replaces the classical concept of trail with p trails of different “colours”, representing the assignment of an element to one of the classes in the partition. We apply the method with promising results to the design of local telecommunication networks. The combination of the Coloured Ant System with local search yields much better results than the two approaches alone.


Local Search Penalization Factor Greedy Heuristic Quadratic Assignment Problem Span Forest 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Patterson, E. Rolland, and H. Pirkul. A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. Working paper, University of California, Riverside, September 4th, 1998.zbMATHGoogle Scholar
  2. 2.
    R. Cordone and F. Maffioli. A coloured ant system approach to graph tree partition. In Proceedings of the ANTS’ 2000 Conference, Brussels, Belgium, September, 2000.Google Scholar
  3. 3.
    R. Cordone and F. Maffioli. On graph tree partition problems. In Proceedings of EURO XVII, Budapest, Hungary, July 16-19th, 2000.Google Scholar
  4. 4.
    N. Guttmann-Beck and R. Hassin. Approximation algorithms for minimum tree partition. Discrete Applied Mathematics, 87(1-3):117–137, October 1st, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    A. Amberg, W. Domschke, and S. Voß. Capacitated minimum spanning trees: Algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1:9–39, 1996.Google Scholar
  6. 6.
    K. Altinkemer and B. Gavish. Heuristics with constant error guarantees for the design of tree networks. Management Science, 32:331–341, 1988.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    C. Imielińska, B. Kalantari, and L. Khachiyan. A greedy heuristic for a minimum weight forest problem. Operations Research Letters, 14:65–71, September 1993.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    M. Dorigo, V. Maniezzo, and A. Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics, 26(1):29–41, 1996.CrossRefGoogle Scholar
  9. 9.
    D. Costa and A. Hertz. Ants can colour graphs. Journal of Operational Research Society, 48:295–305, 1997.CrossRefzbMATHGoogle Scholar
  10. 10.
    V. Maniezzo and A. Colorni. The ant system applied to the quadratic assignment problem. IEEE Transactions on Knowledge and Data Engineering, 1999.Google Scholar
  11. 11.
    T. Stützle and H. Hoos. The MAX-MIN Ant System and local search for the traveling salesman problem. In T. Bäck, Z. Michalewicz, and X. Yao, editors, Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pages 309–314, Piscataway, NJ, 1997. IEEE Press.Google Scholar
  12. 12.
    M. Dorigo and L.M. Gambardella. A study of some properties of Ant-Q. Lecture Notes in Computer Science, 1141:656–665, 1996.Google Scholar
  13. 13.
    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):53–66, April 1997.CrossRefGoogle Scholar
  14. 14.
    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.MathSciNetzbMATHGoogle Scholar
  15. 15.
    L.M. Gambardella, E. Taillard, and G. Agazzi. Ant colonies for vehicle routing problems. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, 1999.Google Scholar
  16. 16.
    R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389, 1957.CrossRefGoogle Scholar
  17. 17.
    M. Gendreau, J.-F. Larochelle, and B. Sansò. A tabu search heuristic for the Steiner tree problem. Networks, 34(2):162–172, September 1999.MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    J.E. Beasley. OR-Library., 1999.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Roberto Cordone
  • Francesco Maffioli
    • 1
  1. 1.DEI - Politecnico di MilanoItaly

Personalised recommendations