Least Cost Methode Algorithm

Least Cost method algorithm is as follows:

1. Make initial transportation table format.
2. Capacity and demand must be the same. If it is not the same (maybe capacity> demand or perhaps capacity 3. Having prepared the table, we do start charging empty cells starting from cells that have the least cost / least until satisfied (with respect to capacity and demand). Completion is expected early cell filled eligible m + n -1 because if it does not comply then be called degeneration and this case is its own solution.
3. Calculate the Total Cost of transportation early to know whether the total cost has been minimal or not it should be checking the index improvement empty cells. If all the improvement index ≥ 0 then STOP.
4. If there is still improvement index is negative then do the reallocation started from cells that have the largest negative index improvement and then calculate the total cost of transportation.
5. And so on until the value of all the positive index improvement

Share