INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 9, ISSUE 03, MARCH 2020 ISSN 2277-8616 Routing Problem In Transportation Of Milk In A Diary-A Case Study Sreelekshmi R, Sathidevi.C, Ushakumari P V 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. Index Terms: Transportation problem, Travelling Salesman problem, Branch and Bound method, Optimized route, Spanning Tree, Hungarian Principle, Delivery locations. —————————— —————————— 1 INTRODUCTION 2 SCOPE OF THE STUDY Transportation problem is a special type of linear 1. To optimize the route of transportation of milk from programing problem which deals with the minimization of the main depot to different delivery locations. cost of transportation of any product from a number of 2. To find the optimized cost of transportation and origins to a number of destinations. The study was compare with the present cost. completed in a milma dairy situated in Alappuzha district in 3. To find minimum time required to reach each Kerala state. The central product dairy is the main dairy delivery location based on the optimized route and under the immediate control of Kerala Co-operative Milk to check whether milk can be delivered without Marketing Federation (K.C.M.M.F) [1] limited. The present damage. capacity of milk in the dairy is 1, 00,000 liters/day. This firm creates wide variety of items such as curd, ghee, flavored 3 DATA COLLECTION milk, mango refresh in tetra pack etc. The major mode of Data collection is the systematic way of gathering transportation of milk is by road. The dairy comprises of information about a particular area of interest from different many delivery locations in order to distribute their products sources. A person can collect the required information by in the best quality in any remote corner of the district. In the different tools like field visit, questionnaire preparation etc. initial step of the work, we collected the details of the We collected the data from the milk diary by field visit. We existing route tracked by the depot, the cost of have visited the milma diary at Alappuzha to collect the transportation and the time taken to reach each delivery details of transportation of milk from the depot to various locations. Then depending on this data, matrix showing the delivery locations. To get the information expected to shape distances, route diagrams and the present cost of the course structure, the data collection was separated into transportation is calculated. We consider the case of various sections. In the first stage, details of various transportation of milk from a diary in Kerala situate at circulation areas of milk are collected. This segment looked Alappuzha district and the minimum distance, minimum to give data about various courses on the present cost of transportation of milk to different destinations are transportation configuration, to assemble all data about the calculated. To find the optimized route of transportation, we number of vehicles utilized in each route and their most use the tools such as travelling salesman algorithm, and the extreme conveying capacity. The second segment manages technique of branch and bound. We have done a to make a course format of all the transportation routes. comparative study on the existing route and the new This segment was in charge of deciding roads, routes and optimized route. The annual profit earned by the depot is the various areas of the present plan on the geographic also calculated. guide and furthermore to discover the separations between the appropriate areas secured by every vehicle with in a course and to outline the transportation network. The third stage manages social event insights concerning ___________________________________ transportation. In this part, information‘s including diverse delivery locations, different courses of delivery, distance • Sreelekshmi R is currently pursuing masters degree program in travelled and number of vehicles used for transportations is Mathematics in Amrita Vishwa Vidyapeetham, Amritapuri Campus, Kollam, Kerala, India PH-04762801280. E-mail: collected. Expenses of transportation includes the vehicle [email protected] rent, renting methods, and normal costs on each course. • Sathidevi.C, Department of Mathematics, Amrita Vishwa After the collection of major data with respect to the Vidyapeetham, Amritapuri Campus, Kollam, Kerala, India, PH- parameters obtained about each route, it was then 04762801504. E-mail: [email protected] represented in a tabular form to get the comparison of each • Ushakumari P V Department of Mathematics, Amrita Vishwa Vidyapeetham, Amritapuri Campus, Kollam, Kerala, India, PH- route easily. The conclusion comprises of optimized cost, 04762801504. E-mail: [email protected] time, distance and the annual profit achieved by the firm. The GPS system is also used to get the route followed by the firm and to measure the distance between each node. 7093 IJSTR©2020 www.ijstr.org INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 9, ISSUE 03, MARCH 2020 ISSN 2277-8616 An outline of cost of transportation of milk from the origin to TABLE 4.6 different destinations followed by the firm is calculated. COMPARISON OF DISTANCE USING TRAVELING SALESMAN AND BRANCH AND BOUND METHOD 4 WORKING PROCEDURE Traveling salesman Branch and bound In this section distance matrices were prepared by using Route method (Distance in (Distance in Km) the collected data, and the current route has been Km) optimized by different methods. Alappuzha 36.9 37.6 4.1 DISTANCE Matrix It is important to find the shortest distance connecting the Mavelikkara 51.2 58.3 depot and all the delivery locations in order to minimize the Aroor 113.4 114.4 path from every single location. The distance matrix was prepared by using the data given by the depot and GPS As per the comparison between the two methods, we found system is used also to find the shortest possible routes from that the travelling salesman method is more efficient in the depot to different delivery locations. The distance matrix finding the minimum distance for every delivery locations. is shown in Table 4.1, 4.2 and 4.3. Therefore we have chosen the distance obtained by TSP and expenses are calculated using this distance. The 4.2 Optimized Route total distance covered by the milk carrier for each route is Route optimization is done using different techniques such calculated and a comparison of the distance between as branch and bound and traveling salesman method. The current route and the optimized route is shown in Table 4.7 optimized route is shown in Table 4.5 TABLE 4.7 4.3 Comparing the Designs COMPARISON OF DISTANCE BETWEEN CURRENT After finding each optimized route by both the techniques, a ROUTE AND OPTIMIZED ROUTE comparative study on the current route and optimized route is made from each origin to its delivery locations. Route Current route Optimized route 4.4 Methodology Adopted Alappuzha 37.3 36.9 4.4.1 Branch and Bound Technique Mavelikkara 64.9 51.2 A branch and bound algorithm consists of a systematic enumeration of candidate solutions by means of state Aroor 113.7 113.4 space and the set of candidate solutions is thought of as forming a rooted tree with the full set as the root. In this algorithm we find the bounds for the cost function and the The table showing the optimized distances and expenses solution set is expressed as branches of trees. Before are prepared and is tabulated The transportation expenses enumerating the candidate solutions of a branch, the from depot to each route is calculated and the comparison branch is checked against upper and lower of the current expenses and the optimized expense is estimated bounds on the optimal solution, and is discarded displayed in Table 4.8 if it cannot produce a better solution than the best one found so far by the algorithm. The branch and bound TABLE 4.8 algorithm works on the bounding principle of optimization. TRANSPORTATION EXPENSES In this method, the search procedure depicts a tree structure and the solutions obtained after each step is represented in the form of branches of tree. We need to find Current Optimized Expense the solution or root which minimizes the distance from the Route Expense in in Rupees/day starting node to the last destination. Rupees/day 4.4.2 Traveling Salesman Problem Alappuzha 2592.35 2564.55 The traveling salesman problem (TSP) is an algorithmic approach for finding the shortest route between a set of Mavelikkara 2684.43 2054.65 points and locations that must be visited by a person. In the problem statement, the points or nodes are the cities that a Aroor 7305.22 7285.95 salesperson might visit exactly once and come back to the starting node. The salesman‗s goal is to keep both the travel costs and the distance travelled as minimum as As explained in 4.1 the details of the data collected from the possible. The Hungarian principle is used to find the depot to each delivery locations are displayed in the optimized route followed by the salesperson, to minimize following tables.