solve traveling salesman problem using simulated annealing algorithms.
The problem is to find circular route that visits each of N cities
once, starting from home city to minimize the geographic distance
traveled. at the end one returns to the home city. city coordinates
are a(0,0)home city, b(5,5), c(3,4), d(1,1),
e(0,6),f(7,0),g(2,3),h(2,4),i(3,5),j(4,6),k(4,1),l(1,5),m(0,2),n(5,4),o(2,0),p(5,6).

require: c++/c/matlab code, flow chart,explaination of the approach.

It has been several years since I've used MatLab, but I definitely
remember that one of the demos that Matlab shipped with the product
was a traveling sales man solution.  If you type "demo" at the command
prompt, I think you will get a window that allows you to run a bunch
of demos.   If you search around the executable path, you should find
a directory that has the command files that run the traveling sales
man demo.  Then you can look at the code and translate it into c or
c++ as required.