Visiting a network of services with time constraints

A set of facilities is connected by a transportation network, where the weight of each arc corresponds to its travel time. Each facility is capable of providing a specific service during prespecified set of time windows. A visiting path of length k visits exactly k different facilities, respecting the time window of each facility within a given time limit Tmax. This paper examines the specific problem of finding the maximum number of feasible paths that visit k facilities. For this optimisation problem, which is shown to be NP-hard, a heuristic approach is presented to solve real size problems. We discuss in detail our computational experience on City of Romeʹs network and we present some computational results obtained applying our algorithm on randomised graph instances.