Abstract:

An LF improved colony clustering algorithm is discussed. Capturing for first time principle can overcome the phenomenon that ants can not find the object to be processed in the initial period of algorithm operation, so that different ants can meet different objects at the beginning. In the LF algorithm, when ants are not loaded and try to execute pick up operation instructions, if they do not transfer the object, the next object to be processed will be chosen based on the location proximity principle. When ants are loaded and try to execute put down operation instructions, the appropriate placement will be selected based on the proximity principle of objects. The improved algorithm can not only deal with the clustering problem, but also can be used as a preprocessing step for other algorithms, and it has a certain application value.