Adjusting the simulated annealing algorithm to the impatient traveling salesman problem variation

摘要

In this paper, we concnetrate in investigations concerning strategies and heuristics for traveling salesman problem with impatience, a variation of the traveling salesman problem. We will focus on two particular methods (deccent algorithm and simulated annealing) and commpared their performances. We will also introduce a heuristic which will conduct the two algorithms to better results.