An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data

This paper puts forward an integrated fuzzy simulation-fuzzy data envelopment analysis (FSFDEA) algorithm to cope with a special case of single-row facility layout problem (SRFLP). Discrete-event-simulation, a powerful tool for analyzing complex and stochastic systems, is employed for modeling different layout formations. Afterwards, a range-adjusted measure (RAM) is used as a data envelopment analysis (DEA) model for ranking the simulation results and finding the optimal layout design. Due to ambiguousness associated with the processing times, fuzzy sets theory is incorporated into the simulation model. Since the results of simulation are in the form of possibility distributions, the DEA model is treated on a fuzzy basis; therefore, a recent possibilistic programming approach is used to convert the fuzzy DEA model to an equivalent crisp one. The proposed FSFDEA algorithm is capable of modeling and optimizing small-sized SRFLP’s in stochastic, uncertain, and non-linear environments. The solution quality is inspected through a real case study in a refrigerator manufacturing company.     

Fuzzy data envelopment analysis (DEA): Model and ranking method

Data Envelopment Analysis (DEA) is a very effective method to evaluate the relative efficiency of decision-making units (DMUs). Since the data of production processes cannot be precisely measured in some cases, the uncertain theory has played an important role in DEA. This paper attempts to extend the traditional DEA models to a fuzzy framework, thus producing a fuzzy DEA model based on credibility measure. Following is a method of ranking all the DMUs. In order to solve the fuzzy model, we have designed the hybrid algorithm combined with fuzzy simulation and genetic algorithm. When the inputs and outputs are all trapezoidal or triangular fuzzy variables, the model can be transformed to linear programming. Finally, a numerical example is presented to illustrate the fuzzy DEA model and the method of ranking all the DMUs.     

Imprecise set and fuzzy valued probability

Set valued probability and fuzzy valued probability theory is used for analyzing and modeling highly uncertain probability systems. In this paper the set valued probability and fuzzy valued probability are defined over the measurable space. They are derived from a set and fuzzy valued measure using restricted arithmetics. The range of set valued probability is the set of subsets of the unit interval and the range of fuzzy valued probability is the set of fuzzy sets of the unit interval. The expectation with respect to set valued and fuzzy valued probability is defined and some properties are discussed. Also, the fuzzy model is applied to binomial model for the price of a risky security.     

The transformation method for the simulation and analysis of systems with uncertain parameters

In this paper, the transformation method is introduced as a powerful approach for both the simulation and the analysis of systems with uncertain model parameters. Based on the concept of α-cuts, the method represents a special implementation of fuzzy arithmetic that avoids the well-known effect of overestimation which usually arises when fuzzy arithmetic is reduced to interval computation. Systems with uncertain model parameters can thus be simulated without any artificial widening of the simulation results. As a by-product of the implementation scheme, the transformation method also provides a measure of influence to quantitatively analyze the uncertain system with respect to the effect of each uncertain model parameter on the overall uncertainty of the model output. By this, a special kind of sensitivity analysis can be defined on the basis of fuzzy arithmetic. Finally, to show the efficiency of the transformation method, the method is applied to the simulation and analysis of a model for the friction interface between the sliding surfaces of a bolted joint connection.     

Fuzzy risk adjusted performance measures: Application to hedge funds

In this paper, following the notion of probabilistic risk adjusted performance measures, we introduce that of fuzzy risk adjusted performance measures (FRAPM). In order to deal efficiently with the closing-based returns bias induced by market microstructure noise, as well as to handle their uncertain variability, we combine fuzzy set theory and probability theory. The returns are first represented as fuzzy random variables and then used in defining fuzzy versions of some adjusted performance measures. Using a recent ordering method for fuzzy numbers, we propose a ranking of funds based on these fuzzy performance measures. Finally, empirical studies carried out on fifty French hedge funds confirm the effectiveness and give the benefits of our approach over the classical performance ratios.     

基于累积共识贡献的不确定语言共识决策方法

针对不确定加型语言偏好信息下的群决策问题,提出一种基于累积共识贡献的自适应式语言共识决策方法。首先,将不确定加型语言偏好转化为不确定二元语义偏好,定义个体一致度与个体共识偏度,并利用它们构建确定专家初始权重的优化模型;然后,利用不确定二元语义的可能度构造集结模糊评价矩阵以及方案的集结群体偏好,提出专家累积共识贡献测度和群体共识测度,通过对拥有较少合作的专家权重进行惩罚让群体自适应地达成共识,无需强迫专家修改其观点,提出一种群体共识决策方法对方案排序择优。最后,通过一个算例说明方法的可行性和有效性。     

How to optimize discrete-event systems from a single sample path by the score function method

We present a method for deriving theoptimal solution of a class of mathematical programming problems, associated with discrete-event systems and in particular with queueing models, while using asingle sample path (single simulation experiment) from the underlying process. Our method, called thescore function method, is based on probability measure transformation derived from the efficient score process and generating statistical counterparts to the conventional deterministic optimization procedures (e.g. Lagrange multipliers, penalty functions, etc.). Applications of our method to optimization of various discrete-event systems are presented, and numerical results are given.Research supported by the L. Edelstein Research Fund at the Technion-Israel Institute of Technology.     

A heuristic procedure for solving the dynamic probabilistic project expediting problem

Because of activity duration uncertainties, large-scale projects can often be modeled most realistically as probabilistic activity networks. The complex interactions among activities with uncertain durations virtually assures a low probability that these projects will be completed before predetermined due dates. As a result, it is often necessary to expedite individual activities in these projects to improve due date performance. This research introduces a dynamically applied matrix simulation approach for selecting expediting options in order to control the probability of successful project completion before predefined due dates. Experiments are conducted to demonstrate the ability of this new approach to generate quality alternatives and efficiently evaluate large-scale projects.     

A new method for ranking fuzzy numbers and its application to group decision making

In this paper, a new method for comparing fuzzy numbers based on a fuzzy probabilistic preference relation is introduced. The ranking order of fuzzy numbers with the weighted confidence level is derived from the pairwise comparison matrix based on 0.5-transitivity of the fuzzy probabilistic preference relation. The main difference between the proposed method and existing ones is that the comparison result between two fuzzy numbers is expressed as a fuzzy set instead of a crisp one. As such, the ranking order of n fuzzy numbers provides more information on the uncertainty level of the comparison. Illustrated by comparative examples, the proposed method overcomes certain unreasonable (due to the violation of the inequality properties) and indiscriminative problems exhibited by some existing methods. More importantly, the proposed method is able to provide decision makers with the probability of making errors when a crisp ranking order is obtained. The proposed method is also able to provide a probability-based explanation for conflicts among the comparison results provided by some existing methods using a proper ranking order, which ensures that ties of alternatives can be broken.     

Developing activity duration specification limits for effective project control

We propose a new structure for guiding project control decisions to ensure that a project is completed on schedule when activity durations are uncertain and modeled by random variables. This structure consists of specifying a specification limit for each activity duration. During the project, if the time to complete an activity is going to exceed its specification limit, actions are taken, at some cost, to bring the time down to that limit. We present an algorithm that selects specification limits to achieve targeted on-time probabilities at minimum cost. The method involves estimating the effect of small changes in specification limits on the probability of completing a project on time and on the cost of control actions. The required simulation-based estimates for all activities are obtained in a single set of simulation runs. Computational results show the algorithm to be efficient to apply and, when compared to a more ad hoc approach of using activity importance measures (specifically, activity criticality), the use of the resulting specification limits to be of significant benefit in guiding project control decisions.     

基于不确定互补判断矩阵的多目标决策方法研究

针对多目标决策中两种不确定互补判断矩阵形式(区间数互补判断矩阵与三角模糊数互补判断矩阵),给出了各自的模型及其排序方法,并对一些方法进行了推广,提出了一些模型的新方法,为不确定互补判断矩阵排序方法的进一步研究奠定了基础.     

Multicriteria decision-making method using the Dice similarity measure based on the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets

This paper proposes the concept of the reduct intuitionistic fuzzy sets of interval-valued intuitionistic fuzzy sets (IVIFSs) with respect to adjustable weight vectors and the Dice similarity measure based on the reduct intuitionistic fuzzy sets to explore the effects of optimism, neutralism, and pessimism in decision making. Then a decision-making method with the pessimistic, optimistic, and neutral schemes desired by the decision maker is established by combining adjustable weight vectors and the Dice similarity measure for IVIFSs. The proposed decision-making method is more flexible and adjustable in practical problems and can determine the ranking order of alternatives and the optimal one(s), so that it can overcome the difficulty of the ranking order and decision making when there exist the same measure values of some alternatives in some cases. This adjustable feature can provide the decision maker with more selecting schemes and actionable results for the decision-making analysis. Finally, two illustrative examples are employed to show the feasibility of the proposed method in practical applications.     

Project scheduling problem with mixed uncertainty of randomness and fuzziness

Project scheduling problem is to determine the schedule of allocating resources so as to balance the total cost and the completion time. This paper considers project scheduling problem with mixed uncertainty of randomness and fuzziness, where activity duration times are assumed to be random fuzzy variables. Three types of random fuzzy models as expected cost minimization model, (α, β)-cost minimization model and chance maximization model are built to meet different management requirements. Random fuzzy simulations for some uncertain functions are given and embedded into genetic algorithm to design a hybrid intelligent algorithm. Finally, some numerical experiments are given for the sake of illustration of the effectiveness of the algorithm.     

Infinitesimal Perturbation Analysis: A Tool for Simulation

Perturbation analysis is a technique that expedites the process of performing experiments on discrete-event simulation models. This makes it possible to derive sensitivity estimates from one computer execution of a simulation model. Infinitesimal perturbation analysis (IPA) is one class of algorithms used in perturbation analysis. In this paper, the techniques and algorithms used in simulation to perform infinitesimal perturbation analysis are examined. Each algorithm is discussed in detail, with comments concerning implementation problems and examples with experimental results for serial transfer lines. The results of this paper show that for simple systems, IPA can be easily implemented in a general-purpose simulation language such as SIMAN. Unfortunately, for any given system, parameter or performance measure, the algorithm used to generate the gradient may vary. Additionally, algorithms for more complex classes of problems do not yet exist. This problem hampers the current possibility of incorporating IPA into general-purpose simulation languages.     

On-line identification of language measure parameters for discrete-event supervisory control

The discrete-event dynamic behavior of physical plants is often represented by regular languages that can be realized as deterministic finite state automata (DFSA). The concept and construction of signed real measures of regular languages have been recently reported in literature. Major applications of the language measure are: quantitative evaluation of the discrete-event dynamic behavior of unsupervised and supervised plants; and analysis and synthesis of optimal supervisory control algorithms in the discrete-event setting. This paper formulates and experimentally validates an on-line procedure for identification of the language measure parameters based on a DFSA model of the physical plant. The recursive algorithm of this identification procedure relies on observed simulation and/or experimental data. Efficacy of the parameter identification procedure is demonstrated on the test bed of a mobile robotic system, whose dynamic behavior is modelled as a DFSA for discrete-event supervisory control.     

Comparing and ranking fuzzy numbers using ideal solutions

This paper presents a new approach for comparing and ranking fuzzy numbers in a simple manner in decision making under uncertainty. The concept of ideal solutions is sensibly used, and a distance-based similarity measure between fuzzy numbers is appropriately adopted for effectively determining the overall performance of each fuzzy number in comparing and ranking fuzzy numbers. As a result, all the available information characterizing a fuzzy number is fully utilized, and both the absolute position and the relative position of fuzzy numbers are adequately considered, resulted in consistent rankings being produced in comparing and ranking fuzzy numbers. The approach is computationally simple and its underlying concepts are logically sound and comprehensible. A comparative study is conducted on the benchmark cases in the literature that shows the proposed approach compares favorably with other approaches examined.     

基于犹豫模糊二元语义的多属性决策方法

深入研究了犹豫模糊二元语义多属性决策问题。首先利用幂均算子给出了犹豫模糊二元语义集的均值函数,并基于均匀分布概率准则和二元语义的距离测度提出了犹豫模糊二元语义集两两比较的可能度公式,进一步给出了可能度排序公式的性质。针对属性值为犹豫模糊二元语义集的多属性决策问题,提出了一种基于熵权的多属性决策方法。最后结合实际问题,验证了该方法的有效性和可行性。     

Analysis of critical paths in a project network with fuzzy activity times

This paper proposes an approach to critical path analysis for a project network with activity times being fuzzy numbers, in that the membership function of the fuzzy total duration time is constructed. The basic idea is based on the extension principle and linear programming formulation. A pair of linear programs parameterized by possibility level α is formulated to calculate the lower and upper bounds of the fuzzy total duration time at α. By enumerating different values of α, the membership function of the fuzzy total duration time is constructed, and the fuzzy critical paths are identified at the same time. Moreover, by applying the Yager ranking method, definitions of the most critical path and the relative degree of criticality of paths are developed; and these definitions are theoretically sound and easy to use in practice. Two examples with activity times being fuzzy numbers of L-R and L-L types discussed in previous studies are solved successfully to demonstrate the validity of the proposed approach. Since the total duration time is completely expressed by a membership function rather than by a crisp value, the fuzziness of activity times is conserved completely, and more information is provided for critical path analysis.     

Comparison of fuzzy numbers using a fuzzy distance measure

A new approach for ranking fuzzy numbers based on a distance measure is introduced. A new class of distance measures for interval numbers that takes into account all the points in both intervals is developed first, and then it is used to formulate the distance measure for fuzzy numbers. The approach is illustrated by numerical examples, showing that it overcomes several shortcomings such as the indiscriminative and counterintuitive behavior of several existing fuzzy ranking approaches.     

A new modularity measure for Fuzzy Community detection problems based on overlap and grouping functions

One of the main challenges of fuzzy community detection problems is to be able to measure the quality of a fuzzy partition. In this paper, we present an alternative way of measuring the quality of a fuzzy community detection output based on n-dimensional grouping and overlap functions. Moreover, the proposed modularity measure generalizes the classical Girvan–Newman (GN) modularity for crisp community detection problems and also for crisp overlapping community detection problems. Therefore, it can be used to compare partitions of different nature (i.e. those composed of classical, overlapping and fuzzy communities). Particularly, as is usually done with the GN modularity, the proposed measure may be used to identify the optimal number of communities to be obtained by any network clustering algorithm in a given network. We illustrate this usage by adapting in this way a well-known algorithm for fuzzy community detection problems, extending it to also deal with overlapping community detection problems and produce a ranking of the overlapping nodes. Some computational experiments show the feasibility of the proposed approach to modularity measures through n-dimensional overlap and grouping functions.