双向S-变精度优粗集模型及其应用

针对S-粗集模型及其现有扩展模型不能有效处理具有动态特性的偏好信息系统这一缺陷,本文提出了一种双向S-变精度优粗集模型,并给出了该模型的一些性质。新模型具有一定的抗数据干扰能力,从而可在动态偏好信息决策系统中获得更加合理的分类;最后给出一个应用实例,验证了新模型的有效性。     

直觉(λ,η)-函数粗集

利用函数S-粗集,提出直觉(λ,η)-函数粗集,给出它的数学结构和特性,又探讨直觉(λ,η)-函数粗集与函数S-粗集的关系。从解决实际问题的角度来说,直觉(λ,η)-函数粗集是函数粗集的一般形式,函数S-粗集是直觉(λ,η)-函数粗集的特例。直觉(λ,η)-函数粗集是粗集研究的一个新方向。     

双向S-粗模糊集及其性质

讨论模糊集与双向S-粗集的联系。首先给出双向S-粗模糊集的概念,接着讨论它们的并、交、补运算及其性质;特别地,证明双向S-粗模糊集对并、交、补运算构成完全可无限分配的软代数。     

直觉模糊S-粗集的一般结构及性质

在一般等价关系下,给出单向直觉模糊S-集合、双向直觉模糊S-集合的概念,利用这些概念,提出直觉模糊S-粗集,给出直觉模糊S-粗集的数学结构和有关结论,对有关性质进行了讨论。直觉模糊S-粗集为研究动态信息系统中大量的不确定性问题提供了新的途径和方法。     

函数S-粗集与规律双向分离

函数S-粗集(function singular rough sets)是用R-函数等价类定义的,函数是一个规律,函数S-粗集具有规律特征.函数S-粗集推广了Z.Pawlak粗集.利用函数S-粗集,给出规律生成,规律分离的讨论,提出规律分离定理.给出的结果在投资分险规律估计中得到了应用.     

单向S-粗集粗糙性的度量方法

根据单向S-粗集内(外)边界的定义,引入了外边界熵的概念,将外边界熵与知识粒度结合进来,提出了一种新的单向S-粗集粗糙性的度量方法,讨论了这一度量的特性。通过分析和实例可以看出,这一新的度量方法可以用来更合理、更精确地度量单向S-粗集的不确定性。     

一元F-粗积分的概率估计

在函数单向S-粗集生成的一元F-粗积分的基础上,结合元素迁移的概率特征,提出了依概率p-粗积分的概念,给出了依概率p-粗积分上下关系链定理和依概率p-粗积分关系链定理,讨论了依概率p-粗积分和F-粗积分及牛顿积分间的关系.     

变异函数S-粗集的随机特性

利用函数S-粗集理论和属性函数迁移的随机性,提出属性函数迁移的信度及信度函数的概念;给出变异函数Sp-粗集与变异函数S(p,p')-粗集的随机生成,讨论了变异函数Sp-粗集与变异函数S(p,p')-粗集的结构及特性.     

函数S-粗集对偶与F-粗边际规律

函数单向S粗集对偶(dual offunction one direction singular rough sets)是函数S粗集的基本形式之一,函数单向S-粗集对偶具有动态特性与规律(函数)特性.函数S粗集(function singular rough sets)是把函数概念引入到S粗集内(singular rough sets)改进S粗集得到的把导数概念与函数单向S粗集对偶交叉、渗透给出粗边际规律F-粗边际规律概念;给出粗边际规律F-粗边际规律特征;给出F-粗边际规律与粗边际规律的关系;给出F-粗边际规律在经济信息系统中的应用     

动态粗集的一种新结构

Z.Pawlak粗集理论是一种研究和处理静态知识的静态粗集理论.提出研究和处理动态知识的动态粗集理论,给出动态粗集的数学表示,定义知识库上的元素迁移系数、D-粗集、D-近似集等概念,研究D-粗集的迁移特性,给出D-粗集退化定理、D-粗集转化定理、迁移平衡定理等,并进行实例分析和意义解析.D-粗集是Pawlak粗集的一般形式,而Pawlak粗集可以看作D-粗集的一种特例.     

Function S-rough Sets and Their Law Characteristic

Function S-rough sets(Function Singular rough sets) are defined by R-function equivalence class which has dynamic characteristic, and a function is s law, function S-rough sets have law characteristic. Function S-rough sets has these forms: function one direction S-rough sets, function two direction S-rough sets and dual of function one direction S-rough sets. This paper presents the law characteristic of function one direction S-rough sets and puts forward the theorems of law-chain-attribute and law-belt. Function S-rough sets is s new research direction of the rough sets theory.     

覆盖广义粗糙集的模糊性

在研究覆盖广义粗糙集的基础上,利用两个距离函数Hamming和Euclidean距离函数,结合模糊集的最近寻常集,引入了覆盖广义粗糙集模糊度的概念,给出了一种模糊度计算方法,并证明了该模糊度的一些重要性质。这些结果在覆盖广义粗糙集的理论研究和应用都发挥着一定作用。     

基于覆盖的模糊粗糙集模型

讨论基于覆盖理论的模糊粗糙集模型。给出了模糊集的粗糙上、下近似算子,讨论了算子的基本性质,证明了覆盖粗糙集模型下所有模糊集的下近似构成一个模糊拓扑,并得到了覆盖模糊粗糙集模型的公理化描述。     

基于覆盖粗糙集理论中的约简与求核

提出基于分辨矩阵的求覆盖粗糙集约简与核的方法,在Zakowski提出的覆盖粗糙集模型的基础上,利用分辨矩阵的一些性质,把文献[10]中的粗糙集理论中的约简与求核方法应用到基于覆盖的粗糙集理论中,既简化了覆盖粗糙集理论中的约简与求核过程,又推广了文献[10]的方法,最后举例说明此方法的有效性。     

An adaptation of SH heuristic to the location set covering problem

In a recent paper, a new surrogate heuristic (SH) has been proposed for the set covering problem. Here we present an adaptation of it in order to solve more efficiently the location set covering problem. We will show that our new version not only outperforms algorithm SH but that it is more accurate than the pair CMA/FMC. Its power is experimentally tested over a set of 65 randomly generated problems.     

Effective search space control for large and/or complex driver scheduling problems

For real life bus and train driver scheduling instances, the number of columns in terms of the set covering/partitioning ILP model could run into billions making the problem very difficult. Column generation approaches have the drawback that the sub-problems for generating the columns would be computationally expensive in such situations. This paper proposes a hybrid solution method, called PowerSolver, of using an iterative heuristic to derive a series of small refined sub-problem instances fed into an existing efficient set covering ILP based solver. In each iteration, the minimum set of relief opportunities that guarantees a solution no worse than the current best is retained. Controlled by a user-defined strategy, a small number of the banned relief opportunities would be reactivated and some soft constraints may be relaxed before the new sub-problem instance is solved. PowerSolver is proving successful by many transport operators who are now routinely using it. Test results from some large scale real-life exercises will be reported.     

On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}

While the set packing polytope, through its connection with vertex packing, has lent itself to fruitful investigations, little is known about the set covering polytope. We characterize the class of valid inequalities for the set covering polytope with coefficients equal to 0, 1 or 2, and give necessary and sufficient conditions for such an inequality to be minimal and to be facet defining. We show that all inequalities in the above class are contained in the elementary closure of the constraint set, and that 2 is the largest value ofk such that all valid inequalities for the set covering polytope with integer coefficients no greater thank are contained in the elementary closure. We point out a connection between minimal inequalities in the class investigated and certain circulant submatrices of the coefficient matrix. Finally, we discuss conditions for an inequality to cut off a fractional solution to the linear programming relaxation of the set covering problem and to improve the lower bound given by a feasible solution to the dual of the linear programming relaxation.Research supported by the National Science Foundation through grant ECS-8503198 and the Office of Naval Research through contract N0001485-K-0198.     

基于泛系粗糙集等价算子上的粒计算模型

标准粗糙集使用等价类作为粒来描述概念.本文弱化对等价关系的要求, 将更广泛的粒计算模型建立到泛系粗糙集上去.本文通过对全域的分割和覆盖来诱导出泛系粗糙集上的粒计算模型.     

Worst case analysis of a class of set covering heuristics

In [2], Chvatal provided the tight worst case bound of the set covering greedy heuristic. We considered a general class of greedy type set covering heuristics. Their worst case bounds are dominated by that of the greedy heuristic.