求解旅行商问题的人工协同搜索算法

针对传统人工协同搜索（ACS）算法求解精度不高、收敛速度慢等问题，提出一种基于Sigmoid函数的反向人工协同搜索（SQACS）算法求解旅行商问题（TSP）。首先，利用Sigmoid函数构造比例因子，增强算法的全局搜索能力；其次，在变异阶段，加入差分进化（DE）算法的DE/rand/1变异策略，对当前种群进行二次变异，提高算法的计算精度和种群的多样性；最后，在算法后期的开发阶段，引入拟反向学习策略，进一步提高解的质量。对TSP测试库TSPLIB中的4个实例进行仿真实验，结果显示，SQACS算法在最短路径与花费时间上均优于麻雀搜索算法（SSA）、DE、阿基米德算法（AOA）等7种对比算法，并且具有良好的鲁棒性；与其他求解TSP的改进算法综合对比，SQACS算法也显示了良好的性能。实验结果表明，SQACS算法在求解小规模TSP时是有效的。

Artificial cooperative search algorithm for solving traveling salesman problems

Concerning low solution accuracy and slow convergence of traditional Artificial Cooperative Search （ACS） algorithm， a Quasi opposition Artificial Cooperative Search algorithm based on Sigmoid function （SQACS） algorithm was proposed to solve Traveling Salesman Problem （TSP）. Firstly， the Sigmoid function was used to construct the scale factor to enhance the global search ability of the algorithm. Then， in the mutation stage， the mutation strategy DE/rand/1 of Differential Evolution （DE） algorithm was introduced into the current population for secondary mutation， thereby improving the calculation accuracy of the algorithm and the diversity of the population. Finally， in the later development stage， the quasi opposition learning strategy was introduced to further improve the quality of the solution. Four instances in TSP test library TSPLIB were used to perform simulation experiments， and the results show that SQACS algorithm is superior to seven comparison algorithms such as Sparrow Search Algorithm （SSA）， DE and Archimedes Optimization Algorithm （AOA） in the shortest path and time consumption， and has good robustness； and compared with other improved algorithms for solving TSP comprehensively， SQACS algorithm also shows good performance. Experimental results prove that the SQACS algorithm is effective in solving small-scale TSPs.