A Survey on Proficient Solution for Automobile Routing Problem

Authors(5) :-V. Hemalatha, K. Jothimani, V. Praveen, J. Banuchandhar, P. Susila

A solution is designed for the vehicles to minimize the cost of distribution by which it can supply the goods to the customers with its known capacity can be named as a vehicle routing problem. In Clarke and Wrights saving method and Chopra and Meindl savings matrix method mainly an efficient vehicle routing can be achieved by calculating the distance matrix and savings matrix values based on the customers location or the path where the customer's resides. The main objectives of this paper are to reduce the total distance and the total number of vehicles which is used to deliver the goods to the customers. There are few new algorithms which are mainly based on the min-min, max-min and k-means clustering algorithm techniques which are used in cloud computing and data mining scenario effectively. The proposed algorithm decreases the total distance and the number of vehicles assigning to each route. The important thing we need to consider here is that, this new algorithm can enhance the Chopra & Meindl saving matrix method and Clarke and Wright saving matrix method.

Authors and Affiliations

V. Hemalatha
CSE, N.S.N College of Engineering & Technology, Karur, Tamilnadu, India
K. Jothimani
CSE, N.S.N College of Engineering & Technology, Karur, Tamilnadu, India
V. Praveen
CSE, N.S.N College of Engineering & Technology, Karur, Tamilnadu, India
J. Banuchandhar
CSE, N.S.N College of Engineering & Technology, Karur, Tamilnadu, India
P. Susila
CSE, N.S.N College of Engineering & Technology, Karur, Tamilnadu, India

K-Means, Min-Min, Max-Min, Saving Matrix, Vehicle Routing Problem

  1. Anders, 2013 'A simple heuristic for vehicle routing – A variant of Clarke and Wright’s saving method’. Lulea University of technology, Industrial logistics, SE-97187 Lulea, Sweden.
  2. Behrouz Afshar-Nadjafi, Alireza Afshar-Nadjafi, 2014 'A constructive heuristic for time dependent multidepot vehicle routing problem with time-windows and heterogeneous fleet’, Journal of king saud university-Engineering sciences.
  3. Chopra, S., Meindl, P., 2004. Supply Chain Management –Strategy, Planning and Operation, 2nd ed. Pearson Prentice hall, Upper Saddle River.
  4. Chopra, S., Meindl, P., 2010. Supply Chain Management –Strategy, Planning and Operation, 2nd ed. Pearson Prentice hall, Upper Saddle River.
  5. Christian Prins, 'Two memetic algorithms for heterogeneous fleet vehicle routing problems’, engineering applications of artificial intelligence22, pp. 916-928, 2009.
  6. Cordeau, J-E, Gendreau, M., Laporte, G., Potvin, J-Y., Semet, F., 2002 A guide to vehicle routing heuristics. Journal of the Operational Research Society 53(5), 512-522.
  7. Christofides, N., Mingozzi, A., Toth, P., 1979. The vehicle routing problem In: Christofides, N., Mingozzi, A., Toth, P., Sand, C,(Eds.), Combinatorial Optimization, Wiley, Chichester, pp.315-338.
  8. G.B.Dantzig, J.H.Ramser, "The truck dispatching problem”, Management Science, Vol. 6, No. 1, pp.80-91, 1959.
  9. G.Clarke, J.Wright, "Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, Vol. 12, No. 4, pp. 568-581, 1964.
  10. Gaurav Sharma, Preeti Bansal, "Min-Min approach for scheduling in grid environment”, International Journal of Latest Trends in Engineering and Technology(IJLTET), Vol 1, Issue 1, May 2012.
  11. Laporte, G, 'The vehicle routing problem: An overview of exact and approximate algorithms’ European Journal of Operational Research 59(3), 345-358.
  12. Nawfal A.Mehdi, Ali Mamat, Hamidah Ibrahim, Shamala "Multiphase scalable grid scheduler based on Mullti-QoS using Min-Min heuristic”, IJACSA, Vol 1, No. 3, September 2010.
  13. Surekha P, Dr.S.Sumathi, 'Solution to multi-depot vehicle routing problems using genetic algorithms’, WAP Journal, Vol (1), No (3), pp.118-131, 2011.

Publication Details

Published in : Volume 2 | Issue 5 | September-October 2017
Date of Publication : 2017-10-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 193-198
Manuscript Number : CSEIT1172526
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

V. Hemalatha, K. Jothimani, V. Praveen, J. Banuchandhar, P. Susila , "A Survey on Proficient Solution for Automobile Routing Problem", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 5, pp.193-198, September-October.2017
URL : http://ijsrcseit.com/CSEIT1172526

Follow Us

Contact Us