Time-dependent routing

Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance

© 2021 Elsevier LtdReducing distribution costs is one of the effective ways for logistics enterprises to improve their core competitiveness. Aiming at the multi-depot vehicle routing problem under the time-varying road network, this paper proposes an integer programming model with …

Planning of Garbage Collection Service: An Arc-Routing Problem With Time-Dependent Penalty Cost

© 2000-2011 IEEE.This paper presents an arc-routing problem with time-dependent penalty cost (ARPTPC), which arises from a practical application in garbage collection service. ARPTPC considers the minimization of service cost, traveling cost and penalty cost. While the first two parts …

An Efficient Monte Carlo-Based Probabilistic Time-Dependent Routing Calculation Targeting a Server-Side Car Navigation System

© 2013 IEEE.Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for selecting dynamically the number of samples used for …

Constrained Route Planning over Large Multi-Modal Time-Dependent Networks

© 2021 IEEE.Constrained route planning (CRP) on transportation networks has been extensively studied because of its broad applications, such as route recommendation. However, the existing works on CRP neglect the time-dependent and multi-modal properties of transportation networks. This paper proposes …

Joint Optimization of Running Route and Scheduling for the Mixed Demand Responsive Feeder Transit With Time-Dependent Travel Times

© 2000-2011 IEEE.As an emerging urban public transport mode, responsive feeder transit system is flexible and can offer door-to-door services between new districts at margins with low urban transit coverage and trunk bus station. In this study, a joint optimization …

Time-Dependent Urban Customized Bus Routing With Path Flexibility

© 2000-2011 IEEE.Urban customized bus companies are increasingly motivated by design efforts that entail more efficient route scenarios to incorporate adaptation to temporal and spatial heterogeneity in travel demand. However, such motivations are usually hindered by ubiquitous arrival unpunctuality resulting …

A hybrid algorithm for time-dependent vehicle routing problem with time windows

In this paper, we study the duration-minimizing time-dependent vehicle routing problem with time windows (DM-TDVRPTW), where time-dependent travel times represent different levels of road congestion throughout the day. The departure time from depot becomes an important decision to reduce the …

A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints

In this paper we study the time-dependent profitable tour problem with resource constraints (TDPTPRC), a generalization of the profitable tour problem (PTP) which includes variable travel times to account for road congestion. In this problem, the set of customers to …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close