Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Dorigo. Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano, Italy, 1992.
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.
L. Gambardella, E. Taillard, and M. Dorigo. Ant colonies for the qap. Technical Report 97-4, IDSIA, Lugano, Switzerland, 1997.
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.
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.
R. Schoonderwoerd, O. Holland, J. Bruten, and L. Rothkrantz. Ant-based load balancing in telecommunications networks. Adaptive behavior, 5(2):169–207, 1997.
F. Glover. Tabu search-part I. ORSA Journal of Computing, 1(3):190–206, 1989.
R. E. Burkard, S. Karisch, and F. Rendl. Quaplib: A quadratic assignment problem library. European Journal of Operational Research, 55:115–119, 1991.
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.
E. D. Taillard and L. Gambardella, Adaptive memories for the quadratic assignment problem. Technical Report 87-97, IDSIA, Lugano, Switzerland, 1997.
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.
P. Hansen and N. Mladenovic, An introduction to variable neighborhood search. In 2nd Metaheuristic Int. Conf., Sophia-Antipolis, France, 1997.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Talbi, Eg., Roux, O., Fonlupt, C., Robillard, D. (1999). Parallel ant colonies for combinatorial optimization problems. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097905
Download citation
DOI: https://doi.org/10.1007/BFb0097905
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive