Dr. Li’s research focuses on new search method to solve the traveling salesman problem (TSP). More specially, this new method uses multi-start local search to construct the solution attractor, search all solutions in the attractor, and then identify the globally optimal solution. He has used this method to tackle classic TSP, multi-objective TSP, dynamic TSP, and probabilistic TSP.
