Finding the Shortest Path with User Requirements

From the perspective of a user, finding the shortest path from a starting location to a destination is only a basic requirement. Other demands may also be involved, such as asking for dining, shopping or mailing letters on the way to the destination. In this paper, we consider a novel problem of finding the shortest path which satisfies the user requirements represented as a set of points of interest such as a restaurant or post office. Two approaches are proposed to deal with this problem. The basic approach solves the problem using the depth first search (DFS) algorithm. The advanced approach reduces the search space of the paths by pruning strategies. The experiment results show that the advanced approach demonstrates a great performance in terms of the execution time.