Finding the Solution of Balanced and Unbalanced Intuitionistic Fuzzy Transportation Problems by Using Different Methods With Some Software Packages

Finding the Solution of Balanced and Unbalanced Intuitionistic Fuzzy Transportation Problems by Using Different Methods With Some Software Packages

P. Senthil Kumar (MVJ College of Engineering, India)
DOI: 10.4018/978-1-7998-5077-9.ch015


In this chapter, two different methodologies are proposed to find out the optimal solution to the balanced and unbalanced intuitionistic fuzzy transportation problems (UBIFTPs). In addition, the parameter of both the balanced and UBIFTPs are considered to be triangular intuitionistic fuzzy numbers (TIFNs). Two new methodologies, respectively method-1 and method-2, are presented in this chapter. Proposed method-1 is based on linear programming technique, and proposed method-2 is based on modified distribution method. Both the methodologies are used to solve the balanced and UBIFTPs. The ideas of the proposed methodologies are illustrated with the help of real-life numerical examples. The solutions obtained by the proposed methodologies are checked with some software (e.g., MATLAB, LINGO) and the computer code related to the proposed problems is also given. The unique results, comparative study, discussions, and the merits of the proposed methodologies are all given. At the end of the chapter, future work is mentioned.
Chapter Preview

Introduction Of Classical Transportation Problem

In several real-life situations, there is a need to transport the homogeneous items/materials from various sources (factories) to different destinations (storage centres/retail stores) and the aim of the decision-makers (DMs) is to find how much quantity of the materials from which source to which destination should be supplied so that all the supply points are fully used and demand of all the destinations is fulfilled as well as total transportation cost is minimum/total transportation profit is maximum.

The TP plays a vital role in logistics and supply chain management for reducing cost and improving services. In today’s highly competitive market, the pressure on organizations to find better ways to create and deliver items and services to customers becomes more strong. How and when to send the items to the customers in the quantities which they want in a cost-effective manner becomes more challenging one. The transportation model provides a powerful framework to meet this challenge. They ensure the efficient movement and timely availability of raw materials and finished goods.

Resource allocation is used to assign the available/existing resources in an economic way. When the resources to be allocated are scarce, a well-planned action is necessary for a decision-maker (DM) to attain the optimal utility. If the supplying sources and the receiving agents are finite, the best pattern of the allocation to get the minimum cost or the best plan with the maximum profit, whichever may be applicable to the problem, is to be found out. Those classes of problems are referred to as ‘allocation problems’ and are divided into two categories, namely:

  • transportation problems (TPs) and

  • assignment problems.

This type of allocation problems is studied in optimization or applied operations research.

During world war-II, Britain was having very limited military resources; therefore, there was an urgent need to allocate resources to the various military operations and to the activities within each operation in an effective manner. Therefore, the British military executives called upon a team of scientist to apply scientific approach to study the strategic and tactical problems related to air and land defence of the country. As the team was dealing with research of military operations, the work of this team of scientists was called as 'Operations Research'.

The TP is one of the subclasses of linear programming problem (LPP). The objective of the TP is to transport various quantities of a single homogeneous products/items that are initially stored at various origins, to different destinations in such a way that the total transportation profit is maximum for a maximization problem and the total transportation cost is minimum for a minimization problem.

The conventional TP deals with the transportation a certain commodity from each of m origins (978-1-7998-5077-9.ch015.m01) to any of n destinations978-1-7998-5077-9.ch015.m02). The origins are factories with respect capacities 978-1-7998-5077-9.ch015.m03 and the destinations are warehouses with required levels of demands 978-1-7998-5077-9.ch015.m04. For the transport of a unit of the given commodity from the ith source/origin to the jth destination a cost 978-1-7998-5077-9.ch015.m05 is assigned with 978-1-7998-5077-9.ch015.m06 for all 978-1-7998-5077-9.ch015.m07. Hence, one must determine the amounts 978-1-7998-5077-9.ch015.m08 to be transported from all the sources (978-1-7998-5077-9.ch015.m09) to all the destinations 978-1-7998-5077-9.ch015.m10 in such a way that the total cost is minimized.

Complete Chapter List

Search this Book: