References

Azi, N., M. Gendreau and J.Y. Potvin, 2012. A dynamic vehicle routing problem with multiple delivery routes. Annl. Oper. Res., 199: 103-112.
Direct Link  |  

Beaudry, A., G. Laporte, T. Melo and S. Nickel, 2010. Dynamic transportation of patients in hospitals. OR Spectrum, 32: 77-107.
CrossRef  |  Direct Link  |  

Bent, R. and V.P. Hentenryck, 2007. Waiting and relocation strategies in online stochastic vehicle routing. IJCAI., 7: 1816-1821.

Bertsimas, D.J. and V.G. Ryzin, 1991. A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res., 39: 601-615.
Direct Link  |  

Branchini, R.M., V.A. Armentano and A. Lokketangen, 2009. Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput. Oper. Res., 36: 2955-2968.
CrossRef  |  Direct Link  |  

Branke, J., M. Middendorf, G. Noeth and M. Dessouky, 2005. Waiting strategies for dynamic vehicle routing. Transp. Sci., 39: 298-312.
CrossRef  |  Direct Link  |  

Chen, H.K., C.F. Hsueh and M.S. Chang, 2006. The real-time time-dependent vehicle routing problem. Transp. Res. Logistics Transpor. Rev., 42: 383-408.
Direct Link  |  

Christofides, N. and J.E. Beasley, 1984. The period routing problem. Networks, 14: 237-256.
CrossRef  |  

Creput, J.C., A. Hajjam, A. Koukam and O. Kuhn, 2012. Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. J. Combinatorial Optim., 24: 437-458.
CrossRef  |  

Dantzig, G.B. and J.H. Ramser, 1959. The truck dispatching problem. Manage. Sci., 6: 80-91.
CrossRef  |  Direct Link  |  

Elhassania, M.J., B. Jaouad and E.A. Ahmed, 2013. A new hybrid algorithm to solve the vehicle routing problem in the dynamic environment. Int. J. Soft Comput., 8: 327-334.
Direct Link  |  

Fisher, M.L. and R. Jaikumar, 1981. A generalized assignment heuristic for vehicle routing. Networks, 11: 109-124.
CrossRef  |  Direct Link  |  

Fleischmann, B., S. Gnutzmann and E. Sandvo, 2004. Dynamic vehicle routing based on online traffic information. Trans. Sci., 38: 420-433.
CrossRef  |  Direct Link  |  

Ghannadpour, S.F., S. Noori, M.R. Tavakkoli and K. Ghoseiri, 2014. A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application. Appl. Soft Comput., 14: 504-527.
Direct Link  |  

Guner, A.R., A. Murat and R.B. Chinnam, 2012. Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. Comput. Oper. Res., 39: 358-373.
Direct Link  |  

Hentenryck, P.V. and R. Bent, 2006. Online Stochastic Combinatorial Optimization. MIT Press, Cambridge, Massachusetts,.

Hvattum, L.M., A. Lokketangen and G. Laporte, 2007. A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems. Networks, 49: 330-340.
CrossRef  |  Direct Link  |  

Ichoua, S., M. Gendreau and J.Y. Potvin, 2006. Exploiting knowledge about future demands for real-time vehicle dispatching. Transp. Sci., 40: 211-225.
Direct Link  |  

Kaiwartya, O., S. Kumar, D.K. Lobiyal, P.K. Tiwari and A.H. Abdullah et al., 2015. Multiobjective dynamic vehicle routing problem and time seed based solution using particle swarm optimization. J. Sens., 2015: 1-14.
Direct Link  |  

Khouadjia, R.M., B. Sarasola, E. Alba, L. Jourdan and E.G. Talbi, 2012. A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Appl. Soft Comput., 12: 1426-1439.
CrossRef  |  Direct Link  |  

Kilby, P., P. Prosser and P. Shaw, 1998. Dynamic VRPs: A study of scenarios. Technical Report APES-06-1998, University of Strathclyde, UK.

Larsen, A. and O.B. Madsen, 2000. The dynamic vehicle routing problem. Ph.D Thesis, Department of Transport Institut for Transport, Technical University of Denmark, Kongens Lyngby, Denmark.

Li, J.Q., P.B. Mirchandani and D. Borenstein, 2009. Real-time vehicle rerouting problems with time windows. Eur. J. Oper. Res., 194: 711-727.
Direct Link  |  

Lianxi, H., 2012. An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput. Opreat. Res., 39: 151-163.
CrossRef  |  Direct Link  |  

Mes, M., V.D.M. Heijden and V.A. Harten, 2007. Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. Eur. J. Oper. Res., 181: 59-75.
Direct Link  |  

Messaoud, E., A.E.H. Alaoui and J. Boukachour, 2013. Hybridization of the Ant colony algorithm with the Large Neighbor Search algorithm for static and dynamic VRPTW resolution. INFOR. Inf. Syst. Oper. Res., 51: 41-51.
Direct Link  |  

Minic, S.M. and G. Laporte, 2004. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp. Res. Methodol., 38: 635-655.
Direct Link  |  

Montemanni, R., L.M. Gambardella, A.E. Rizzoli and A.V. Donati, 2005. Ant colony system for a dynamic vehicle routing problem. J. Comb. Optim., 10: 327-343.
Direct Link  |  

Mu, Q., Z. Fu, J. Lysgaard and R. Eglese, 2011. Disruption management of the vehicle routing problem with vehicle breakdown. J. Oper. Res. Soc., 62: 742-749.

Novoa, C. and R. Storer, 2009. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Operations Res., 196: 509-515.
CrossRef  |  

Psaraftis, H.N., 1980. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp. Sci., 14: 130-154.
Direct Link  |  

Pureza, V. and G. Laporte, 2008. Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR. Inf. Syst. Oper. Res., 46: 165-176.
Direct Link  |  

Qureshi, A.G., E. Taniguchi and T. Yamada, 2012. A microsimulation based analysis of exact solution of dynamic vehicle routing with soft time windows. Proc. Soc. Behav. Sci., 39: 205-216.
CrossRef  |  Direct Link  |  

Sambola, M.A., E. Fernandez and G. Laporte, 2014. The dynamic multiperiod vehicle routing problem with probabilistic information. Comput. Oper. Res., 48: 31-39.
Direct Link  |  

Secomandi, N., 2000. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Operat. Res., 27: 1201-1225.
CrossRef  |  

Taillard, E., 1994. Parallel iterative search methods for vehicle routing problems. Networks, 23: 661-673.
CrossRef  |  Direct Link  |  

Taillard, E.D., P. Badeau, M. Gendreau, F. Guertin and J.Y. Potvin, 1997. A tabu search heuristic for the vehicle routing problem with soft time windows. Transport. Sci., 31: 170-186.
CrossRef  |  

Thomas, B.W., 2007. Waiting strategies for anticipating service requests from known customer locations. Transp. Sci., 41: 319-331.
Direct Link  |  

Wilson, N. and N. Colvin, 1977. Computer control of the rochester dial-a-ride system. Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts.

Xu, Y., L. Wang and Y. Yang, 2013. Dynamic vehicle routing using an improved variable neighborhood search algorithm. J. Appl. Math., 2013: 1-12.
Direct Link  |