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

How to Cite

Riff Rojas, M. C. (2000). A criteria to select genetic operators for solving CSP. Journal of Computer Science and Technology, 1(02), 13 p. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/1013

Issue

Vol. 1 No. 02 (2000): Second Issue

Section

Original Articles

License

 

Copyright and Licensing

Articles accepted for publication will be licensed under the Creative Commons BY-NC. Authors must sign a non-exclusive distribution agreement after article acceptance.