A class of multiobjective linear programming models with random rough coefficients

In the present paper, we concentrate on dealing with a class of multiobjective programming problems with random rough coefficients. We first discuss how to turn a constrained model with random rough variables into crisp equivalent models. Then an interactive algorithm which is similar to the interactive fuzzy satisfying method is introduced to obtain the decision maker’s satisfying solution. In addition, the technique of random rough simulation is applied to deal with general random rough objective functions and random rough constraints which are usually hard to convert into their crisp equivalents. Furthermore, combined with the techniques of random rough simulation, a genetic algorithm using the compromise approach is designed for solving a random rough multiobjective programming problem. Finally, illustrative examples are given in order to show the application of the proposed models and algorithms.     

Interactive multiobjective fuzzy random linear programming: Maximization of possibility and probability

This paper considers multiobjective linear programming problems with fuzzy random variables coefficients. A new decision making model is proposed to maximize both possibility and probability, which is based on possibilistic programming and stochastic programming. An interactive algorithm is constructed to obtain a satisficing solution satisfying at least weak Pareto optimality.     

On fuzzy random multiobjective quadratic programming

In this paper, a multiobjective quadratic programming problem having fuzzy random coefficients matrix in the objective and constraints and the decision vector are fuzzy pseudorandom variables is considered. First, we show that the efficient solutions of fuzzy quadratic multiobjective programming problems are resolved into series-optimal-solutions of relative scalar fuzzy quadratic programming. Some theorems are proved to find an optimal solution of the relative scalar quadratic multiobjective programming with fuzzy coefficients, having decision vectors as fuzzy variables. At the end, numerical examples are illustrated in the support of the obtained results.     

Maximum cut in fuzzy nature: Models and algorithms

The maximum cut (Max-Cut) problem has extensive applications in various real-world fields, such as network design and statistical physics. In this paper, a more practical version, the Max-Cut problem with fuzzy coefficients, is discussed. Specifically, based on credibility theory, the Max-Cut problem with fuzzy coefficients is formulated as an expected value model, a chance-constrained programming model and a dependent-chance programming model respectively according to different decision criteria. When these fuzzy coefficients are represented by special fuzzy variables like triangular fuzzy numbers and trapezoidal fuzzy numbers, the crisp equivalents of the fuzzy Max-Cut problem can be obtained. Finally, a genetic algorithm combined with fuzzy simulation techniques is designed for the general fuzzy Max-Cut problem under these models and numerical experiment confirms the effectiveness of the designed genetic algorithm.     

Fuzzy inventory model with two warehouses under possibility measure on fuzzy goal

Multi-item inventory model with stock-dependent demand and two-storage facilities is developed in fuzzy environment (purchase cost, investment amount and storehouse capacity are imprecise) under inflation and time value of money. Joint replenishment and simultaneous transfer of items from one warehouse to another is proposed using basic period (BP) policy. As some parameters are fuzzy in nature, objective (average profit) function as well as some constraints are imprecise in nature. Model is formulated as to optimize the possibility/necessity measure of the fuzzy goal of the objective function and constraints are satisfied with some pre-defined necessity. A genetic algorithm (GA) is developed with roulette wheel selection, binary crossover and mutation and is used to solve the model when the equivalent crisp form of the model is available. In other cases fuzzy simulation process is proposed to measure possibility/necessity of the fuzzy goal as well as to check the constraints of the problem and finally the model is solved using fuzzy simulation based genetic algorithm (FSGA). The models are illustrated with some numerical examples and some sensitivity analyses have been done.     

A probability maximization model based on rough approximation and its application to the inventory problem

In the present paper, we concentrate on dealing with a class of multi-objective programming problems with random coefficients and present its application to the multi-item inventory problem. The P-model is proposed to obtain the maximum probability of the objective functions and rough approximation is applied to deal with the feasible set with random parameters. The fuzzy programming technique and genetic algorithm are then applied to solve the crisp programming problem. Finally, the application to Auchan’s inventory system is given in order to show the efficiency of the proposed models and algorithms.     

Two-storage inventory model with lot-size dependent fuzzy lead-time under possibility constraints via genetic algorithm

Multi-item inventory models with stock dependent demand and two storage facilities are developed in a fuzzy environment where processing time of each unit is fuzzy and the processing time of a lot is correlated with its size. These are order-quantity reorder-point models with back-ordering if required. Here possibility and crisp constraints on investment and capacity of the small storehouse respectively are considered. The models are formulated as fuzzy chance constrained programming problem and is solved via generalized reduced gradient (GRG) technique when crisp equivalent of the constraints are available. A genetic algorithm (GA) is developed based on fuzzy simulation and entropy where region of search space gradually decreases to a small neighborhood of the optima and it is used to solve the models whenever the equivalent crisp form of the constraint is not available. The models are illustrated with some numerical examples and some sensitivity analyses have been done. For some particular cases results observed via GRG and GA are compared.     

A multi-objective chance-constrained network optimal model with random fuzzy coefficients and its application to logistics distribution center location problem

The problem of the distribution center is concerned with how to select distribution centers from a potential set in order to minimize the total relevant cost comprising of fixed costs of the distribution center and transport costs, and minimize the transportation time. In this paper, we propose a multi-objective network optimal model with random fuzzy coefficients for the logistics distribution center location problem. Furthermore, we convert the uncertain model into a deterministic one by the probability and possibility measure. Then the spanning tree-based genetic algorithm (st-GA) by the Prüfer number representation is introduced to solve the crisp multiobjective programming. At last, the proposed model and algorithm are applied to the Xinxi Dairy Holdings Limited Company to show the efficiency.     

A note on chance constrained programming with fuzzy coefficients

This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example.     

A hybrid intelligent algorithm for portfolio selection problem with fuzzy returns

Portfolio selection theory with fuzzy returns has been well developed and widely applied. Within the framework of credibility theory, several fuzzy portfolio selection models have been proposed such as mean–variance model, entropy optimization model, chance constrained programming model and so on. In order to solve these nonlinear optimization models, a hybrid intelligent algorithm is designed by integrating simulated annealing algorithm, neural network and fuzzy simulation techniques, where the neural network is used to approximate the expected value and variance for fuzzy returns and the fuzzy simulation is used to generate the training data for neural network. Since these models are used to be solved by genetic algorithm, some comparisons between the hybrid intelligent algorithm and genetic algorithm are given in terms of numerical examples, which imply that the hybrid intelligent algorithm is robust and more effective. In particular, it reduces the running time significantly for large size problems.     

Fuzzy minimum weight edge covering problem

Minimum weight edge covering problem, known as a classic problem in graph theory, is employed in many scientific and engineering applications. In the applications, the weight may denote cost, time, or opponent’s payoff, which can be vague in practice. This paper considers the edge covering problem under fuzzy environment, and formulates three models which are expected minimum weight edge cover model, α-minimum weight edge cover model, and the most minimum weight edge cover model. As an extension for the models, we respectively introduce the crisp equivalent of each model in the case that the weights are independent trapezoidal fuzzy variables. Due to the complexity of the problem, a hybrid intelligent algorithm is employed to solve the models, which can deal with the problem with any type of fuzzy weights. At last, some numerical experiments are given to show the application of the models and the robustness of the algorithm.     

Logistics network design for product recovery in fuzzy environment

The design of product recovery network is one of the important and challenging problems in the field of reverse logistics. Some models have been formatted by researchers under deterministic environment. However, uncertainty is inherent during the process of the practical product recovery. In order to deal with uncertainty, this paper employs a fuzzy programming tool to design the product recovery network. Based on different criteria, three types of optimization models are proposed and some properties of them are investigated. To solve the proposed models, we design a hybrid intelligent algorithm which integrates fuzzy simulation and genetic algorithm. Finally, several numerical examples are presented to illustrate the effectiveness of the proposed models and algorithm.     

Supply chain coordination for fuzzy random newsboy problem with imperfect quality

Facing to imperfect quality and fuzzy random market demand in the real-life inventory management, a two-echelon supply chain system with one retailer and one manufacturer for perishable products is considered. Two fuzzy random models for the newsboy problem with imperfect quality in the decentralized and centralized systems are presented. The expectation theory and signed distance are employed to transform the fuzzy random model into crisp model. The optimal policies in the two decision-making systems are derived and analyzed contrastively. The theoretical analysis shows that manufacturer’s repurchase strategy can achieve the increase in the whole supply chain profit. The influence of the fuzzy randomness of the demand and the defective rate on the optimal order quantity, the whole supply chain profit and the repurchasing price is analyzed via numerical examples.     

考虑随机模糊缺陷率且允许缺货的EOQ模型

针对实际库存管理中的产品缺陷问题,研究了含随机模糊缺陷率且允许缺货的经济订购批量(EOQ)模型,并运用随机模糊理论将其转化为确定模型,设计了随机模糊模拟仿真算法进而确定了其最优订购策略.数值算例分析了缺陷率对最优订货量和最优利润的影响.     

模糊批量生产计划问题的可信性规划模型与算法

描述模糊单位利润、模糊生产能力以及模糊需求下的批量生产计划,并应用可信性规划建立了模型.当模糊变量是梯形模糊数时,我们将模糊模型转化为确定意义下的模型.为了求解优化模型,我们设计了基于模糊模拟的遗传算法.最后,通过一个数值例子说明算法的有效性.     

A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones

A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem.     

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.     

Solving a full fuzzy linear programming using lexicography method and fuzzy approximate solution

This paper discusses full fuzzy linear programming (FFLP) problems of which all parameters and variable are triangular fuzzy numbers. We use the concept of the symmetric triangular fuzzy number and introduce an approach to defuzzify a general fuzzy quantity. For such a problem, first, the fuzzy triangular number is approximated to its nearest symmetric triangular number, with the assumption that all decision variables are symmetric triangular. An optimal solution to the above-mentioned problem is a symmetric fuzzy solution. Every FLP models turned into two crisp complex linear problems; first a problem is designed in which the center objective value will be calculated and since the center of a fuzzy number is preferred to (its) margin. With a special ranking on fuzzy numbers, the FFLP transform to multi objective linear programming (MOLP) where all variables and parameters are crisp.     

Modelling redundancy allocation for a fuzzy random parallel-series system

Due to subjective judgment, imprecise human knowledge and perception in capturing statistical data, the real data of lifetimes in many systems are both random and fuzzy in nature. Based on the fuzzy random variables that are used to characterize the lifetimes, this paper studies the redundancy allocation problems to a fuzzy random parallel-series system.Two fuzzy random redundancy allocation models (FR-RAM) are developed through reliability maximization and cost minimization, respectively. Some properties of the FR-RAM are obtained, in which an analytical formula of reliability with convex lifetimes is derived and the sensitivity of the reliability is discussed. To solve the FR-RAMs, we first address the computation of reliability. A random simulation method based on the derived analytical formula is proposed to compute the reliability with convex lifetimes. As for the reliability with nonconvex lifetimes, the technique of fuzzy random simulation together with the discretization method of fuzzy random variable is employed to compute the reliability, and a convergence theorem of the fuzzy random simulation is proved. Subsequently, we integrate the computation approaches of the reliability and genetic algorithm (GA) to search for the approximately optimal redundancy allocation of the models. Finally, some numerical examples are provided to illustrate the feasibility of the solution algorithm and quantify its effectiveness.     

基于遗传算法的随机模糊立体运输问题

随机模糊立体运输问题的研究是为了解决现实生活中双因素不确定性问题,在遗传算法的基础上,运用可信性理论建立随机模糊运输问题的机会约束规划模型.通过算例进行VC++编程模拟计算,验证了此模型的可行性,最终提出了基于遗传算法解决随机模糊立体运输问题的模型.