This paper presents an updated and comprehensive review of discrete optimization techniques for solving time-dependent problems, ie decision problems in which activities and resources have to be scheduled over time. Known compact models with continuous variables representing arrival/service/departure times are …
In this paper, we deal with the Time-Dependent Asymmetric Traveling Salesman Problem with Time Windows. First, we prove that under special conditions the problem can be solved as an Asymmetric Traveling Salesman Problem with Time Windows, with suitable-defined time windows …
This paper deals with the time-dependent version of the classical Rural Postman Problem in which arc traversal times vary along the planning horizon. The relationship with the time-invariant counterpart is investigated and a branch-and-bound algorithm is developed. Extensive computational results …
The precedence constrained traveling salesman problem (TSP-PC), or the sequential ordering problem (SOP), consists of finding an optimal TSP tour that will also satisfy the namesake precedence constraints, typically specified as a partial order or a directed acyclic graph. Its …
This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. [48]. In the network, the involved utilities are stage-dependent and contain random …
We study a variant of the shortest path problem in a congested environment. In this setting, the travel time of each arc is represented by a piecewise continuous affine function of departure time. Besides, the driver is allowed to wait …
The problem of efficiently touring a theme park so as to minimize the amount of time spent in queues is an instance of the Traveling Salesman Problem with Time-Dependent Service Times (TSP-TS). In this paper, we present a mixed-integer linear …
In this paper, we study a family of time-dependent pickup and delivery problems with time windows to optimize the service of a transportation provider under two dimensions of operational flexibility. In the first, we consider problems wherein the transportation service …
The impact of congestion in transportation has become one of the main concerns regarding urban planing in large cities. Time-Dependent Vehicle Routing Problems (TDVRPs) is the name given to a broad family of VRPs that explicitly incorporate the congestion by …
In this paper, we introduce the time window assignment vehicle routing problem (TWAVRP) with time-dependent travel times. It is the problem of assigning time windows to customers before their demand is known and creating vehicle routes adhering to these time …