An Approach to Solve Capacitated Transportation Problem Under N-Vehicle Cost Varying Transportation Problem

In capacitated transportation problem there are some rim conditions or route restrictions. To obey this conditions, the vehicles are chosen such a way that their capacities are not violated the restriction.
In urban region unit transportation cost is not fixed but the vehicles are pre-paid system in nature. So unit transportation cost depends on the transport quantities or amount. This type of transportation problems are known as cost varying transportation problem.
In this paper we represent a N-vehicle cost varying transportation model to solve capacitated transportation problem. In this model the transportation cost is vary due to capacity of vehicles as well as amount of transport quantity. At first we propose an algorithm to determine unit transportation cost with initial allocation to the basic cells by North-West corner rule. Then solve it. The unit transportation cost is varied during optimality test when allocations are changed.
Numerical examples are presented to illustrate the N-vehicle cost varying transportation problem (TVCVTP). Finally, comparison is given to show better effective of this model.