In this paper we deal with a generalization of the Vehicle Routing Problem with Time Windows that considers time-dependent travel times and costs. Through several steps we transform this extension into an Asymmetric Capacitated Vehicle Routing Problem, so it can …
This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between two jobs comprises an …
Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP …
The Multi-Depot Vehicle Routing Problem with time-dependent and fuzzy travel time is very difficult to solve to optimality even for relatively small size instances. So few or no literatures have focused on the problem so far. But it is very …
We investigate the impact of two strategies for dynamic pickup and delivery problems on the quality of solutions produced by insertion heuristics: (a) a waiting strategy that delays the final assignment of vehicles to their next destination, and (b) a …
The itinerary planning problem in an urban public transport system constitutes a common routing and scheduling decision faced by travelers. The objective of this paper is to present a new formulation and an algorithm for solving the itinerary planning problem, …
An algorithm for the distribution of fresh vegetables in which the perishability represents a critical factor was developed. This particular problem was formulated as a vehicle routing problem with time windows and time-dependent travel-times (VRPTWTD) where the travel-times between two …
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle …
We generalize the standard vehicle routing problem with time windows by allowing both traveling times and traveling costs to be time-dependent functions. In our algorithm, we use a local search to determine routes of the vehicles. When we evaluate a …
In this paper, we consider scheduling problems on a single machine in a sequence dependent setup environment. For these problems, we introduce several integer programming formulations of varying size and strength. Computational experiments conducted on instances of 1 | si …