Sanza T. Kazadi

Learn More
In genetic search algorithms and optimization routines, the representation of the mutation and crossover operators are typically defaulted to the canonical basis. We show that this can be influential in the usefulness of the search algorithm. We then pose the question of how to find a basis for which the search algorithm is most useful. The conjugate schema(More)
In this paper we design swarm clustering algorithm to build, move and place clusters of building materials on the desired place on ¢ ¡ plane. Such algorithm consists of three phases: building clusters, moving them radially and then orbitally. We present an example that demonstrates desired cluster placement. In particular, it is shown that with proposed(More)
  • 1