模糊环境下批量制造业提前/拖期交货的生产计划

描述了基于客户需求为模糊量的批量生产提前/拖期交货的生产计划,并建立了模糊环境下的三个模型.为了有效求解优化模型,我们将模糊模拟和遗传算法相结合给出了混合智能算法.最后通过数值例子说明算法的有效性.     

具有非对称模糊加工时间工期指派调度优化问题的一类加权模型及其求解算法

根据模糊变量截集所表达的信息的重要程度,建立了模糊环境下工期指派调度优化问题的一类加权模型,该模型中工件加工时间为非对称三角模糊数,目标函数为极小化提前完工惩罚和拖期完工惩罚和的加权可能性均值.证明了当工件加工时间具有相同宽度比时,模型是多项式可解的,并给出了求解的多项式算法.数值实验表明加权模型与现有的非加权模型相比能有效的降低总费用.     

模糊环境下可控提前期供应链库存优化的Stackelberg模型研究

为了有效地缩短提前期与降低库存成本,研究了模糊环境下可控提前期的供应链库存优化问题.利用三角形模糊数描述需求的不确定性,建立了一类模糊需求条件下可控提前期供应链库存优化的Stackelberg模型.利用三角形模糊数描述成本系数的不确定性,建立了模糊成本系数条件下可控提前期供应链库存优化的Stackelberg模型,并提出利用均值面积度量法来解模糊化.通过数值分析来验证两类模型的优化效果.     

基于模糊遗传算法的自融资有效投资组合研究

在马克维茨投资组合的均值一方差模型框架下,给出限制投资数量的自融资投资组合优化模型.把预期收益率不等式约束转化为模糊约束,采用一种通过惩罚因子,对适应度函数进行修正的模糊遗传算法来求解模型.在理论上,这种算法能够将最优基因较完整地遗传到下一代,有效地避免了早熟现象,可以得到更好的适应度函数值.在实际应用中,对一具体自融资有效投资组合实例进行计算,结果表明:本文所提出的模糊遗传算法是可行的、有效的,具有更好的优化结果.     

模糊投资组合选择问题的改进帝企鹅优化算法

模糊投资组合选择问题是在基本投资组合模型中引入模糊集理论,使所建立的模型与实际市场更加吻合,但同时也增加了模型求解难度.因此,本文针对两种不同的模糊投资组合模型,提出一种改进帝企鹅优化算法.算法首先引入可行性准则,处理模糊投资组合模型中的约束.其次,算法中加入变异机制,平衡算法的开发和探索能力,引导种群向最优个体收敛.通过对CEC 2006中的13个标准测试问题及两个模糊投资组合问题实例进行数值实验,并与其他群智能优化算法进行结果比较,发现本文所提出的算法具有较好的优化性能,并且对于求解模糊投资组合选择问题是有效的.     

2-型模糊环境下的能源系统优化

基于模糊可能性理论,建立2-型模糊环境下的能源分配优化模型,其中各种类型能源的成本用2-型模糊变量刻画.用均值简约方法简约2-型模糊成本,建立广义期望值意义下的模糊能源分配优化模型.当成本用相互独立的三角2-型模糊变量刻画时,所建立的模糊能源分配优化模型可以转化为等价的参数线性规划.最后提供一个数值例子表明建模思想.     

具有投资限制的风险资产模糊随机投资组合模型

研究了模糊随机环境下风险资产投资组合选择问题.利用模糊随机变量刻画风险资产的收益率,建立了具有投资限制的风险资产投资组合选择的一般模糊随机均值-方差模型,该模型包括了是否允许卖空及具有投资比例下界约束的情况.在此基础上,提出了具有梯形模糊随机收益率的具体投资组合优化模型,这些模型能够转化为二次规划问题求解.最后,利用上证50指数中的9种股票对模型进行了实证分析,结果表明模型能够有效分散非系统性风险.     

模糊数在投资组合优化中的应用研究及实证分析

采用模糊数处理不确定性信息.以模糊期望收益率最大为目标函数,使总的风险不高于给定的模糊数,建立了一种新的模型.在给定的截集下,期望收益率转化为区间数,目标函数转化为对该区间数的下限求最大值.基于模糊数大小的概率比较,从而将模糊优化模型转化为不等式约束下的线性规划模型.利用Matlab编程可解得其最优解.最后通过实例分析,验证该模型的可行性.     

模糊批量生产计划问题的机会约束规划

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

具有惩罚因子的模糊集约生产计划

研究基于模糊环境下的集约生产计划问题,并设计了带有惩罚因子的模糊优化模型,以实现生产费用和惩罚费用之和最小.通过模糊变量和模糊等式定义的描述,简化了模型,并给出机会约束规划方法进行模型求解的整体步骤.通过仿真结果和灵敏度分析,表明模型和方法的有效性,并为决策者在模糊环境下的决策提供支持.     

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.     

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.     

Mean-variance-skewness model for portfolio selection with fuzzy returns

Numerous empirical studies show that portfolio returns are generally asymmetric, and investors would prefer a portfolio return with larger degree of asymmetry when the mean value and variance are same. In order to measure the asymmetry of fuzzy portfolio return, a concept of skewness is defined as the third central moment in this paper, and its mathematical properties are studied. As an extension of the fuzzy mean-variance model, a mean-variance-skewness model is presented and the corresponding variations are also considered. In order to solve the proposed models, a genetic algorithm integrating fuzzy simulation is designed. Finally, several numerical examples are given to illustrate the modelling idea and the effectiveness of the proposed algorithm.     

Fuzzy facility location-allocation problem under the Hurwicz criterion

Facility location-allocation (FLA) problem has been widely studied by operational researchers due to its many practical applications. Many researchers have studied the FLA problem in a deterministic environment. However, the models they proposed cannot accommodate satisfactorily various customer demands in the real world. Thus, we consider the FLA problem with uncertainties. In this paper, a new model named α-cost model under the Hurwicz criterion is presented with fuzzy demands. In order to solve this model, the simplex algorithm, fuzzy simulations and a genetic algorithm are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm.     

Fuzzy project scheduling problem and its hybrid intelligent algorithm

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 a type of project scheduling problem with fuzzy activity duration times. According to some management goals, three types of fuzzy models are built to solve the project scheduling problem. Moreover, the technique of fuzzy simulation and genetic algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy models. Finally, some numerical examples are given to illustrate the effectiveness of the algorithm.     

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.     

Portfolio selection based on fuzzy cross-entropy

In this paper, the Kapur cross-entropy minimization model for portfolio selection problem is discussed under fuzzy environment, which minimizes the divergence of the fuzzy investment return from a priori one. First, three mathematical models are proposed by defining divergence as cross-entropy, average return as expected value and risk as variance, semivariance and chance of bad outcome, respectively. In order to solve these models under fuzzy environment, a hybrid intelligent algorithm is designed by integrating numerical integration, fuzzy simulation and genetic algorithm. Finally, several numerical examples are given to illustrate the modeling idea and the effectiveness of the proposed algorithm.     

Mean-semivariance models for fuzzy portfolio selection

This paper discusses portfolio selection problem in fuzzy environment. In the paper, semivariance is originally presented for fuzzy variable, and three properties of the semivariance are proven. Based on the concept of semivariance of fuzzy variable, two fuzzy mean-semivariance models are proposed. To solve the new models in general cases, a fuzzy simulation based genetic algorithm is presented in the paper. In addition, two numerical examples are also presented to illustrate the modelling idea and the effectiveness of the designed algorithm.     

New models for shortest path problem with fuzzy arc lengths

This paper considers the shortest path problem with fuzzy arc lengths. According to different decision criteria, the concepts of expected shortest path, α-shortest path and the most shortest path in fuzzy environment are originally proposed, and three types of models are formulated. In order to solve these models, a hybrid intelligent algorithm integrating simulation and genetic algorithm is provided and some numerous examples are given to illustrate its effectiveness.     

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.