Travelling Salesman Problem

This is a travelling salesman problem where this salesman have to enter and leave each city only once. The data set contains 20 cities' coordinates and i have to find the shortest distance. I am required to do a simple 'city swapping' rule which begins with an arbitrary tour and cycles through the tour. it progressively change by swapping those adjacent cities that result in a reduction of total distance. this algorithm continues until no improvement can be found after a complete cycel through a tour. the output would be 2 charts on the one screen to enable the user to monitor the process of the algorithm. chart1:scatter graph of the cities with the capacity to display the tour current at each point of the algorithm chart2:show a plot of successive tour distances against iteration number. note:this is all done in microsoft excel 2000 with visual basic application editor ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3)I just need it to run from within excel ## Platform microsoft excel 2000 and visual basic application inside excel