Abstract
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. The approach developed introduces the traffic congestion component based on queueing theory. This is an innovative modelling scheme to capture the stochastic behavior of travel times as it generates an analytical expression for the expected travel times as well as for the variance of the travel times. Routing solutions that perform well in the face of the extra complications due to congestion are developed. These more realistic solutions have the potential to reduce real operating costs for a broad range of industries which daily face routing problems. A number of datasets are used to illustrate the appropriateness of the novel approach. Moreover it is shown that static (or time-independent) solutions are often infeasible within a congested traffic environment which is generally the case on European road networks. Finally, the effect of travel time variability (obtained via the queueing approach) is quantified for the different datasets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Aarts, E.H.L., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)
Akçelik, R.: Travel time functions for transport planning purposes: Davidson’s function, its time-dependent form and an alternative travel time function. Aust. Road Res. 21(3), 49–59 (1991)
Akçelik, R.: Relating flow, density, speed and travel time models for uninterrupted and interrupted traffic. Traffic Eng. Control 37(9), 511–516 (1996)
Augerat, P., Belenguer, J.M., Benavent, E., Corber, A., Naddef, D.: Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106, 546–557 (1998)
Bertsimas, D., Van Ryzin, G.: A stochastic and dynamic vehicle routing problem in the Euclidian plane. Oper. Res. 39, 601–615 (1991)
Bertsimas, D., Van Ryzin, G.: Stochastic and dynamic vehicle routing problems in the Euclidean plane with multiple capcitated vehicles. Oper. Res., 41, 60–76 (1993)
Bertsimas, D.J., Simchi-Levi, D.: A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper. Res., 44(2), 286–304, (1996)
Best, M.J., Grauer, R.R.: Sensitivity analysis for mean-variance portfolio problems. Manage. Sci. 37(8), 980–989 (1991)
Brown, G.G., Ellis, C.J., Lenn, G., Graves, W., Ronen, D.: Real time, wide area dispatch of mobile tank trucks. Interfaces 17, 107–120 (1987)
Bullnheimer, B., Hartl, R.F., Strauss, Ch.: Applying the ant system to the vehicle routing problem. In: Voss, S., Martello, I., Osman, H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston (1999)
Bullnheimer, B., Hartl, R.F., Strauss, Ch.: An improved ants system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319–328 (1999)
Christofides, N., Mingozzi, A.: Vehicle Routing: Practical and Algorithmic Aspects. Pergamon Press, Oxford, UK (1989)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)
Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimization McGraw-Hill, London, UK (1999)
Coyle, J.J., Bardi, E.J., Langley Jr. J.J.: The Management of Business Logistics. West, St. Paul, Minnesota (1996)
Daganzo, C.F.: Fundamentals of Transportation and Traffic Operations. Elsevier, New York (1997)
Davidson, K.B.: The theoretical basis of a flow-travel time relationship for use in transportation planning. Aust. Road Res. 8(1), 32–35 (1978)
Dorigo, M., Stützle, T.: The ant colony optimization metaheuristic: algorithms, applications and advances. In: Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol. 57, pp. 251–285. Kluwer, Massachusetts (2002)
Fleischmann, B., Gietz, M., Gnutzmann, S.: Time-varying travel times in vehicle routing. Transp. Sci. 38(2), 160–173 (2004)
Gans, N., Van Ryzin, G.: Dynamic vehicle dispatching: optimal heavy traffic and practical insights. Oper. Res. 47(5), 675–692 (1999)
Gao, S., Chabini, I.: The best routing policy problem in stochastic time-dependent networks. Transp. Res. Rec. 1783, 188–196 (2002)
Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276–1290 (1994)
Gendreau, M., Laporte, G., Seguin, R.: Stochastic vehicle routing. Eur. J. Oper. Res. 88(1), 3–12 (1996)
Gendreau, M., Laporte, G., Séguin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469–477 (1996)
Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340–349 (1974)
Grauer, R.R., Hakansson, N.H.: On the use of mean-variance and quadratic approximations in implementing dynamic investment strategies: a comparison of returns and investment policies. Manage. Sci. 39(7), 856–871 (1993)
Greenshields, B.D.: A study of traffic capacity. In: Highway Research Board Proceedings, Washington, District of Columbia, vol. 14, pp. 448–477, 1935
Heidemann, D.: A queueing theory approach to speed-flow-density relationships. In: Transporation and Traffic Theory. Proceedings of the 13th International Symposium on Transportation and Traffic Theory, Lyon, France (1996)
Hickman, M.D., Wilson, N.H.M.: Passenger travel time and path choice implications of real-time transit information. Trans. Res. Circ. 3(4), 211–226 (1995)
Hill, A.V., Benton, W.C.: Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. Eur. J. Oper. Res. 43(4), 343–351 (1992)
Ichoua, S., Gendreau, M., Potvin, J-Y.: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144, 379–396 (2003)
Jain, R., MacGregor Smith, J.: Modeling vehicular traffic flow using M/G/C/C state dependent queueing models. Transp. Sci. 31, 324–336 (1997)
Kenyon, A.S., Morton, D.P.: Stochastic vehicle routing with random travel times. Transp. Sci. 37(1), 69–82 (2003)
Kerbache, L., Van Woensel, T.: Planning and Scheduling Transportation Vehicle Fleet in a Congested Traffic Environment. Copenhagen Business School, Denmark (2005)
Kingman, J.F.C.: The single server queue in heavy traffic. Proc. Camb. Philos. Soc. 57, 902–904 (1964)
Kraemer, W., Lagenbach-Belz, M.: Approximate formulae for the delay in the queueing system GI/GI/1. In: Congressbook of the Eight International Teletraffic Congress, Melbourne, Australia, pp. 235–1/8, 1976
Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345–358 (1992)
Malandraki, C., Daskin, M.S.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 26(3), 185–200 (1992)
Malandraki, C., Dial, R.B.: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur. J. Oper. Res. 90, 45–55 (1996)
Mulvey, J.M., Vanderbei, R.J., Zenios, S.A.: Robust optimization of large-scale systems. Oper. Res. 43(2), 264–281 (1995)
Osman, I.: Vehicle routing and scheduling: applications, algorithms and developments. In: Proceedings of the International Conference on Industrial Logistics, Rennes, France (1993)
Pirlot, M.: General local search methods. Eur. J. Oper. Res. 92, 493–511 (1996)
Shen, Y., Potvin, J.-Y.: A computer assistant for vehicle dispatching with learning capabilities. Ann. Oper. Res. 61, 189–211 (1995)
Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1995)
Taniguchi, E., Thompson, R.G., Yamada, T., Van Duin, R.: City Logistics: Network Modelling and Intelligent Transport Systems. Pergamon, New York (2001)
Vandaele, N., Van Woensel, T., Verbruggen, A.: A queueing based traffic flow model. Trans. Res. D. 5(2), 121–135 (2000)
Vandaele, N.J.: The impact of lot sizing on queueing delays: multi product, multi machine models. PhD thesis, Katholieke Universiteit Leuven, Department of Applied Economics (1996)
Whitt, W.: The queueing network analyzer. Bell Syst. Tech. J. 62(9), 2779–2815 (1983)
Whitt, W.: Approximations for the GI/G/m queue. Prod. Oper. Manag. 2(2), 114–161 (1993)
Van Woensel, T.: Modelling uninterrupted traffic flows, a queueing approach. PhD Dissertation, University of Antwerp, Belgium (2003)
Van Woensel, T., Creten, R., Vandaele, N.: Managing the environmental externalities of traffic logistics: the issue of emissions. In: POMS journal, Special Issue on Environmental Management and Operations, vol. 10 (2001)
Van Woensel, T., Vandaele, N.: Empirical validation of a queueing approach to uninterrupted traffic flows. J. Oper. Res. 4(1), 59–72 (2006)
Van Woensel, T., Wuyts, B., Vandaele, N.: Validating state-dependent queueing models for uninterrupted traffic flows using simulation. J. Oper. Res. 4(2), 159–174 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Woensel, T.V., Kerbache, L., Peremans, H. et al. A Queueing Framework for Routing Problems with Time-dependent Travel Times. J Math Model Algor 6, 151–173 (2007). https://doi.org/10.1007/s10852-006-9054-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-006-9054-1