中文摘要：

研究了LF蚁群聚类算法的改进问题。首次找准原则能够克服算法运行初期蚂蚁长时间遇不到待处理对象的现象,使得不同的蚂蚁一开始就能遇上不同对象。在LF算法中,当蚂蚁未负载且对当前对象试图执行拾起操作时,若不转移该对象,则采用位置相邻原则来预选下一个待处理对象。当蚂蚁负载且对当前对象试图执行放下操作时,则采用对象间相邻原则来选择相应的放置位置。改进后的算法既可以独立处理聚类问题,又可以作为其他算法的预处理步骤,具有一定的应用价值。

英文摘要：

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.