Abstract: The traveling salesman problem (TSP), can be used as a typical combinatorial optimization problem, to describe a wide variety of practical engineering optimization problems in various fields ...

Abstract: A traveling salesman problem (TSP) is a well-known NP-complete problem. Traditional TSP presumes that the locations of customers and the traveling time among customers are fixed and constant ...