Back close

Routing Problem In Transportation Of Milk In A Diary-A Case Study

Publication Type : Journal Article

Publisher : International journal of Scientific & Technology Research

Authors : Sathidevi C., Dr. Usha Kumari P. V., Sreelekshmi R.

Source : International journal of Scientific & Technology Research, Volume 9, Issue 3 (2020)

Url : http://www.ijstr.org/final-print/mar2020/Routing-Problem-In-Transportation-Of-Milk-In-A-Diary-a-Case-Study.pdf

Keywords : Branch and Bound method, Delivery locations., Hungarian Principle, Optimized route, Spanning Tree, Transportation problem, Travelling salesman problem

Campus : Amritapuri

School : School of Arts and Sciences

Department : Mathematics

Year : 2000, 2020

Abstract : In this study our attempt is to optimize transportation route for a public sector milk dairy in Kerala. Our aim is to find the minimized route of transportation of milk from the main depot to various delivery locations, minimized transportation charges. The maximized annual profit of the diary is also calculated. The data collection was done in milma milk dairy situated in Punnapra, Alappuzha district, Kerala. We collected the data regarding distance, cost and the time taken by the vehicles to each delivery stations from the depot. The optimization of routes was done using different algorithms such as traveling salesman algorithm, branch and bound technique etc. After comparing the current route and optimized route we made the new optimized route structure. Through this study we found that, if the firm follows the new optimized route, the cost of transportation can be minimized.

Cite this Research Publication : S. R., Sathidevi C., and Dr. Usha Kumari P. V., “Routing Problem In Transportation Of Milk In A Diary-A Case Study”, International journal of Scientific & Technology Research, vol. 9, no. 3, 2020.

Admissions Apply Now