© 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 …
© 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 …
© 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 …
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 …
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 …
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, …
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 …
This paper deals with a problem where the same vehicle performs several routes to serve a set of customers and arc traversal times vary along the planning horizon. The relationship with its time-invariant counterpart is investigated and a procedure to …
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered. With traffic data abundantly available, methods to optimize routes with respect to time-dependent …
© 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 …