Random fuzzy dependent-chance programming and its hybrid intelligent algorithm
Information Sciences—Informatics and Computer Science: An International Journal
Sensitivity analysis for combinatorial optimization
Sensitivity analysis for combinatorial optimization
A Possibilistic and Stochastic Programming Approach to Fuzzy Random MST Problems*
IEICE - Transactions on Information and Systems
Computers & Mathematics with Applications
Portfolio selection problems with random fuzzy variable returns
Fuzzy Sets and Systems
Fuzzy pricing and marketing planning model: A possibilistic geometric programming approach
Expert Systems with Applications: An International Journal
An application of investment decision with random fuzzy outcomes
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Interactive multiobjective fuzzy random programming through the level set-based probability model
Information Sciences: an International Journal
Continuous review inventory model with variable lead time in a fuzzy random environment
Expert Systems with Applications: An International Journal
A GRASP-based approach to the generalized minimum spanning tree problem
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
This paper considers a minimum spanning tree problem under the situation where costs for constructing edges in a network include both fuzziness and randomness. In particular, this article focuses on the case that the edge costs are expressed by random fuzzy variables. A new decision making model based on a possibility measure and a value at risk measure is proposed in order to find a solution which fully reflects random and fuzzy information. It is shown that an optimal solution of the proposed model is obtained by a polynomial-time algorithm.