Yes, I worked, along with my students, in dynamic TSP. The paper uses Diploid Genetic Algorithms and has been selected in Soft Computing, Springer. The paper would be published in the coming week, after which I will give you the link. 

 Hello

TSP is undoubtedly one of the well studied research topics. Therefore I think it is better to narrow down your question and ask in more details. For example, do you need information related to recent advances in exact, heuristics or meta-heuristic approaches for TSP? In any of these cases you can find numerous articles and research papers.

I recently published a new Evolutionary Algorithm for the TSP. It was able to solve to optimality instances with more than 30,000 nodes. The source code is available on demand.

@inproceedings{Segura:2015,

author = {Segura, Carlos and Botello Rionda, Salvador and Hern\'{a}ndez Aguirre, Arturo and Valdez Pe\~{n}a, S. Ivvan},

title = {A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem},

booktitle = {Proceedings of the 2015 on Genetic and Evolutionary Computation Conference},

series = {GECCO '15},

year = {2015},

isbn = {978-1-4503-3472-3},

location = {Madrid, Spain},

pages = {489--496},

numpages = {8},

url = {http://doi.acm.org/10.1145/2739480.2754802},

doi = {10.1145/2739480.2754802},

acmid = {2754802},

publisher = {ACM},

address = {New York, NY, USA},

keywords = {diversity preservation, evolutionary algorithms, memetic algorithms, traveling salesman problem},

}

Jep, I am working on dynamic TSP also! :-)

You will find the solving TSP as 'Sorting' in my project!

https://www.researchgate.net/project/Travelling-Salesman-Problem-with-Dynamic-Programming-and-Computational-Geometry-Approach