A criteria to select genetic operators for solving CSP

• Autores: María Cristina Riff Rojas
• Localización: Journal of Computer Science and Technology, ISSN-e 1666-6038, Vol. 1, Nº. 2, 2000 (Ejemplar dedicado a: Second Issue; 2 p.)
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Our interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of problems. In this paper we propose a criterion to be able to evaluate the perfomance of genetic operators within evolutionary algorithms that solve CSp.