In this paper we deal with an extended version of the Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW) that considers time-dependent travel times and costs, for a more accurate approximation of some routing problems inside large cities, in which …
We consider a shortest path problem, where the travel times on the arcs may vary with time and waiting at any node is allowed. Simple adaptations of the Dijkstra algorithm may fail to solve the problem, when discontinuities exist. We …
In this paper, a dynamic road network problem is described where dynamic travel times are considered. We present a method of getting the road time function based on analyzing strategy for solving time dependent vehicle routing problem (TDVRP). Obtain the …
Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, …
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the “timing” of each intervention is crucial. The exact problem-solving approach reported here first transforms the arc …
The traveling salesman problem is one of the most famous combinatorial optimization problems and has been intensively studied. Many extensions to the basic problem have also been proposed, with the aim of making the resulting mathematical models as realistic as …
Mobile communication technologies enable truck drivers to keep abreast of changing traffic conditions in real-time. We assume that such communication capability exists for a single vehicle traveling from a known origin to a known destination where certain arcs en route …
© 2006 by World Scientific Publishing Co. Pte. Ltd.Time dependent vehicle routing problem is a vehicle routing problem in which travel costs along the network are dependent upon the time of day during which travel is to be carried out. …
Both within and between urban conurbations, the time of a journey and the corresponding shortest path in a road network from an origin to a destination may depend on the time of the day, the day of the week and …
In this paper, the use of queueing theory for modeling uninterrupted traffic flows is evaluated. Empirical data on speeds and flows are used to evaluate speeds generated by the different queueing models. Using the Theil inequality coefficient as evaluation criterion, …