can essentially influence LSS算法 the quality of the result: arbitrary poor local LSS(Neigh)-Local Searh Sc. optima a neighborhood Neigh Input: An input instance z of an optimization problem U. Step 1:Finda feasible solution a E M(x) Step 2:while ag LocOPTu(x,Neigh)do begin fir∈Neigh cost(B)<cla)i first improvement,best cost(B)>cost improvement end may lead to very different Output:output(a). results for the same initial feasible solution. LSS算法一定能找到局w Find对结果的优劣和算法的效率是有影响的LSS算法 LSS算法一定能找到局部最优！但上述两个 Find对结果的优劣和算法的效率是有影响的 can essentially influence the quality of the result： arbitrary poor local optima first improvement, best improvement may lead to very different results for the same initial feasible solution