1. 1. BehrouzAfshar-Nadjafi, AlirezaAfshar- adjafi, 2014. “A constructive heuristic for time dependent multidepot vehicle routing problem withtime-windows and heterogeneous fleet”,Journal of king saud university Engineering sciences.
   2. Chopra, S., Meindl, P., 2004. Supply Chain Management –Strategy, Planning and Operation, 2nd ed. Pearson Prentice hall,Upper Saddle River.
   3. G.B.Dantzig, J.H.Ramser, 1959. “The truck dispatching problem”, Management Science, Vol. 6, No. 1, pp.80-91.
   4. G.Clarke, J.Wright, 1964. “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, Vol. 12, No. 4, pp. 568-581.
   5. Gaurav Sharma, PreetiBansal, 2012. “Min-Min for scheduling in grid environment”, International Journal of Latest Trends in Engineering and Technology(IJLTET),Vol 1, Issue 1.
   6. Graham K Rand, 2009. “The life and times of savings method for vehicle routing problems”,http://www.orssa.org.za,Volume 25(2),pp.125- 145.
   7. Gendreau M., A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Management Science 40 (1994), pp. 1276–1290.
   8. Olvera A. and O. Viera, Adaptive Memory Programming for the Vehicle Routin Problem with Multiple Trips, Computers & Operations Research 34 (2007), pp. 28–47.
   9. Mohamed Cheikh, Mustapha Ratli, Omar Mkaouar, BaseemJarboui, A VariableNeighborhood Search Algorithm for the vehicle routing problem with Multiple trips, notes in Discrete Mathematics 47(2015), Elsevier, pg 277-28.
   10. P. Praveen , B. Rama 2016,” An Empirical comparison of Clustering using Hierarchical methods and Kmeans”, International Conference on Advances in Electrical, Electronics, Information, Communication and BioInformatics (AEEICB16)