: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
— Fuzzy Cognitive Maps (FCMs) are a class of discrete-time Artificial Neural Networks that are used to model dynamic systems. A recently introduced supervised learning method, wh...
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that...
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...