辽宁大学智能控制蚁群优化算法.ppt

TSP蚁群算法ant-cycle Step 4.1 For k:=1 to m do Move the k-th ant from tabuk(n) to tabuk(1) Compute the length Lk of the tour described by the k-th ant Update the shortest tour found TSP蚁群算法ant-cycle Step