References

Bramel, J. and D. Simchi-Levi, 1996. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res., 44: 501-509.
Direct Link  |  

Chang, Y. and L. Chen, 2007. Solve the vehicle routing problem with time windows via a genetic algorithm. Discrete Continuous Dyn. Syst. Suppl., 1: 240-249.
Direct Link  |  

Christofides, N., A. Mingozzi and P. Toth, 1981. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programm., 20: 255-282.
CrossRef  |  Direct Link  |  

Clarke, G. and G.W. Wright, 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operat. Res., 12: 568-581.
CrossRef  |  

Eilon, S., G.C.D.T. Watson and N. Christofides, 1971. Distribution Management. Griffin, London, England, Pages: 239.

Eshghi, K. and N.M. Karimi, 2012. Combinatorial Optimization and Meta-Heuristicalgorithms. Azin Mehr, Tehran, Iran,.

Gendreau, M., A. Hertz and G. Laporte, 1994. A tabu search heuristic for the vehicle routing problem. Manage. Sci., 40: 1276-1290.
CrossRef  |  

Laporte, G., 1992. The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res., 59: 345-358.
CrossRef  |  Direct Link  |  

Laporte, G., H. Mercure and Y. Nobert, 1986. An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks, 16: 33-46.
CrossRef  |  Direct Link  |  

Reed, M., A. Yiannakou and R. Evering, 2014. An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput., 15: 169-176.

Ryan, D.M., C. Hjorring and F. Glover, 1993. Extensions of the petal method for vehicle routeing. J. Oper. Res. Soc., 44: 289-296.
CrossRef  |  Direct Link  |