Experimental Analysis of some Variants of Vogel's Approximation Method

This paper presents a variant of Vogel's approximation method (VAM) for transportation problems. The importance of determining efficient solutions for large sized transportation problems is borne out by many practical problems in industries, the military, etc. With this motivation, a few variants of VAM incorporating the total opportunity cost (TOC) concept were investigated to obtain fast and efficient solutions. Computational experiments were carried out to evaluate these variants of VAM. The quality of solutions indicates that the basic version of the VAM coupled with total opportunity cost (called the VAM–TOC) yields a very efficient initial solution. In these experiments, on an average, about 20% of the time the VAM–TOC approach yielded the optimal solution and about 80% of the time it yielded a solution very close to optimal (0.5% loss of optimality). The CPU time required for the problem instances tested was very small (on an average, less than 10 s on a 200 MHz Pentium machine with 64 MB RAM)