Reference no: EM131462443

Algorithms and their Application Laboratory - The Travelling Salesman Problem

1. Introduction:

Firstly, this worksheet is one of the worksheets from which your laboratory worksheets portfolio of work will be assessed.

This worksheet is about empirically evaluating how scalable a number of single population heuristic search methods are at solving the Travelling Salesman Problem (TSP) when applied to a number of different sized problems. The aim is to evaluate and demonstrate how well each of the methods performs as the size of the problem increases.

The overall objective of this worksheet is to produce; present and report on, a Java program that is capable of solutions the TSP on a number of different sized problems using a number of different heuristic search algorithms (see below).

2. Preliminaries:

Make sure that you are familiar with the material in lecture "16.1 The Travelling Salesman Problem".

The datasets for this project are available in Appendix A in the file: CS2004 TSP Data (2016-2017).zip

Within this file are a large number of TSP data files of the form TSP_<N>.txt where N is the size of the data file. Within each TSP_<N>.txt file is an N by N matrix of distances between the nodes, which is a symmetric matrix. I.e. the distance between nodes i and j is the same as the distance between node j and i.

Appendix B contains some useful information regarding the TSP problem.

3. Exercise 1: Solving the TSP Problem

The Travelling Salesman problem (TSP) has been described fully in the lectures. The purpose of this worksheet is to:

1) Implement a number of the algorithms (listed below) to solve the TSP

2) Compare the algorithms on a number of different sized datasets

3) Report on the accuracy of the methods as the problem size changes

You should try and implement more than one out of the four following methods:

1) Simple Hill Climbing (Random Mutation Hill Climbing)

2) Stochastic Hill Climber

3) Random Restart Hill Climber

4) Simulated Annealing

Each method that is implemented should be run a number of times to remove any one off results due to the stochastic nature of the algorithms. The exact number of times is up to the student, but a sensible and logical number of repeat experiments should be chosen. There are a very large number of datasets available as described in Appendix A. Running the methods on all of these datasets for a number of repeats will take a very, very long time. A sample of these datasets should be chosen to represent a well thought out spread of the various sizes of the problems being solved.

Note that each of the methods can be run for a number of iterations. All of the experiments should be run for the same number of iterations, so that they can be compared. Note however, that this parameter is up to the student to choose and a sensible and logical value should be chosen.

You should provide some form of indication of quality of your solution. This can be done a number of ways, one suggestion is to use the Minimum Spanning Tree as discussed in the lectures and another is to use the optimal solution files. These latter files are a list of integers detailing the optimal tour for a given dataset.

Assignment File -

https://www.dropbox.com/s/zhmzfe65cbcmycf/Assignment%20File.rar?dl=0