Abstract
The transportation problem (TP) is an important network-structured LP problem that arises in several contexts and can be applied to a wide variety of situations, such as scheduling, production, investment, deciding plant location and inventory control. The central concept in the TP is to determine the minimum total transportation cost of a commodity for satisfying the demand at destinations using the available supply at the origins. Generally, transportation problems are solved with the assumption that th transportation costs, supply and demand are specified precisely. However, in many cases, the decision maker does not possess exact information about the coefficients for the transportation problem. If the information is vague, that is, if it lacks precision, the corresponding coefficients or elements defining the problem can be formulated using fuzzy sets, giving rise to fuzzy TPs (FTPs). In this chapter, we first classify FTPs into four main groups and then discuss the solution methodologies for each one.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
