Introducing
Your new presentation assistant.
Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.
Trending searches
THANK YOU ;)
As a conclusion, this thesis was discussed about the study of Traveling Salesman Problem (TSP) base on reach of a few techniques from other research.
This prototype also was acquainting the technique Hill Climbing algorithms to solve and test the prototype of the system. In the future this algorithm will be used as an engine to build an route application.
* deterministic algorithms ;
is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.
To study few techniques as a solution to the TSP.
To solve by using and concentrate on the design of Hill Climbing algorithms for finding a solution to the problem.
To develop and test prototype based on selected technique in solving the TSP.
Traveling Salesman Problem involves a traveling salesman which should make a visit to a number of cities in hawking products. The series of the cities we visited have established a path so that the cities can only be passed exactly once and then return to town early. Completion of the TSP problem this is to obtain the shortest path. Exact completion of the TSP problem requires performing calculations on all possible routes that passed.
Hill climbing algorithms is the on of the trajectory search based. A trajectory-based algorithm typically uses a single agent or one solution at a time, which will trace out a path as the iterations continue and it links the starting point with the final point via a piecewise zigzag path. (Kennedy and Eberhardt, 1995). For such an algorithm, it will reach the same final solution if we start with the same initial point. Hill-climbing are good examples of deterministic algorithms