Parallel ant colonies for combinatorial optimization problems

  • El-ghazali Talbi
  • Olivier Roux
  • Cyril Fonlupt
  • Denis Robillard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)


Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies to solve the quadratic assignment problem (QAP). Parallelism demonstrates that cooperation between communicating agents improve the obtained results in solving the QAP. It demonstrates also that high-performance computing is feasible to solve large optimization problems.


Local Search Tabu Search Combinatorial Optimization Problem Tabu List Quadratic Assignment Problem 
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.
    M. Dorigo. Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy, 1992.Google Scholar
  2. 2.
    M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Mans, and Cybernetics, 1 (26):29–41, 1996.CrossRefGoogle Scholar
  3. 3.
    L. Gambardella, E. Taillard, and M. Dorigo. Ant colonies for the qap. Technical Report 97-4, IDSIA, Lugano, Switzerland, 1997.Google Scholar
  4. 4.
    B. Bullnheimer, R. F. Hartl and C. Strauss. Applying the ant system to the vehicle routing problem. In 2nd Metaheuristics Int. Conf. MIC’97, Sophia-Antipolis, France, July 1997.Google Scholar
  5. 5.
    A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian. Ant system for job-shop scheduling. JORBEL—Belgian Journal of Operations Research, Statistics, and Computer Science, 34(1):39–53, 1994.zbMATHGoogle Scholar
  6. 6.
    R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive behavior, 5(2):169–207, 1997.Google Scholar
  7. 7.
    F. Glover. Tabu search-part I. ORSA Journal of Computing, 1(3):190–206, 1989.zbMATHGoogle Scholar
  8. 8.
    R. E. Burkard, S. Karisch, and F. Rendl. Quaplib: A quadratic assignment problem library. European Journal of Operational Research, 55:115–119, 1991.zbMATHCrossRefGoogle Scholar
  9. 9.
    E. G. Talbi, Z. Hafidi, and J.-M. Geib. Parallel adaptive tabu search for large optimization problems. In 2nd Metaheuristics International Conference MIC’97, pages 137–142, Sophia-Antipolis, France, July 1997.Google Scholar
  10. 10.
    E. D. Taillard and L. Gambardella, Adaptive memories for the quadratic assignment problem. Technical Report 87-97, IDSIA, Lugano, Switzerland, 1997.Google Scholar
  11. 11.
    C. Fleurent and J. A. Ferland. Genetic hybrids for the quadratic assignment problem. DIMACS Series in discrete Mathematics and Theoretical Computer Science, 16:173–188, 1994.zbMATHMathSciNetGoogle Scholar
  12. 12.
    P. Hansen and N. Mladenovic, An introduction to variable neighborhood search. In 2nd Metaheuristic Int. Conf., Sophia-Antipolis, France, 1997.Google Scholar
  13. 13.
    E-G. Talbi, J-M. Geib, Z. Hafidi, and D. Kebbal. A fault-tolerant parallel heuristic for assignment problems. In BioSP3 Workshop on Biologically Inspired Solutions to Parallel Processing Systems, in IEEE IPPS/SPDP’98 (Int. Parallel Processing Symposium /Symposium on Parallel and Distributed Processing.Google Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • El-ghazali Talbi
    • 1
  • Olivier Roux
    • 1
  • Cyril Fonlupt
    • 1
  • Denis Robillard
    • 2
  1. 1.LIFL URA-369 CNRSUniversité de Lille 1Villeneuve d’Ascq CedexFrance
  2. 2.LILUniversity of LittoralCalaisFrance

Personalised recommendations