This paper presents a novel extension of vehicle routing problem considering alternative green-fuel powered vehicles in the presence of congestion, with the aim of minimizing CO2 emissions. The travel time and fuel consumption on each arc are not only dependent …
In the Electric Vehicle Routing Problem with Time Windows (EVRPTW) the vehicles have a limited driving range and must recharge their battery at some points on their route. The recharging stations have a limited capacity and the newly arriving vehicles …
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 …
Integer programs for solving time-dependent models—models in which decisions have to be made about the times at which activities occur and/or resources are utilized—are pervasive in industry, but are notoriously difficult to solve. In the last few years, interest in …
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 …
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 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 …