Improvement to the cooperative rules methodology by using the ant colony system algorithm.
Alcalá, Rafael ; Casillas, Jorge ; Cordón, Oscar ; Herrera, Francisco
Mathware and Soft Computing, Tome 8 (2001), p. 321-335 / Harvested from Biblioteca Digital de Matemáticas

The cooperative rules (COR) methodology [2] is based on a combinatorial search of cooperative rules performed over a set of previously generated candidate rule consequents. It obtains accurate models preserving the highest interpretability of the linguistic fuzzy rule-based systems. Once the good behavior of the COR methodology has been proven in previous works, this contribution focuses on developing the process with a novel kind of metaheuristic algorithm: the ant colony system one. Thanks to the capability of this algorithm to include heuristic information, the learning process is accelerated without model accuracy losses. Its behavior is successful compared with other processes based on genetic algorithms and sinlulated annealing when solving two modeling applications.

Publié le : 2001-01-01
DMLE-ID : 1971
@article{urn:eudml:doc:39230,
     title = {Improvement to the cooperative rules methodology by using the ant colony system algorithm.},
     journal = {Mathware and Soft Computing},
     volume = {8},
     year = {2001},
     pages = {321-335},
     zbl = {0996.68243},
     language = {en},
     url = {http://dml.mathdoc.fr/item/urn:eudml:doc:39230}
}
Alcalá, Rafael; Casillas, Jorge; Cordón, Oscar; Herrera, Francisco. Improvement to the cooperative rules methodology by using the ant colony system algorithm.. Mathware and Soft Computing, Tome 8 (2001) pp. 321-335. http://gdmltest.u-ga.fr/item/urn:eudml:doc:39230/