Real-time information can enable travelers to adapt to changing traffic conditions and make better routing decisions in uncertain networks. In this paper, a generic description of real-time online information is provided based on three schemes using partial online information and …
Increased congestion during peak morning and afternoon periods in urban areas is increasing logistics costs. In addition, environmental, social, and political pressures to limit the impacts associated with CO2 emissions are mounting rapidly. A key challenge for transportation agencies and …
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the …
Tramp shipping companies are committed to transport a set of contracted cargoes and try to derive additional revenue from carrying optional spot cargoes. Traditionally, models for ship routing and scheduling problems are based on fixed speed and a given fuel …
This paper presents an Ant Colony System algorithm hybridized with insertion heuristics for the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW). In the TDVRPTW a fleet of vehicles must deliver goods to a set of customers, time window constraints …
In recent years, many speed-up techniques for Dijkstra’s algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks which, unfortunately, appear …
This paper describes a dynamic capacitated arc routing problem motivated from winter gritting applications. In this problem, the service cost on each arc is a piecewise linear function of the time of beginning of service. This function also exhibits an …
Vehicle routing is an important combinatorial optimization problem. In real transport networks,the travel speed and travel time of roads have large time-variability and randomness. The study of vehicle routing problem in time-dependent network has even more practical value than static …
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 …
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 …