软计算求解分布式多工厂多顾客的供应链准时化生产计划问题

描述了分布式多工厂、多顾客的供应链准时化生产计划问题,以实现最小化提前／拖期惩罚费用、生产成本、产品运输费用之和为目标建立了数学模型,将遗传算法与模糊逻辑相结合,设计了软计算方法求解模型,采用基于规则方法的模糊规则量化方法求解模糊决策,并将模糊决策嵌入遗传算法,使得算法具有比分枝定界法更快的寻优能力和更广的适应范围。实例计算结果表明了该模型和算法的有效性和应用潜力。     

软计算求解分布式多工厂单件制造业的提前/拖期生产计划问题

描述了分布式多工厂单件制造企业准时化生产计划问题, 以实现最小化提前/拖期惩罚费用、生产成本、产品运输费用之和为目标建立了0-1规划数学模型; 设计了基于模糊规则量化的方法求解模糊决策, 并将模糊决策嵌入到遗传算法中的软计算方法求解模型, 使得算法具有比分枝定界法更快速的寻找优解的能力以及更广泛的适应范围. 结果表明了该模型和算法的有效性和应用潜力.     

Partner selection model and soft computing approach for dynamic alliance of enterprises

Partner selection is an active research topic in agile manufacturing and supply chain management. In this paper, the problem is described by a 0-1 integer programming with non-analytical objective function. Then, the solution space is reduced by defining the inefficient candidate. By using the fuzzy rule quantification method, a fuzzy logic based decision making approach for the project scheduling is proposed. We then develop a fuzzy decision embedded genetic algorithm. We compare the algorithm with tranditional methods. The results show that the suggested approach can quickly achieve optimal solution for large size problems with high probability. The approach was applied to the partner selection problem of a coal fire power station construction project. The satisfactory results have been achieved.     

An α-Fuzzy Goal Approximate Algorithm for Solving Fuzzy Multiple Objective Linear Programming Problems

Multiple conflicting objectives in many decision making problems can be well described by multiple objective linear programming (MOLP) models. This paper deals with the vague and imprecise information in a multiple objective problem by fuzzy numbers to represent parameters of an MOLP model. This so-called fuzzy MOLP (or FMOLP) model will reflect some uncertainty in the problem solution process since most decision makers often have imprecise goals for their decision objectives. This study proposes an approximate algorithm based on a fuzzy goal optimization under the satisfactory degree α to handle both fuzzy and imprecise issues. The concept of a general fuzzy number is used in the proposed algorithm for an FMOLP problem with fuzzy parameters. As a result, this algorithm will allow decision makers to provide fuzzy goals in any form of membership functions.     

Machining process sequencing with fuzzy expert system and genetic algorithms

Traditional process planning systems are usually established in a deterministic framework that can only deal with precise information. However, in a practical manufacturing environment, decision making frequently involves uncertain and imprecise information. This paper describes a fuzzy approach for solving the process selection and sequencing problem under uncertainty. The proposed approach comprises a two-stage process for machining process selection and sequencing. The two stages are called intra-feature planning and inter-feature planning, respectively. According to the feature precedence relationship of a machined part, the intra-feature planning module generates a local optimal operation sequence for each feature element. This is based on a fuzzy expert system incorporated with genetic algorithms for machining cost optimization according to the cost-tolerance relationship. Manufacturing resources such as machines, tools, and fixtures are allocated to each selected operation to form an Operation-Machine-Tool (OMT) unit in the manufacturing resources allocation module. Finally, inter-feature planning generates a global OMT sequence. A genetic algorithm with fuzzy numbers and fuzzy arithmetic is developed to solve this global sequencing problem.     

A multi-objective decision-making model with fuzzy rough coefficients and its application to the inventory problem

In this paper, we concentrate on developing a fuzzy rough multi-objective decision-making model according to uncertainty theory. We present some equivalent models and a traditional algorithm based on an interactive fuzzy satisfying method, which is similar to the interactive fuzzy rough satisfying method, in order to obtain a satisfying solution for the decision maker. In addition, the technique of fuzzy rough simulation is applied to deal with general fuzzy rough objective functions and fuzzy rough constraints which are usually difficult to convert into their equivalents. Furthermore, combined with the techniques of fuzzy rough simulation, a genetic algorithm using the compromise approach is designed for solving a fuzzy rough multi-objective programming problem. Finally, a model is applied to an inventory problem to illustrate the usefulness of the proposed model and algorithm, and then a sensitivity analysis is made.     

考虑投资者心理特征的模糊投资组合优化模型

投资者在实际金融市场中的决策行为往往会受到主观心理认知的影响.考虑参照依赖、敏感性递减和损失厌恶等影响投资决策的心理特征,研究模糊环境下的投资组合选择问题.首先,假设资产的收益为梯形模糊数,依据前景理论中的价值函数,将组合收益转化为体现投资者心理特征的感知价值;然后,以感知价值的可能性均值最大化和可能性下半方差最小化为目标,建立考虑心理特征的模糊投资组合优化模型;接着,为了有效地求解模型,设计一个多种群遗传算法;最后,通过实例分析表明模型和算法的有效性.结果表明,与传统的遗传算法相比,所设计的多种群遗传算法可更有效地求解模型,考虑心理特征的模糊投资组合优化模型能够提升投资者的满意程度,可为实际的投资活动提供决策支持.     

Evolutionary Fuzzy Rule Induction Process for Subgroup Discovery: A Case Study in Marketing

This paper presents a genetic fuzzy system for the data mining task of subgroup discovery, the subgroup discovery iterative genetic algorithm (SDIGA), which obtains fuzzy rules for subgroup discovery in disjunctive normal form. This kind of fuzzy rule allows us to represent knowledge about patterns of interest in an explanatory and understandable form that can be used by the expert. Experimental evaluation of the algorithm and a comparison with other subgroup discovery algorithms show the validity of the proposal. SDIGA is applied to a market problem studied in the University of Mondragon, Spain, in which it is necessary to extract automatically relevant and interesting information that helps to improve fair planning policies. The application of SDIGA to this problem allows us to obtain novel and valuable knowledge for experts.     

Multi-objective aggregate production planning with fuzzy parameters

In this paper, a direct solution method that is based on ranking methods of fuzzy numbers and tabu search is proposed to solve fuzzy multi-objective aggregate production planning problem. The parameters of the problem are defined as triangular fuzzy numbers. During problem solution four different fuzzy ranking methods are employed/tested. One of the primary objectives of this study is to show that how a multi-objective aggregate production planning problem which is stated as a fuzzy mathematical programming model can also be solved directly (without needing a transformation process) by employing fuzzy ranking methods and a metaheuristic algorithm. The results show that this can be easily achieved.     

An interactive fuzzy satisficing method for multiobjectivenonconvex programming problems with fuzzy numbers through coevolutionarygenetic algorithms

In this paper, by considering the experts' fuzzy understanding of the nature of the parameters in the problem-formulation process, multiobjective nonconvex nonlinear programming problems with fuzzy numbers are formulated and an interactive fuzzy satisficing method through coevolutionary genetic algorithms is presented. Using the alpha-level sets of fuzzy numbers, the corresponding nonfuzzy alpha-programming problem is introduced. After determining the fuzzy goals of the decision maker, if the decision maker specifies the degree alpha and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the augmented minimax problems for which the coevolutionary genetic algorithm, called GENOCOP III, is applicable. In order to overcome the drawbacks of GENOCOP III, the revised GENOCOP III is proposed by introducing a method for generating an initial feasible point and a bisection method for generating a new feasible point efficiently. Then an interactive fuzzy satisficing method for deriving a satisficing solution for the decision maker efficiently from an extended Pareto optimal solution set is presented together with an illustrative numerical example.     

A genetic algorithm approach to multiobjective land use planning

This paper describes a class of spatial planning problems in which different land uses have to be allocated across a geographical region, subject to a variety of constraints and conflicting management objectives. A goal programming/reference point approach to the problem is formulated, which leads however to a difficult nonlinear combinatorial optimization problem. A special purpose genetic algorithm is developed for the solution of this problem, and is extensively tested numerically. The model and algorithm is then applied to a specific land use planning problem in The Netherlands. The ultimate goal is to integrate the algorithm into a complete land use planning decision support system.     

钢铁企业合同计划与余材匹配的集成优化方法

钢铁企业的合同计划和余材匹配的集成优化是解决钢铁企业面向订单生产的关键技术.由于该问题复杂,涉及因素多,求解难度大,对此提出一个带有提前拖期惩罚的联合计划优化的数学模型,并提出一种嵌有"优先适合启发式"的遗传算法.该方法利用背包问题的求解思路改进了染色体的性能,从而加快了遗传算法的求解速度.将该模型及算法应用于实际钢铁企业的计划编排中,取得了满意的效果.     

Elite artificial bees' colony algorithm to solve robot's fuzzy constrained routing problem

One of the fundamental challenges of the robotics field is robot's movement. That is, why route planning is an eminent issue of robotics research and it is used to enhance autonomy of moving robots in complex environments. The objective of route planning problem is to find the shortest route without collide from initiation point to destination point so that the amount of energy consumption by robot would not exceed a predefined amount. Because neither the amount of energy consumption nor the robot's passed distance index cannot be measured precisely due to environmental conditions, and fuzzy data is used for modeling the problem and the problem would be called “Robot Fuzzy Constrained shortest Route” problem. The main contributions of this study are fivefold: (i) The mathematical model of fuzzy constrained shortest route problem (FCSRP) is formulated; (ii) An elite artificial bees' colony (EABC) algorithm is used to solve the robot's FSCRP; (iii) The proposed EABC algorithm is simulated with two fuzzy networks; (iv) The performance of the proposed approach is compared with the performance of genetic algorithm and particle swarm optimization algorithm; and (v) The results show the convergence speed of the EABC algorithm is higher than the existing algorithms.     

基于离散灰狼算法的喷涂机器人路径规划方法

针对目前用于复杂结构实体喷涂的机器人路径规划方法存在的效率低、未考虑碰撞以及适用性差等问题,提出一种用于求解多层决策问题的离散灰狼算法,并把该算法用于该路径规划问题的求解。为了将连续域灰狼算法改为用于求解多层决策问题的离散灰狼算法,采用矩阵编码方法解决多层决策问题的编码问题,提出基于先验知识与随机选择的混合初始化方法提高算法求解效率和精度,运用交叉算子与两级变异算子定义离散域灰狼算法的种群更新策略。另外,运用图论将喷涂机器人路径规划问题简化为广义旅行商问题,并建立了该问题的最短路径模型和路径碰撞模型。在路径规划实验中,相较于粒子群算法、遗传算法和蚁群算法,提出的算法规划的平均路径长度分别减小了5.0%、5.5%和6.6%,碰撞次数降低为0,且路径更平滑。实验结果表明,提出的算法能够有效提高喷涂机器人的喷涂效率,以及喷涂路径的安全性和适用性。     

模糊环境下的最小权顶点覆盖问题*

最小权顶点覆盖问题在实际决策中应用广泛,但顶点上的权值在实际应用中通常代表费用、成本等,在很多情况下是不确定的。关注了最小权顶点覆盖问题中的模糊不确定性,对模糊环境下的最小权顶点覆盖问题进行了研究。引入了可信性理论以描述模糊不确定性,并根据不同的决策准则建立了求解模糊环境下最小权顶点覆盖问题的三个决策模型,结合模糊模拟和遗传算法设计了一种求解所建立模型的混合智能算法,并给出了数值实验。数值实验的结果验证了所提出的决策模型与算法的有效性。     

基于离散灰狼算法的喷涂机器人路径规划方法

针对目前用于复杂结构实体喷涂的机器人路径规划方法存在的效率低、未考虑碰撞以及适用性差等问题，提出一种用于求解多层决策问题的离散灰狼算法，并把该算法用于该路径规划问题的求解。为了将连续域灰狼算法改为用于求解多层决策问题的离散灰狼算法，采用矩阵编码方法解决多层决策问题的编码问题，提出基于先验知识与随机选择的混合初始化方法提高算法求解效率和精度，运用交叉算子与两级变异算子定义离散域灰狼算法的种群更新策略。另外，运用图论将喷涂机器人路径规划问题简化为广义旅行商问题，并建立了该问题的最短路径模型和路径碰撞模型。在路径规划实验中，相较于粒子群算法、遗传算法和蚁群算法，提出的算法规划的平均路径长度分别减小了5.0%、5.5%和6.6%，碰撞次数降低为0，且路径更平滑。实验结果表明，提出的算法能够有效提高喷涂机器人的喷涂效率，以及喷涂路径的安全性和适用性。     

基于三维环境模型的启发式路径规划算法

针对多自由度机器人手臂在未知环境中实时避障的问题,提出了一种基于环境信息的连杆机器人实时路径规划方法。采用笛卡尔空间内的障碍物检测信息建立了障碍物的空间模型,并依据该模型设计一种基于启发式规则的机器人路径规划算法。该算法不断猜测和修正路径,通过模糊推理得到下一位姿点,通过曲线拟合得到到达该位姿点的路径。在Matlab下利用机器人工具箱建立了PUMA560型机器人的运动学模型,并在运动空间设置障碍物,对该算法进行仿真分析,分析结果说明所提出的路径规划算法可以在较短时间内完成避障运动,具有较好的实时性,同时运动关节的角度变化曲线比较平滑,运动中冲击力较小,这些特点使其便于在实际工程中使用。     

模糊聚类遗传算法在军事装备物流中心选址中的应用

在分析军事装备物流中心选址问题基础上,构建了模糊聚类和遗传算法的混合算法模型,核心技术是把模糊聚类网络模型融合到遗传算法种群构建中,可以有效地避免遗传算法易出现早熟的现象,验证了算法具有很好的鲁棒性和可信度,仿真结果能够为决策者科学正确的选址提供一定的参考.     

城市应急物流设施选址的多目标规划模型

通过分析城市应急物流设施选址的基本特征,提出利用模糊折中型多属性决策方法进行应急物流设施选址备选方案的决策偏好生成。在此基础上,建立综合考虑满意度和建设成本的多目标选址规划模型,在给出满意度函数的确定方法后,提出利用模拟退火算法进行模型的求解,并利用实例验证了算法的有效性,能够供决策者选择合适的物流选址方案提供理论支撑。     

Fuzzy R&D portfolio selection of interdependent projects

Global competition of markets has forced firms to invest in targeted R&D projects so that resources can be focused on successful outcomes. A number of options are encountered to select the most appropriate projects in an R&D project portfolio selection problem. The selection is complicated by many factors, such as uncertainty, interdependences between projects, risk and long lead time, that are difficult to measure. Our main concern is how to deal with the uncertainty and interdependences in project portfolio selection when evaluating or estimating future cash flows. This paper presents a fuzzy multi-objective programming approach to facilitate decision making in the selection of R&D projects. Here, we present a fuzzy tri-objective R&D portfolio selection problem which maximizes the outcome and minimizes the cost and risk involved in the problem under the constraints on resources, budget, interdependences, outcome, projects occurring only once, and discuss how our methodology can be used to make decision support tools for optimal R&D project selection in a corporate environment. A case study is provided to illustrate the proposed method where the solution is done by genetic algorithm (GA) as well as by multiple objective genetic algorithm (MOGA).