The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies

In the Home Care Crew Scheduling Problem a staff of home carers has to be assigned a number of visits to patients’ homes, such that the overall service level is maximised. The problem is a generalisation of the vehicle routing problem with time windows. Required travel time between visits and time windows of the visits must be respected. The challenge when assigning visits to home carers lies in the existence of soft preference constraints and in temporal dependencies between the start times of visits.     

Some equivalent problems in set optimization

Given a set-valued optimization problem (P), there is more than one way of defining the solutions associated with it. Depending on the decision maker’s preference, we consider the vector criterion or the set criterion. Both criteria of solution are considered together to solve problem (P) by reducing the feasible set.     

Characterization of set‐valued conditional expectation

For an essentially bounded closed‐convex‐nonempty set‐valued random variable, it is shown that the conditional expectation is characterized by its integrals over the sets of the associated σ ‐field. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

基于区间数度量的区间值模糊集合的归一化距离、相似度、模糊度和包含度的关系研究

区间值模糊集合的距离、相似度、模糊度和包含度及其关系研究是区间值模糊集合的一个研究热点.考虑到区间值模糊集合所表示信息的丰富性,本文使用区间数而非实数来刻画区间值模糊集合的距离,首先给出基于区间数度量的区间值模糊集合的归一化距离的公理化定义,然后通过五个定理详细研究了基于公理化定义的区间值模糊集合的归一化距离、相似度、模糊度和包含度之间的相互转换关系,最后,给出了若干公式来计算基于区间数度量的区间值模糊集合的相似度、模糊度和包含度.这些结论,一方面丰富了区间值模糊集合的信息测度(距离、相似度、模糊度和包含度)的内容,另一方面也为区间值模糊集合的近似推理、决策分析、模式识别等领域的应用提供了新方法和新理论.     

覆盖粗糙集模型增值算子及其性质

为了给不断发生变化的数据库的知识发现提供新的数学工具,本文引进覆盖粗糙集模型的确定增值算子ZX(Y)和不确定增值算子ZX(Y),并讨论了它们的有关性质,即通过研究两个新集合hX(x)、lX(x)的性质(定理2.1和定理2.2),给出并证明了两个增值算子的性质(定理2.3和定理2.4)。     

几类广义模糊集的关系

经过近五十年的发展,模糊集在理论与应用两个领域的研究都已经取得长足的进展,特别地,在模糊决策等应用领域,涌现了几类重要的广义模糊集,包括区间值模糊集,直觉模糊集,区间值直觉模糊集,II型模糊集,Vague集,灰集等。本文简要介绍关于这些广义模糊集之间关系的研究成果,以及国外关于直觉模糊集术语问题的争议。     

直觉I-Fuzzy拓扑空间的杨忠道定理

以L~*-格值上Lukasiewicz蕴含算子为工具引入了直觉I-Fuzzy拓扑空间中导集概念,接着给出它的一些性质,最后证明了直觉I-Fuzzy拓扑空间中导集的杨忠道定理.     

Universal conditions for algebraic travelling salesman problems to be efficiently solvable

We consider Travelling Salesman Problems (TSPs) where the cost of a tour is an algebraic composition of the cost coefficients that are elements of a totally ordered, commutative semigroup. Conditions for the cost matrix are stated which allow to solve these problems in polynomial time. In particular, we investigate conditions which guarantee that an optimal tour is pyramidal and can therefore be determined in O(n ²) time. Furthermore, we discuss TSP_s with Brownian as well as those with left-upper-triangular cost matrices.     

命题逻辑系统L*的有效集

针对命题逻辑系统L*,以及增加一元联结词△后的系统L*△,研究了该逻辑系统有效集的特征,进而以有效集为工具得到公式集F(S)的一类分划,即可将L*与L*△中的公式集F(S)分别分为16和20个等价类;最后给出了L*中对M P规则封闭的有效集的特征。     

D.C.隶属函数模糊集及其应用(Ⅱ)--D.C.隶属函数模糊集的万能逼近性

本文是D．C．隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D．C．隶属函数模糊集，建立了D．C．隶属函数模糊集对模糊集的万有逼近性。探讨了D．C．隶属函数模糊集与模糊数之间的关系，给出了用D．C．隶属函数模糊集逼近模糊数的e-Cellina逼近形式，得到模糊数与D．C．函数之间的一个对应算子，指出了用模糊数表示D．C．函数的问题。