A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network …
This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. …
This paper studies the problem of computing optimal journeys in dynamic public transit networks. We introduce a novel algorithmic framework, called Connection Scan Algorithm (CSA), to compute journeys. It organizes data as a single array of connections, which it scans …
The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into …
A number of technological advances have led to a renewed interest in dynamic vehicle routing problems. This survey classifies routing problems from the perspective of information quality and evolution. After presenting a general description of dynamic routing, we introduce the …
The aim of the paper is to model urban distribution vehicle routing problems by means of hubs in large cities. The idea behind the urban distribution center (DC) is to provide buffer points where cargo and packages which are to …
Increasing traffic demand, recurring congestion and sophisticated e-commerce business models lead to enormous challenges for routing in city logistics. We introduce a planning system for city logistics service providers, which faces those challenges by more realistic vehicle routing considering time-dependent …
City logistics routing requires time-dependent travel times for each network link. We rely on the concept of Floating Car Data (FCD) to develop and provide such travel times. Different levels of aggregation in the determination of time-dependent travel times from …
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 …
The computation of point-to-point shortest paths on time-dependent road networks has a large practical interest, but very few works propose efficient algorithms for this problem. We propose a novel approach, which tackles one of the main complications of route planning …