Here is the synopsis of our sample research paper on Determining a Hamiltonian Circuit Route. Have the paper e-mailed to you 24/7/365.
Essay / Research Paper Abstract
This 3 page paper uses the neighborhood algorithm, the sorted edges algorithm and the brute force method to assess the best journey route between 5 towns. The bibliography cites 2 sources.
Page Count:
3 pages (~225 words per page)
File: TS14_TEhamroute.rtf
Buy This Term Paper »
Unformatted sample text from the term paper:
use different algorithms so assess efficient routes. In order to use Hamiltonian circuits the first stage is to map the towns and the distances between the points. This is shown
in figure 1, distances taken from ERsys.com (2008). Figure 1 Representation of the towns with distances Using the nearest neighbor is an algorithm where it is the shortest
distance that is chosen that connect to an unused vertex with the exception of the start and end point (Wallis, 2003). If this is followed in this case the route
of Fayetteville, Jonesboro, Little Rock, Ft Smith, Tulsa and then back to Fayetteville giving a distance of 775 miles. At each stage the potential routes that can be taken are
considered and the shortest is chosen as long as it has not been visited before and does not complete the circuit before all points have been visited. Table 1
Distance using nearest neighbor algorithm Start End Distance Fayetteville Jonesboro 195 Jonesboro Little Rock 121 Little Rock Ft Smith 123 Ft Smith Tulsa 101 Tulsa Fayetteville 235 Total 775
An alternative approach is to use the sorted edges algorithm. With this there is an approach where the approach appear to be similar to that of the nearest neighbor, but
in this instance there is the consideration of all the edges not only the individual edge at each point of the journey, in each instance the route with the least
weight is chosen as long as it does not repeat a vertex and does not end the circuit before al vertices are used (Wallis, 2003), in this case the potential
are shown in table 2 which in this case leaves us with the same route and distance. Table 2 Distances using sorted edges Fayetteville Jonesboro 195 Fayetteville Tulsa 235
...