论文部分内容阅读
提出一种根据搜索进展自适应设定门槛值和邻域搜索次数的改进TA算法．对无优先级双目标FlowShop问题进行求解，并与现有启发式算法进行了比较．计算比较结果表明：所提算法可以求得稳定、高质量的解．
This paper proposes an improved TA algorithm that adaptively sets the threshold and neighborhood search times according to the search progress. The problem of non-prioritized bi-objective FlowShop problem is solved and compared with the existing heuristic algorithm. Computation results show that the proposed algorithm can obtain stable and high quality solution.