Orienteering problem with time-windows and updating delay

TL;DR

This paper introduces and analyzes the Orienteering Problem with Time Window and Delay ( extit{OPTiWinD}), focusing on optimal strategies and competitive ratios for various delay and request scenarios in online routing.

Contribution

It provides a comprehensive analysis of extit{OPTiWinD}, including exact solutions for certain delay and request size conditions, advancing understanding of online routing with time constraints.

Findings

Complete resolution for delay T at least half the diameter

Optimal performance bounds for small T or small n

Partial results for other delay and request size cases

Abstract

The Orienteering Problem with Time Window and Delay (\OPTiWinD) is a variant of the online orienteering problem. A series of requests appear in various locations while a vehicle moves within the territory to serve them. Each request has a time window during which it can be served and a weight which describes its importance. There is also a minimum delay $T$ between successive requests. The objective is to find a path for the vehicles that maximises the sum of the weights of the requests served. We further assume that the length of each time window is equal to the diameter of the territory. We study the optimal performance and competitive ratio for the set of instances with $n$ requests. We obtain complete resolution for $T$ at least half of the diameter, small values of $T$ or small values of $n$, as well as partial results in the remaining cases.