.png){kind=icon}
.png){kind=icon}
Return
Time Optimization in Totally Uncertain Transportation Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s40815-016-0176-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Vinotha et al. (J Intell Fuzzy Syst 23:93-99, 2012) proposed a method for minimization of the total time of the balanced fully fuzzy transportation problems. Their paper deals with fuzzy numbers and their arithmetic operations. The ranking function used in [23] does not depend on the height of the fuzzy number, which questions the use of the generalized fuzzy numbers to represent the data. In this paper, we propose a procedure by converting the fuzzy problem to a crisp one using a ranking function that considers the height of the fuzzy number and illustrate it using the numerical example considered in Vinotha et al. [23]. Further, we suggest a procedure for the unbalanced problems, which tells about the source(s) whose availability be increased to meet the demand of each destination in minimum time.
Keywords:
Generalized exponential fuzzy number
Preference index
Totally uncertain transportation problem
Time minimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
2.2K
Citations:
4.3K