The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where …
This paper proposes a variable neighborhood descent heuristic for solving a capacitated arc routing problem with time-dependent service costs. The problem is motivated by winter gritting applications where the timing of each intervention is crucial. The variable neighborhood descent is …
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic features like: traffic days, walking between stations, queries between …
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, …
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 …
The vehicle routing problem (VRP) has been addressed in many research papers. Only a few of them take time-dependent travel speeds into consideration. Moreover, most research related to the VRP aims to minimize total travel time or travel distance. In …
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. …
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 …
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 …
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 …