Abstract
In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bachelet, V.: Métaheuristiques parallèles hybrides: application au problème d'affectation quadratique. PhD thesis, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1999.
Bessiere, P., Ahuactzin, J. Talbi, E.-G. and Mazer, E.: The Ariadne's clew algorithm: global planning with local methods, in IEEE International Conference on Intelligent Robots Systems IROS, Yokohama, Japan, 1993.
Burkard, R., Karisch, S. and Rendl, F.: QAPLIB: a quadratic assignment problem library, Eur. J. Oper. Res. 55 (1991), 115–119.
Çela, E.: The Quadratic Assignment Problem, Theory and Algorithms, Kluwer, 1998.
Crainic, T., Toulouse, M. and Gendreau, M.: Towards a taxonomy of parallel tabu search algorithms. Technical Report CRT-933, Centre de Recherche sur les Transports, Université de Montreal, 1993.
Denzinger, J. and Offerman, T.: On cooperation between evolutionary algorithms and other search paradigms, in International Congress of Evolutionary Computation (CEC'99), IEEE, 1999, pp. 2317–2321.
Englemore, R. and Morgan, T. (eds.): Blackboard Systems, Addison-Wesley, 1988.
Fleurent, C. and Ferland, A.: Genetic hybrids for the quadratic assignment problem, DIMACS Ser. Discret. Math. Theor. Comput. Sci. 16 (1994), 173–188.
Garey, M. and Johnson, D.: Computers and Intractability: A Guide to the Theory on NP-completeness, W.H. Freeman and Co., New York, 1979.
Glover, F.: Tabu search fundamentals and uses. Technical report, University of Colorado Boulder, Graduate School of Business, 1995.
Glover, F. and Laguna, M.: Modern Heuristic Techniques For Combinatorial Problems, Chapt. 3, Blackwell Scientific Publications, 1992, pp. 70–150.
Goldberg, D. and Lingle, R.: Alleles, loci, and the traveling salesman problem, in International Conference on Genetic Algorithms and their Applications (ICGATA), Lawrence Erlbaum Associates, Pittsburgh, 1985.
Hogg, T. and Huberman, A. (eds.): Better than the Best: The Power of Cooperation, Addison-Wesley, 1993.
Merz, P. and Freisleben, B.: A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem, in International Congress of Evolutionary Computation (CEC'99), IEEE, 1999, pp. 2063–2070.
Merz, P. and Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Trans. Evol. Comput. 4(4) (2000), 337–352.
Michalewicz, Z.: Genetic Algorithms + Data Structures=Evolution Programs, Third, Revised and extended Edition, Springer, 1996. ISBN 3-540-60676-9.
Milano, M. and Roli, A.: MAGMA: A multiagent architecture for metaheuristics, IEEE Trans. Systems, Man Cybernetics Part B 34(2) 2004.
Namyst, R. and Méhaut, J.: PM\(^2\): parallel multithreaded machine. A computing environment for distributed architectures, in Parco'95, Gent, Belgium, 1995, pp. 279–285.
Pardalos, P., Rendl, F. and Wolkowicz, H.: The quadratic assignment problem: A survey and recent developments, DIMACS Ser. Discret. Math. Theor. Comput. Sci. 16 (1994), 1–42.
Sondergeld, L. and Voss, A.: Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization, Chapt. Cooperative intelligent search using adaptive memory techniques, Kluwer, 1999, pp. 297–312.
Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application, Wiley, 1986.
Taillard, E.: Robust taboo search for the quadratic assignment problem, Parallel Comput. 17 (1991), 443–455.
Taillard, E., Gambardella, L., Gendreau, M. and Potvin, J.-Y.: Adaptive Memory Programming: A Unified View of Meta-Heuristics. Technical Report IDSIA-19-98, IDSIA, Lugano, Switzerland. First version published in EURO XVI Conference Tutorial and Research Reviews booklet (semi-plenary session), Brussels, July 1998, 1998. Available at http://www.idsia.ch/~eric.
Taillard, E. D., Gambardella, L., Gendreau, M. and Potvin, J.: Adaptive memory programming: a unified view of metaheuristics, Eur. J. Oper. Res. 135(1) (2001), 1–16.
Talbi, E.-G.: A taxonomy of hybrid metaheuristics, Journal of Heuristics 8(2) (2002), 541–564.
Talbi, E.-G. and Bachelet, V.: A landscape-based taxonomy for the quadratic assignment problem. Technical report, LIFL – University of Lille, Lille, France, 2005.
Talbi, E.-G., Geib, J.-M., Hafidi, Z. and Kebbal, D.: MARS: an adaptive parallel programming environment, in R. Buyya (ed.), High Performance Cluster Computing, Vol. 1, Chapt. 4, Prentice Hall PTR, 1999.
Talukdar, S., Baerentzen, L., Gove, A. and de Souza, P.: Asynchronous teams: cooperation schemes for autonomous agents, Journal of Heuristics 4 (1998), 295–321.
Toulouse, M., Thulasiraman, K. and Glover, F.: A multi-level cooperative search: A new paradigm for combinatorial optimization and application to graph partitioning, in Euro-Par'99, 1999, pp. 533–542.
Weinberg, B., Bachelet, V. and Talbi, E.-G.: Using a co-evolutionnist heuristic for the assignment of the frequency in cellular networks, in First European Workshop on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2001), Lake Como, Italy, 2001.
Whitley, D.: GENITOR: A different genetic algorithm, in Proc. of the Rocky Mountain Conference on Artificial Intelligence, Denver, CO, USA, 1988.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Talbi, EG., Bachelet, V. COSEARCH: A Parallel Cooperative Metaheuristic. J Math Model Algor 5, 5–22 (2006). https://doi.org/10.1007/s10852-005-9029-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-005-9029-7