A Class of Methods Using Interval Arithmetic Operations for Solving Multi–Objective Interval Transportation Problems

Abstract

The objective of this article is studying on cost and time minimization of interval transportation problem (ITP) by using Best Candidate Method (BCM), Improved ASM method (IASM), ASM method, Zero Suffix Method (ZSM) and Zero Point Method (ZPM) with new interval arithmetic operations. We have obtained a better optimum result campared with existing methods available in the literature. The problems considered in this article are solved by the above listed methods without converting them into classical transportation problems. A comparative results are also given.