Abstract | ||
---|---|---|
Sharma and Sharma [European Journal of Operational Research 122 (3) (2000) 37] have given a new procedure to solve the dual of the well-known uncapacitated transportation problem. This is expected to enhance the performance of dual based optimizing algorithms for solving the transportation problems. In this paper we give a heuristic that obtains a very good starting solution (with a duality gap of less than 2%) for the primal transportation problem in O(n3) time, and this is expected to enhance the performance of network simplex algorithm that obtains the optimal solution and runs in O(n3log(n)) time. Empirical investigation revealed that our heuristic gave significantly better solutions than the well-known Vogel's approximation method that runs in O(n2) time. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1016/S0377-2217(01)00396-4 | European Journal of Operational Research |
Keywords | DocType | Volume |
Transportation problem,Distribution,Transportation | Journal | 144 |
Issue | ISSN | Citations |
3 | 0377-2217 | 2 |
PageRank | References | Authors |
0.39 | 3 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
R. R. K. Sharma | 1 | 29 | 5.48 |
Saumya Prasad | 2 | 2 | 0.39 |