{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:08Z","timestamp":1761596948091},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T00:00:00Z","timestamp":1139961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10852-005-9029-7","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T11:01:18Z","timestamp":1139914878000},"page":"5-22","source":"Crossref","is-referenced-by-count":48,"title":["COSEARCH: A Parallel Cooperative Metaheuristic"],"prefix":"10.1007","volume":"5","author":[{"given":"El-Ghazali","family":"Talbi","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Bachelet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,15]]},"reference":[{"key":"9029_CR1","unstructured":"Bachelet, V.: M\u00e9taheuristiques parall\u00e8les hybrides: application au probl\u00e8me d'affectation quadratique. PhD thesis, Universit\u00e9 des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1999."},{"key":"9029_CR2","unstructured":"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."},{"key":"9029_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R. Burkard","year":"1991","unstructured":"Burkard, R., Karisch, S. and Rendl, F.: QAPLIB: a quadratic assignment problem library, Eur. J. Oper. Res. 55 (1991), 115\u2013119.","journal-title":"Eur. J. Oper. Res."},{"key":"9029_CR4","doi-asserted-by":"crossref","unstructured":"\u00c7ela, E.: The Quadratic Assignment Problem, Theory and Algorithms, Kluwer, 1998.","DOI":"10.1007\/978-1-4757-2787-6"},{"key":"9029_CR5","unstructured":"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\u00e9 de Montreal, 1993."},{"key":"9029_CR6","doi-asserted-by":"crossref","unstructured":"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\u20132321.","DOI":"10.1109\/CEC.1999.785563"},{"key":"9029_CR7","unstructured":"Englemore, R. and Morgan, T. (eds.): Blackboard Systems, Addison-Wesley, 1988."},{"key":"9029_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","volume":"16","author":"C. Fleurent","year":"1994","unstructured":"Fleurent, C. and Ferland, A.: Genetic hybrids for the quadratic assignment problem, DIMACS Ser. Discret. Math. Theor. Comput. Sci. 16 (1994), 173\u2013188.","journal-title":"DIMACS Ser. Discret. Math. Theor. Comput. Sci."},{"key":"9029_CR9","volume-title":"Computers and Intractability: A Guide to the Theory on NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and Johnson, D.: Computers and Intractability: A Guide to the Theory on NP-completeness, W.H. Freeman and Co., New York, 1979."},{"key":"9029_CR10","unstructured":"Glover, F.: Tabu search fundamentals and uses. Technical report, University of Colorado Boulder, Graduate School of Business, 1995."},{"key":"9029_CR11","unstructured":"Glover, F. and Laguna, M.: Modern Heuristic Techniques For Combinatorial Problems, Chapt. 3, Blackwell Scientific Publications, 1992, pp. 70\u2013150."},{"key":"9029_CR12","volume-title":"International Conference on Genetic Algorithms and their Applications (ICGATA)","author":"D. Goldberg","year":"1985","unstructured":"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."},{"key":"9029_CR13","unstructured":"Hogg, T. and Huberman, A. (eds.): Better than the Best: The Power of Cooperation, Addison-Wesley, 1993."},{"key":"9029_CR14","doi-asserted-by":"crossref","unstructured":"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\u20132070.","DOI":"10.1109\/CEC.1999.785529"},{"issue":"4","key":"9029_CR15","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P. Merz","year":"2000","unstructured":"Merz, P. and Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Trans. Evol. Comput. 4(4) (2000), 337\u2013352.","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9029_CR16","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures=Evolution Programs, Third, Revised and extended Edition, Springer, 1996. ISBN 3-540-60676-9.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"9029_CR17","doi-asserted-by":"crossref","unstructured":"Milano, M. and Roli, A.: MAGMA: A multiagent architecture for metaheuristics, IEEE Trans. Systems, Man Cybernetics Part B 34(2) 2004.","DOI":"10.1109\/TSMCB.2003.818432"},{"key":"9029_CR18","unstructured":"Namyst, R. and M\u00e9haut, J.: PM $$^2$$ : parallel multithreaded machine. A computing environment for distributed architectures, in Parco'95, Gent, Belgium, 1995, pp. 279\u2013285."},{"key":"9029_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/016\/01","volume":"16","author":"P. Pardalos","year":"1994","unstructured":"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\u201342.","journal-title":"DIMACS Ser. Discret. Math. Theor. Comput. Sci."},{"key":"9029_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013312.","DOI":"10.1007\/978-1-4615-5775-3_21"},{"key":"9029_CR21","volume-title":"Multiple Criteria Optimization: Theory, Computation and Application","author":"R. Steuer","year":"1986","unstructured":"Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application, Wiley, 1986."},{"key":"9029_CR22","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem, Parallel Comput. 17 (1991), 443\u2013455.","journal-title":"Parallel Comput."},{"key":"9029_CR23","unstructured":"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 ."},{"issue":"1","key":"9029_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"E. D. Taillard","year":"2001","unstructured":"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\u201316.","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9029_CR25","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.-G. Talbi","year":"2002","unstructured":"Talbi, E.-G.: A taxonomy of hybrid metaheuristics, Journal of Heuristics 8(2) (2002), 541\u2013564.","journal-title":"Journal of Heuristics"},{"key":"9029_CR26","unstructured":"Talbi, E.-G. and Bachelet, V.: A landscape-based taxonomy for the quadratic assignment problem. Technical report, LIFL \u2013 University of Lille, Lille, France, 2005."},{"key":"9029_CR27","unstructured":"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."},{"key":"9029_CR28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1009669824615","volume":"4","author":"S. Talukdar","year":"1998","unstructured":"Talukdar, S., Baerentzen, L., Gove, A. and de Souza, P.: Asynchronous teams: cooperation schemes for autonomous agents, Journal of Heuristics 4 (1998), 295\u2013321.","journal-title":"Journal of Heuristics"},{"key":"9029_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013542.","DOI":"10.1007\/3-540-48311-X_75"},{"key":"9029_CR30","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-45365-2_15"},{"key":"9029_CR31","unstructured":"Whitley, D.: GENITOR: A different genetic algorithm, in Proc. of the Rocky Mountain Conference on Artificial Intelligence, Denver, CO, USA, 1988."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9029-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9029-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9029-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:29Z","timestamp":1559269589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9029-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["9029"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9029-7","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,15]]}}}