Category: <span>Papers</span>

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 …

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 …

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 …

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 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 …

Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks

We study the problem of quickly computing point-to-point shortest paths in massive road networks with traffic predictions. Incorporating traffic predictions into routing allows, for example, to avoid commuter traffic congestions. Existing techniques follow a two-phase approach: In a preprocessing step, …

The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information

Most time-dependent vehicle routing problems are based on a similar modeling paradigm: travel time information is represented by travel time functions between pairs of points of interest (e.g., depot or customers). Only a few papers investigate how these functions can …

Tabu search for the time-dependent vehicle routing problem with time windows on a road network

Travel times inside cities often vary quite a lot during a day and significantly impact the duration of commercial delivery routes. Several authors have suggested time-dependent variants of the most commonly encountered vehicle routing problems. In these papers, however, time-dependency …

Shortest Fuzzy Hamiltonian Cycle on Transportation Network Using Minimum Vertex Degree and Time-dependent Dijkstra’s Algorithm

© 2021 The Authors.Determining the shortest travel time on transportation is affected by many logistics parameters such as cost, quality, speed and satisfaction. This study proposes a new hybrid time-dependent Dijkstra’s and minimum vertex degree algorithm on a spherical bipolar …

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