I am trying to write an algorithm to find a path (not the shortest one) between a given start and end point.
An user will enter the start location, the end location and the available time to travel. For each edge of my graph I know the cost in time to traverse that edge and the gain in points of interest along that edge. I want to find the path witch maximises the gain in points of interest and falls within the given time.
Until now I only found references to A Star routing algorithm or optimisations to it witch only compute the shortest path.
Could you please give me some hints on what algorithm should I use or some references to solutions of similar problems? This algorithm is an important part of my Dissertation.