A Route Selecting System (RSS) for Travelling from A Predefined Location

Abstract

Traditionally, the routing problem has been a single objective problem having as goal the minimization of either the total distance or travel time. Many approached and strategies are used for an appropriate solution to problem. For the traders, tourisms and travelling, finding the best way to travel around the world is very important. This way may be shortest way. A route selecting system called RSS was developed to aid travelling for traders, travelling salesmen and tourists. In paper, presents a solution for travelling by using A* search for minimization of total distance or cost. The proposed system takes place to be visited and a start location. The work starts with the examination and evaluation of several heuristics algorithms. Next, the work dwells on the A* search algorithm for RSS implementation use. The experimental results show that what has been discussed the oretically is computational feasible. Near optimum solution can be obtained using the A* search applied to the problem domain. The shortest path for travelling all places is searched. It was noticed that higher specification of hardware is desirable in order to compute more cities in reasonable time.