I need an algorithm that chooses the best Path from A to B with set conditions and runs on node.js servers

X means give us the ability to set the value. I need algorithm that can help me figure out the fastest path from point A to point B passing through atleast X number of markers. These markers are point of interest on a map and are plotted throughout the map with exact location, latitude and longitude. The markers are not static and changes based on TIME. There are two types of markers: a. Active (stays active for 15 mins then turns inactive) b. Inactive (Inactive has a time (e.g. 9:10 PM) marked on it with it that shows the time it will become active, once active 15 mins later it will become inactive) I need the path to go through the most amount of ACTIVE markers. So it needs to consider that as they are walking the path that an inactive marker can turn active, and an active marker can turn inactive. It also should assume that every person will stop at the active path for X minute and will be walking X km/h. So for example a person walking from A to B all the markers they should be passing by has to be ACTIVE. The path created has to be humanly walkable. And the path should not exceed X times the distance of traveling directly from point A to point B. So for example the path created is: A -> Marker 1 -> Marker 3 -> Marker 4 -> B. This path cannot be greater than (X times) A -> B. It can utilise google maps or any other api if needs be to find humanly walkable paths This needs to be able to run on a node.js server I’ve attached a photo example