我想知道像禁忌搜索这样的元启发式算法的计算复杂度是多少。为什么在原论文中没有讨论算法的时间和空间复杂度，甚至没有讨论迭代禁忌搜索和反应禁忌搜索等算法的改进？
我想和其他人一起分析旅行商问题的算法。
begin
T:= [ ];
s:=initial solution;
s*:=s
repeat
find the best admissible s’ є N(s);
if f(s’) > f(s*) then s*:=s’
s:=s’;
update tabu list T;
until stopping criterion:
end;
This algorithm is not population-base algorithms. this do is very similar to a typical derivation, so it does not matter how to execute it in finding the very important problem. It is true that in previous scientific discussions there has not been much talk about this issue because several algorithms have been developed to solve a problem that works better than tabu algorithm.