Abstract
With the popularity of the just-in-time system, more and more companies are operating with little or no inventories, which make them highly vulnerable to delays on supply. This paper discusses a situation when the supply of the commodity does not arrive at the depot on time, so that not enough of the commodity is available to be loaded on all vehicles at the start of the delivery period. New routing plans need to be developed in such a case to reduce the impact the delay of supply may have on the distribution company. The resulting vehicle routing problem is different from other types of vehicle routing problems as it involves waiting and multiple trips. Two approaches have been developed to solve the order release delay problem, both of which involve a Tabu Search algorithm. Computational results show the proposed approaches can largely reduce the disruption costs that are caused by the delayed supply and they are especially effective when the length of delay is long.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Augerat, P., Belenguer, J. M., Benavent, E., Corberan, A., Naddef, D., & Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem (Technical Report RR 949-M). Universite Joseph Fourier, Grenoble, France.
Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Operational Research Quarterly, 20, 309–318.
Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In Christofides, N., Mingozzi, N., Toth, A., Sandi, P.C. (Eds.) Combinatorial Optimization (pp. 315–338). Chichester: Wiley.
Clausen, J., Hansen, J., Larsen, J., & Larsen, A. (2001). Disruption management. OR/MS Today, 28(5), 40–43.
Clausen, J., Larsen, A., Larsen, J., & Rezanova, N. J. (2010). Disruption management in the airline industry—concepts, models and methods. Computers & Operations Research, 37, 809–821.
Fisher, M. L. (1994). Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, 42, 626–642.
Gabteni, S., & Grönkvist, M. (2008). Combining column generation and constraint programming to solve the tail assignment problem. Annals of Operations Research, 171(1), 61–76.
Kuster, J., Jannach, D., & Friedrich, G. (2010). Applying local rescheduling in response to schedule disruptions. Annals of Operations Research, 180(1), 265–282.
Li, J. Q., Mirchandani, P. B., & Borenstein, D. (2009). Real-time vehicle rerouting problems with time windows. European Journal of Operational Research, 194, 711–727.
Mu, Q. (2010). Disruption management in vehicle routing and scheduling. PhD thesis, Lancaster University.
Mu, Q., Fu, Z., Lysgaard, J., & Eglese, R. (2010). Disruption management of the vehicle routing problem with vehicle breakdown. The Journal of the Operational Research Society, 62, 742–749.
Yu, G., & Qi, X. (2004). Disruption management: framework, models and applications. Singapore: World Scientific.
Zhang, X., & Tang, L. (2007). Disruption management for the vehicle routing problem with time windows. In Huang, D.S., Heutte, L. & Loog, M. (Eds.), Communications in Computer and Information Science: Vol. 2(5). Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques (pp. 225–234). Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mu, Q., Eglese, R.W. Disrupted capacitated vehicle routing problem with order release delay. Ann Oper Res 207, 201–216 (2013). https://doi.org/10.1007/s10479-011-0947-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-0947-7