Papers about Travelling Salesman Problem (TSP)

I'm searching for relative (after 2000) new papers about TSP. All the papers I have found were quite hard and needed high level mathematical skills. I'm looking for papers that are simple to read for someone who has simple college mathematic knowledge and good programming knowledge in Java and C (I didn't find any current paper implementing TSP with these languages).

Any hints will be highly app开发者_JAVA百科reciated.

(edit)

What Im trying to say is that im searching for papers that dont need to understand difficult formulas. For instance some papers describe algorithms, or the philosophy of solution. It isnt necessary to implement that algorithm, just describe the techniques. Maybe using some simple geometry ...

I found some papers based on Lin-Kernighan methods, which seemed ok ...

I'm somewhat familiar with the TSP literature, and I doubt there's anything matching your criteria; the simpler, less mathematical algorithms were pioneered long before your cutoff.

David S. Johnson and coauthors have some articles that I like: http://www2.research.att.com/~dsj/papers.html , in particular #1 and #3 under Traveling Salesman Problem.

If you want simple, here is one page that describes using space filling curves to find a good solution (not optimal obviously). Of course, a webpage is not a paper. Nor do I know if the ideas presented there were created after 2000. If this is more of what you are looking for, perhaps you should edit your question, or provide an example.

http://www2.isye.gatech.edu/~jjb/mow/mow.html

Here's what you can do:

1) Study chapter 11-Guided Local Search and Chapter 12- Iterated Local Search from Handbook of Metaheuristics(2010), each of these has a section describing how GLS and ILS are designed for TSP. Both ILS and GLS are interesting and quite easy to implement.

2) Check this paper: "Guided local search and its application to the traveling salesman problem"

3) Find the Ruby code for these algorithms here , and rewrite it in Java