论文信息 - SOLVING TRANSPORTATION PROBLEM WITH THE VARIOUS METHOD OF LINEAR PROGRAMMING PROBLEM

SOLVING TRANSPORTATION PROBLEM WITH THE VARIOUS METHOD OF LINEAR PROGRAMMING PROBLEM

The Transportation Problem is one of the subclass of linear programming problem which the objective is to minimize transportation cost of goods transport to various origins to different destinations. In this paper we are representing the transportation problem for Albert David Company to reduce transportation cost, its working with 3 plants and 14 depots in all over India. In [6][7] we are solve the transportation problem with the help of dual simplex and two phase method. Here we are solving this problem with the help of Dual simplex method, Two Phase method and Big M Method by using Tora software and we are comparing the obtained optimal solution with Vogel Approximation Method.

[1] F. L. Hitchcock. The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[2] Peter L. Hammer,et al. Time‐minimizing transportation problems , 1969 .

[3] Sonia,et al. Bilevel time minimizing transportation problem , 2008, Discret. Optim..

[4] Sonia,et al. Two level hierarchical time minimizing transportation problem , 2004 .

[5] Tapan Kumar Roy,et al. Multiobjective Transportation Model with Fuzzy Parameters: Priority based Fuzzy Goal Programming Approach , 2008 .

[6] Charalampos Papamanthou,et al. Computational experience with exterior point algorithms for the transportation problem , 2004, Appl. Math. Comput..

[7] Satya Prakash. On minimizing the duration of transportation , 1982 .

[8] T. Koopmans. Optimum Utilization of the Transportation System , 1949 .