Assigning and scheduling vehicle routes in a stochastic timedependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the traffic congestion is captured based on queueing theory in an analytical way and applied to the V R...

Private sector operators of response services such as ambulance, fire or police etc. are often regulated by targets on the distribution of response times. This may result in inefficient overstaffing to ensure those targets are met. In this paper, we use a network chain of M/M/K queues to model the arrival and completion of jobs on the system so that quantities such as the expected total time wa...

This paper extends the analysis of the value of mean travel time (VMTT) and day-to-day travel time variability (VTTV) from single, isolated trips to daily trip chains, considering the effects of flexibility in activity scheduling and within-day correlation of travel times. Using a multi-stage stochastic programming approach, we show that the VMTT and VTTV on a trip is conditional on the realize...

In this paper we propose a composite Variational Inequality formulation for modeling multi-mode, multi-class and multi-criteria stochastic dynamic user equilibrium problem in recurrent congestion network with queues. The each mode of travelers is classified into two classes. One is the equipped traveler following stochastic dynamic user-equilibrium with less uncertainty of travel cost, another ...

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, a vehicle routing problem with time-dependent travel times due to potential traffic congestion is considered. Th...

Dijkstra's algorithm may be used to compute fastest paths in transportation networks represented as weighted graphs where edge weights denote travel times between locations. If travel times are both stochastic and time dependent, however, eecient dynamic programming methods cannot be used to compute fastest paths. Wellman et al. introduced a variant of priority-rst search that is capable of ndi...

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...