{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:09:44Z","timestamp":1725505784589},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540786030"},{"type":"electronic","value":"9783540786047"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78604-7_2","type":"book-chapter","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T08:48:06Z","timestamp":1207126086000},"page":"13-24","source":"Crossref","is-referenced-by-count":2,"title":["A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Bart G. W.","family":"Craenen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"2_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":"2_CR2","unstructured":"Craenen, B.: Solving Constraint Satisfaction Problems with Evolutionary Algorithms. Doctoral dissertation, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands (November 2005)"},{"key":"2_CR3","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11844297_16","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN IX","author":"B. Craenen","year":"2006","unstructured":"Craenen, B., Paechter, B.: A tabu search evolutionary algorithm for solving constraint satisfaction problems. In: Runarsson, T.P., et al. (eds.) Parallel Problem Solving from Nature \u2013 PPSN IX. Lecture Notes on Computer Science, vol.\u00a04192, pp. 152\u2013161. Springer, Berlin (2006)"},{"key":"2_CR4","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":"2_CR5","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":"2_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E., Causmaecker, P.D.: VandenBerghe: 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":"2_CR7","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, MA (1998)"},{"issue":"3","key":"2_CR8","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"Kratica, J.: Improving performances of the genetic algorithm by caching. Computer and Artificial Intelligence\u00a018(3), 271\u2013283 (1999)","journal-title":"Computer and Artificial Intelligence"},{"key":"2_CR9","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":"2_CR10","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-49481-2_24","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, pp. 325\u2013339. Springer, Heidelberg (1998)"},{"key":"2_CR12","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)"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint-satisfaction problems. Artificial Intelligence\u00a014(3), 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P. Prosser","year":"1993","unstructured":"Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence\u00a09(3), 268\u2013299 (1993)","journal-title":"Computational Intelligence"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78604-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T16:06:32Z","timestamp":1557417992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78604-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540786030","9783540786047"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78604-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}