Abstract | ||
---|---|---|
We pose the transportation problem in a slightly different form to obtain a dual problem that has a special structure. We exploit the structure of the dual problem to give a new heuristic that runs in O(cn2) time (n is number of nodes in the network and c is a constant) to improve the dual solution. Our heuristic obtained the optimal solution to several small sized transportation problems that we attempted; and for large sized problems it obtained solutions that were within 82% of the optimal solution on average. Our approach gives good starting solutions for dual based approaches used for solving transportation problems and thus is expected to enhance their computational performance. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1016/S0377-2217(99)00081-8 | European Journal of Operational Research |
Keywords | Field | DocType |
Transportation,Distribution,Transportation problem | Mathematical optimization,Heuristic,Fuzzy transportation,Exploit,Transportation theory,Duality (optimization),Constraint satisfaction dual problem,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
122 | 3 | 0377-2217 |
Citations | PageRank | References |
7 | 1.52 | 1 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
R. R. K. Sharma | 1 | 29 | 5.48 |
K. D. Sharma | 2 | 7 | 1.52 |