Wang, Yong; Xu, Ning - In: International Journal of Applied Metaheuristic … 8 (2017) 3, pp. 53-65
Traveling salesman problem (TSP) is one well-known NP-Complete problem. The objective is to search the optimal Hamiltonian circuit (OHC) in a tourist map. The particle swarm optimization (PSO) integrated with the four vertices and three lines inequality is introduced to detect the OHC or...