Statementof problem:Bob owns a beverage service that makes delivery of bottled beveragesto towns in a particular region. To maximize the time that he uses inmaking deliveries of the bottled beverages, he has to find theshortest path that makes him visit each warehouse once. The problempresented in the project is therefore to determine the most efficientroute that bob will use through nine towns. Notably, the solutionpresented has to present a route with the smallest total distance.
Ingetting the information for solving Bob`s issue, I used theinformation provided in utilizing loops and possible decisions to bemade in ensuring that Bob gets the most efficient route. In thisproject, I made great use of the checkpoints, set of locations, andfunctions at the MATLAB using the distance equation. Additionally, Ihad to create the assumption if any direct route could be made in anytown on the map provided. Using the distance equation, I was able toget the possible algorithms that could be used and create a possiblesolution for the project. Additionally, I followed the instructionsthat had been provided in the initial instructions of the project.The reliability for this data had been set on the idea that thedistance equation and the instructions could have provided the bestcheckpoints that were not so complicated and easy to trace. Incompleting this project, I also got information from websites such ashttp://tomopt.com. The reliability of the information got from thesewebsites was based on the comments that had been provided by the sitevisitors and the various methods that the website tutors had providedabout solving salesman problem.
Theequation that was used in solving the stated problem is the distanceequation. In using the distance equation, . In using this equation, I was able to create a set of algorithmsthat helped in getting the most efficient route for Bob.Additionally, I used function obtained in the program in computingdistances and creating codes that would display distance and timethrough the map provided. Such computations generated a pseudocode,which was of great importance in assessing the points obtained. Withsuch points been obtained, I was able to get the final function andjoin the points in the map on which Bob would pass once using theshortest distance. The flowchart that was realized was as follows,flow chart: start- save data – ask user for input – give feedback -(either end or go back into asking for input). I did not have tochange the strategy and I applied the results I got until thecompletion of the project.
Thereare various limitations associated with the solution obtained and thereason why it might not work. One of such reasons is the assumptionthat bob can take a direct path to any town on the map. This meansthat he does not need to worry about the roads, an aspect that bringsan error on the disparity of the starting point and the first pointto be taken. The solution is also bound to fail on the distanceequation that has been used. This is because, the distance equationonly considers distance and the time taken in coming up with afunction relating the most efficient route to be taken. Using thisequation also, it becomes hard in creating the most effectivefunction due to the inconsistency in the figures obtained in relatingtime and distance. Finally, the project might not work due to themany factors that have been overlooked. For example, it has not beenconsidered on how long Bob will take on each town and whether he willtake a similar time in another town. Therefore such factors mightinfluence the accurateness of the results obtained during theproject.
Duringthe project, one of the hardest parts is the integration of theprogram and the generation of the pseudocode. With limited experienceon these programs, I was having a hard time in using MATLAB andintegrating functions in coming up with a pseudocode. The easiestpart of this project was the final bit of connecting the variouspoints on the map, in getting to understand the most efficient routethat Bob would use during his journey. The most interesting part ofthis project was the initial instructions that were provided, a taskthat seemed to be very easy. However, the least interesting part waswhen I realized that the project involved dedication and exhaustiveuse of the brain in determining the various checkpoints for the mostefficient route to be used by Bob. If I had to do this projectdifferently again, I would change the distance equation that I hadused and opt on another approach involving identification of otherfactors in generation of the pseudocode. I believe that such a changein the approach would bring a better solution to the problem inquestion.
Tomopt,(2014). Solving Travelling salesman problems. Retrieved fromhttp://www.tomopt.com/