Transportation problem in operational research

The next cheapest transport in this row is to Moscow where the transport qunatity amounts to the remaining demand of 20. In this case it's Dubai which gets delivered 40 units. You start with the cheapest field which still needs to be supplied. There is no more supply quantity left from New York, so you move on to the next supply city Cairo. Afterward the next cheapest field of the row gets allocated the remaining supply quantity (30). There you allocate the maximal amount of 60. The cheapest field in the first row is New York/London. The procedure of the column sequence method works respectively. We only apply the row sequence method to our example. Then you continue with the next row (column). You proceed in the same row (column) until the supply (demand) quantity is exhausted. Starting point is the cheapest field in the first row (column) which gets allocated the maximal possible amount. Simple row sequence or column-sequence methods The total transportation costs amount to 18,750.ДЄs already mentioned this method delivers a vague initial solution because it does not consider the costs at all, so the number of iterations to be taken to reaching the optimal solution can be enormous. Consequently there is no uncovered demand and all the supply is distributed. At the end you can see that the condition supply = demand is satisfied. At last Dubai gets an amount of 40 from Santiago de Chile. This is reason why Santiago de Chile sends an amount of 20. The total demand of London is not yet covered by this amount of 40.

Now the next field (London) gets the maximal amount which is limited by the supply of 70 minus the already exhausted 30 from the transportation between Cairo and Shanghai. At first you have to cover the rest of the demand of Shanghai with 30. New YorkвЂ™s supply quantity is dead, so you regard the next supply city Cairo.

The rest of New York (40) gets allocated to the neighboring field New York/Shanghai. New York supplies 90, but Moscow demands only 50, so the transported quantity amounts to 50. In our example, we start with the transport from New York to Moscow (north-west corner). The proceeding ends when the south-east corner is reached. The methodвЂ™s name derives from the beginning: the north-west corner (first row, first column). The north-west-corner method is the simplest method and delivers just a starting solution. 2 Simple row sequence or column-sequence methods.

Transportation problem in operational research