A heuristic algorithm is described for vehicle routing and scheduling problems to minimise the total travel time, where the time required for a vehicle to travel along any road in the network varies according to the time of travel. The …
Traditional technologies, such as inductive loop detectors, do not usually produce measurements of the quality required by real-time applications. Therefore, one wonders what could be expected from newer information and communication technologies, such as automatic vehicle location, license plate recognition, …
This paper raises a novel two-phase heuristic method to solve vehicle routing problems with backhauls. Differing from other vehicle routing problems, we consider the travel speed of vehicle to be time dependent, which will be used for the model of …
The real-time decision problems play a more and more important role in many areas such as the logistic distribution. This paper is focused on the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in the context of realtime traffic information. …
In this paper, we present an overview over existing speed-up techniques for time-dependent route planning. Apart from only explaining each technique one by one, we follow a more systematic approach. We identify basic ingredients of these recent techniques and show …
Assigning and scheduling vehicle routes in a stochastic time-dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work …
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 …