A note on solving multicriteria transportation–location problems by fuzzy programming

Transportation–location problems are generalizations of the classical transportation problem in which, in addition to seeking the quantities to be transported from supply points to demand points by various vehicles, it is also necessary to find, at the same time, the ‘optimal’ locations of one or several supply points in Euclidean space with respect to a fixed and known set of demand points, where these new supply points and vehicles are supposed to have certain limitations on their capacity to supply the product. Since the various decision makers involved in the process will have different opinions of the importance of the existing facilities, a multicriteria problem with several objectives arises. In this paper, we use fuzzy techniques to find an optimal compromise solution. We prove that the final compromise solution is weakly Pareto optimal and Pareto optimal, if it is unique.