First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)
Combining Immune with Ant Colony Algorithm for Geometric Constraint Solving
Adelaide, Australia
January 23-January 24
ISBN: 0-7695-3090-7
Geometric Constraint Problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on Ant Colony Optimization algorithm and the immune system model is proposed to provide solution to the Geometric Constraints Problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving Geometric constraint problem.
Citation:
Hua Yuan, Yi Li, Wenhui Li, Kong Zhao, Duo Wang, Rongqin Yi, "Combining Immune with Ant Colony Algorithm for Geometric Constraint Solving," wkdd, pp.524-527, First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008), 2008