Abstract

Evolutionary operators are applied and a number of societies of hill-climbers (SoHC), such as a genetic SoHC (GSoHC), and an evolutionary SoHC (ESoHC) are developed for solving randomly generated distributed asymmetric constraint satisfaction problems (DisACSPs). We compare GSoHCs using distributed restricted forms of single-point, two-point, modified two-point, and uniform crossover. The GSoHCs are also compared with an ESoHC that uses a distributed restricted form of uniform mutation and a simple SoHC which does not use any evolutionary operators. Our results show that the performance of single-point, two-point, and uniform crossover is similar. Both GSoHC and ESoHC have better performance than SoHC. Our results also show that the modified two-point crossover outperforms the other recombination operator on DisACSPs that are not near the phase transition.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call