A starting point and an ending point from the set of locations is selected.
A search method using a genetic algorithm is applied to the set of locations and a route is provided as a solution to the traveling salesman problem.