Assigning and scheduling vehicle routes in a stochastic time-dependent 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 VRP problem. In this paper, we introduce the variability in the traffic flows into the model. This allows for an evaluation of the routes based on the uncertainty involved. Different experiments show that the risk taking/avoiding behaviour of the planner can be taken into account during optimization. As more weight is contributed to the variability component, the resulting optimal route will be slightly slower, but more reliable. The solution quality in terms of the 95th-percentile of the travel time distribution (assumed lognormal) will also improve.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number
2007018.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: