{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:32:40Z","timestamp":1742981560538,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_16","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"152-161","source":"Crossref","is-referenced-by-count":3,"title":["A Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"B. G. W.","family":"Craenen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Paechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TEVC.2003.816584","volume":"7","author":"B. Craenen","year":"2003","unstructured":"Craenen, B., Eiben, A., van Hemert, J.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computing\u00a07(5), 424\u2013445 (2003)","journal-title":"IEEE Transactions on Evolutionary Computing"},{"key":"16_CR2","unstructured":"Craenen, B.: Solving Constraint Satisfaction Problems with Evolutionary Algorithms. Doctoral dissertation, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands (2005)"},{"key":"16_CR3","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Reeves, C. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 70\u2013141. Blackwell Scientific Publishing, Oxford, England (1993)"},{"key":"16_CR4","unstructured":"Costa, D.: An evolutionary tabu search algorithm and the nhl scheduling problem. Orwp 92\/11, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne, D\u00e9partement de Math\u00e9matiques, Chaire de Recherche Op\u00e9rationelle (1992)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E., Causmaecker, P.D., Berghe, V.: A hybrid tabu search algorithm for the nurse rostering problem. In: Proceedings of the Second Asia-Pasific Conference on Simulated Evolution and Learning. Applications IV, vol.\u00a01, pp. 187\u2013194 (1998)","DOI":"10.1007\/3-540-48873-1_25"},{"key":"16_CR6","first-page":"213","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Greistorfer","year":"1998","unstructured":"Greistorfer, P.: Hybrid genetic tabu search for a cyclic scheduling problem. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 213\u2013229. Kluwer Academic Publishers, Boston (1998)"},{"key":"16_CR7","unstructured":"Rossi, F., Petrie, C., Dhar, V.: On the equivalence of constrain satisfaction problems. In: Aiello, L. (ed.) Proceedings of the 9th European Conference on Artificial Intelligence (ECAI 1990), Stockholm, Pitman, pp. 550\u2013556 (1990)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"E. MacIntyre","year":"1998","unstructured":"MacIntyre, E., Prosser, P., Smith, B., Walsh, T.: Random constraint satisfaction: theory meets practice. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, Springer, Heidelberg (1998)"},{"key":"16_CR9","first-page":"116","volume-title":"Proceedings of the 3rd International Conference on Genetic Algorithms","author":"D. Whitley","year":"1989","unstructured":"Whitley, D.: The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Schaffer, J. (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, San Mateo, California, pp. 116\u2013123. Morgan Kaufmann Publisher, Inc., San Francisco (1989)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:05:34Z","timestamp":1664240734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11844297_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}