{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:49:15Z","timestamp":1725475755830},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678465"},{"type":"electronic","value":"9783540449089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721187_17","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T17:56:59Z","timestamp":1167415019000},"page":"231-241","source":"Crossref","is-referenced-by-count":1,"title":["Co-operative Improvement for a Combinatorial Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Roux","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Fonlupt","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Robilliard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Bachelet, V., Preux, P., Talbi, E.G.: Hybrid parallel heuristics: Application to the quadratic assignment problem. In: Parallel Optimization Colloquium, POC 1996, Versailles, France (March 1996)"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. on Computing\u00a06, 126\u2013140 (1994)","journal-title":"ORSA J. on Computing"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","first-page":"24","volume-title":"Evolutionary Computing","author":"G. Bilchev","year":"1995","unstructured":"Bilchev, G., Parmee, I.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol.\u00a0993, pp. 24\u201339. Springer, Heidelberg (1995)"},{"key":"17_CR4","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank based version of the ant system: A computational study. Working paper, University of Vienna, Austria (1997)"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","volume":"10","author":"R.E. Burkard","year":"1997","unstructured":"Burkard, R.E., Karisch, S.E., Rendl, F.: Qaplib - a quadratic assignment problem library. Journal of Global Optimization-10, 391\u2013403 (1997)","journal-title":"Journal of Global Optimization-"},{"key":"17_CR6","unstructured":"Di Caro, G., Dorigo, M.: Antnet: A mobile agents approach to adaptive routing. Technical Report IRIDIA\/97-12, IRIDIA, Universit Libre de Bruxelles, Belgium (1997)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the qap. Eur. J. Op. Res.\u00a046, 93\u2013100 (1990)","journal-title":"Eur. J. Op. Res."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Costa, D., Hertz, A.: Ants can colour graphs. Journal of the Operational Research Society\u00a0(48), 295\u2013305 (1997)","DOI":"10.1038\/sj.jors.2600357"},{"key":"17_CR9","unstructured":"Cung, V.-D., Mautor, T., Michelon, P., Tavares, A.: A scatter search based approach for the quadratic assignment problem. In: Proceedings of the IEEE Internatinnal Conference on Evolutionary Computation and Evolutionary Programming, ICEC 1997, Indianapolis, USA, pp. 165\u2013170 (1997)"},{"key":"17_CR10","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy (1992)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, L.M.: A study of some properties of ant-q. In: Proceedings of PPSN IV-Fourth -International Conference on Parallel Problem Solving From Nature, Berlin, Germany, September 22-27, pp. 656\u2013665 (1996)","DOI":"10.1007\/3-540-61723-X_1029"},{"issue":"26","key":"17_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"1- Part B","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics\u00a01- Part B(26), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Fleurent, C., Ferland, J.: Genetic hybrids for the quadratic assignment problem. DIMACS Serie in Mathematics and Theoretical Computer Science\u00a016 (1994)","DOI":"10.1090\/dimacs\/016\/08"},{"key":"17_CR14","first-page":"252","volume-title":"Proceedings of ML-95 - Twelfth International Conference on Machine Learning","author":"L.M. Gambardella","year":"1995","unstructured":"Gambardella, L.M., Dorigo, M.: Ant-q: A reinforcement learning approach to the traveling salesman problem. In: Prieditis, A., Russell, S. (eds.) Proceedings of ML-95 - Twelfth International Conference on Machine Learning, Tahoe City, pp. 252\u2013260. Morgan Kaufmann, San Francisco (1995)"},{"key":"17_CR15","unstructured":"Gambardella, L.M., Taillard, E., Dorigo, M.: Ant colonies for the qap. Accepted for publication in the Journal of the Operational Research Society (1998)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Glove, F.: Tabu search. Journal of Computing\u00a0Part I (1(3)), 190\u2013206 (1989)","DOI":"10.1287\/ijoc.1.3.190"},{"key":"17_CR17","unstructured":"Hafidi, Z., Talbi, E.-G., Geib, J.-M.: Mars: Un ordonnanceur adaptatif d\u2019applications paralli\u00e8les dans un environnement multi-utilisateurs. In: RenPar\u20198- 8me Rencontres Francophones du Paralllisme, Bordeaux, France, Mai 1996, pp. 37\u201340 (1996)"},{"key":"17_CR18","first-page":"53","volume":"25","author":"T.C. Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.J.: Assignment problems and localisation of activities. Economica\u00a025, 53\u201376 (1957)","journal-title":"Economica"},{"key":"17_CR19","first-page":"465","volume-title":"Internationnal Conference on Genetic Algorithms, ICGA 1997","author":"P. Merz","year":"1997","unstructured":"P Merz and B. Freileben. A genetics local search to the quadratic assignment problem. In Internationnal Conference on Genetic Algorithms, ICGA\u201997, pages 465{472, New Lancing, Michigan, USA, 1997."},{"key":"17_CR20","first-page":"556","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. Journal of ACM- 23, 556\u2013565 (1976)","journal-title":"Journal of ACM-"},{"key":"17_CR21","first-page":"556","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. Journal of ACM- 23, 556\u2013565 (1976)","journal-title":"Journal of ACM-"},{"issue":"2","key":"17_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1177\/105971239700500203","volume":"5","author":"R. Schoonderwoerd","year":"1997","unstructured":"Schoonderwoerd, R., Holland, O., Bruten, J., Rothbrantz, L.: Ant-based load balancing in telecommunications networks. Adaptive Behaviour\u00a05(2), 169\u2013207 (1997)","journal-title":"Adaptive Behaviour"},{"issue":"1","key":"17_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"Skorin-Kapov, J.: Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing\u00a02(1), 33\u201345 (1990)","journal-title":"ORSA Journal on Computing"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Sondergeld, L., Vo\u03b2, S.: Meta-Heuristics: Theory and applications, pp. 489\u2013502. Kluwer Academic Publishers, Boston (1996)","DOI":"10.1007\/978-1-4613-1361-8_29"},{"key":"17_CR25","unstructured":"Sttzle, T., Hoos, H.: The max-min ant system and local search for the traveling salesman problem. In: IEEE Press (ed.) Proceedings of ICEC1997-IEEE 4th International Conference on Evolutionary Computation, pp. 308\u2013313 (1997)"},{"key":"17_CR26","unstructured":"St\u00fctzle, T.: Max-min ant system for quadratic. Technical Report AIDA-97-04, AIDA, Darmstadt University of Technology, Computer Science Department (1997)"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard, E.D.: Robust taboo search for the quadratique assignment problem. Parallel Computing\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"17_CR28","unstructured":"Taillard, E.D., Gambardella, L.: Adaptive memories for the quadratic assignement problems. Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland (1997)"},{"key":"17_CR29","unstructured":"Talbi, E.-G., Hafidi, Z., Geib, J.-M.: Parallel adaptive tabu search for large optimization problems. In: MIC 1997-2nd Metaheuristics International Conference, Sophia Antipolis, France (Juillet 1997)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721187_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T11:40:24Z","timestamp":1556019624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721187_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678465","9783540449089"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/10721187_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}