In this paper, a new time-space network model is proposed for addressing the time-dependent rural postman problem (TDRPP) of a single vehicle. The proposed model follows the idea of arc-path alternation to form a feasible and complete route. Based on …
© 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 …
Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed functions on the complete graph. …
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 …
© 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 …
© 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 …
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, …
© 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 …
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 …