scispace - formally typeset
Search or ask a question
Book ChapterDOI

On Bottleneck-Rough Cost Interval Integer Transportation Problems

01 Jan 2018-pp 291-299
TL;DR: The level maintain method will dispense the necessary determined support to decision-makers when they are handling time-related logistic problems in rough nature by finding all efficient solutions to a bottleneck-rough cost interval integer transportation problem.
Abstract: An innovative method, namely, level maintain method, is proposed for finding all efficient solutions to a bottleneck-rough cost interval integer transportation problem in which the unit transportation cost, supply, and demand parameters are rough interval integers and the transportation time parameter is an interval integer. The solving procedure of the suggested method is expressed and explained with a numerical example. The level maintain method will dispense the necessary determined support to decision-makers when they are handling time-related logistic problems in rough nature.
References
More filters
Journal ArticleDOI
TL;DR: This approach seems to be of fundamental importance to artificial intelligence (AI) and cognitive sciences, especially in the areas of machine learning, knowledge acquisition, decision analysis, knowledge discovery from databases, expert systems, decision support systems, inductive reasoning, and pattern recognition.
Abstract: Rough set theory, introduced by Zdzislaw Pawlak in the early 1980s [11, 12], is a new mathematical tool to deal with vagueness and uncertainty. This approach seems to be of fundamental importance to artificial intelligence (AI) and cognitive sciences, especially in the areas of machine learning, knowledge acquisition, decision analysis, knowledge discovery from databases, expert systems, decision support systems, inductive reasoning, and pattern recognition.

7,185 citations

Journal ArticleDOI
TL;DR: Compared to the previous modeling efforts, the proposed IRFLP shows uniqueness in addressing the interaction between dual intervals of highly uncertain parameters, as well as their joint impact on the system.

107 citations

Journal ArticleDOI
TL;DR: This paper deals with three different models of the Transportation problem, focusing on the case of the Fuzzy Transportation Problem, for which methods of solution are proposed and discussed.
Abstract: For a given Transportation Problem, several assumptions can be considered on the supply and demand levels. In accordance with the kind of information the decision maker has, s/he may express those values in many ways. Here three situations are considered: the decision maker can exactly define them as point values, s/he can give them as interval values or, if s/he has vague information, express them as fuzzy numbers. For each of these three cases, different models (classical, interval and fuzzy) of the Transportation Problem may be obtained, respectively. This paper deals with these three different models. The links among them are provided, focusing on the case of the Fuzzy Transportation Problem, for which methods of solution are proposed and discussed.

88 citations

Journal Article
TL;DR: In this paper, a new method named ASM-Method is proposed for finding an optimal solution for a wide range of transportation problems, which requires very simple arithmetical and logical calculation.
Abstract: In this paper a new method named ASM-Method is proposed for finding an optimal solution for a wide range of transportation problems, directly. A numerical illustration is established and the optimality of the result yielded by this method is also checked. The most attractive feature of this method is that it requires very simple arithmetical and logical calculation, that's why it is very easy even for layman to understand and use. This method will be very lucrative for those decision makers who are dealing with logistics and supply chain related issues. Because of the simplicity of this method one can easily adopt it among the existing methods.

76 citations

Journal ArticleDOI
TL;DR: A new kind of mathematical programming problems, in which the decision set is a rough set, is called a rough programming problem, which has a rough optimal solution and a rough saddle point.

36 citations