Vehicle Routing Algorithm based on Matrix

Authors

  • Prasad A. Hatwalne  Assistant Professor, DBACER, Nagpur, Maharastra, India
  • R.A.Lekurwale  Assistant Professor, DMIETR, Wardha, Maharastra, India

Keywords:

SCM, Distribution System

Abstract

Effective supply chain strategies for creating competitiveness revolve around the on-time delivery of quality goods and services, at a reasonable cost. This balance between time constraints and profit can be achieved if and only if distribution system is efficient. The efficiency of distribution system can be increased if the vehicle is routed efficiently through network of bunch of customer scattered over area so as to facilitate the scheme at low operational costs and short transporting time as possible also taking care of customer satisfaction as well. This article attempts to put forth the issues supporting importance of vehicle routing in SCM and presents an algorithm for vehicle routing problem. A realistic case study based on road network of city Yavatmal (India) is also presented.

References

  1. Sunil chopra and peter Meindl supply chain management. Strategy, planning and operation
  2. S G deshmukh and Dr R P Mohanty essentials of supply chain management
  3. S. C. Deshmukh, Siddharth Varma & Subhash Wadhwa “Implementing SCM in a firm: issues & remedies”, Volume 18, number 3, 2006, pp. (223-243).
  4. Marius M Solomon “Algorithm for the vehicle routing and scheduling problems with time window constraints” Volume 35,number 2 ,1985,pp.254
  5. Zillur Rahaman “Use of internet in supply chain management”, Industrial management and data systems, Volume 104, number1,2004,pp 31-41.
  6. B. S. Sahay, Ramnish Mohan & Vasant Cavale, “The Indian supply chain architecture” volume 8 number 2- 2003 pp(93-106).

Downloads

Published

2018-04-30

Issue

Section

Research Articles

How to Cite

[1]
Prasad A. Hatwalne, R.A.Lekurwale, " Vehicle Routing Algorithm based on Matrix, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 4, Issue 7, pp.494-498, March-April-2018.