A criteria to select genetic operators for solving CSP

Authors

  • María Cristina Riff Rojas Universidad Técnica Federico Santa María, Valparaíso, Chile

Keywords:

Evolutionary Algorithms, Constraint Satisfaction, Specialized genetic operators

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2000-03-01

Issue

Section

Original Articles

How to Cite

[1]
“A criteria to select genetic operators for solving CSP”, JCS&T, vol. 1, no. 02, p. 13 p., Mar. 2000, Accessed: Jul. 08, 2025. [Online]. Available: https://journal.info.unlp.edu.ar/JCST/article/view/1013

Similar Articles

1-10 of 116

You may also start an advanced similarity search for this article.