基于粗糙集电梯群控系统调度算法研究  

Study on Scheduling Algorithm of Elevator Group Control System Based on Rough Sets

作　　者：何选 

机构地区：[1]南京长江都市建筑设计股份有限公司,南京市210000

出　　处：《建筑电气》2015年第4期68-72,共5页Building Electricity

基　　金：江苏省建筑业科研项目;项目名称:建筑企业集团技术中心评估研究;项目编号:JGJH2009-05

摘　　要：要解决电梯群控系统调度优化问题,首先应分析当前电梯群控调度算法存在的问题。以粗糙集理论为依据,提出以分辩关系强度进行群控电梯调度算法,算法将各种外部状态作为条件属性集、调度策略作为决策属性集形成信息决策表。对该表预先进行属性值约简后提得规则集,控制机将当前实际状态与规则集比较得到电梯群控指令。该算法突破了当前以经验知识推理、模糊逻辑、概率分析、仿生算法等调度算法的局限性,从外部状态和调度时机、调度目标给出该状态的控制规则,充分利用现有信息达到优化调度的目的,理论和实例相结合,证明了粗糙集理论解决电梯调度的合理性和有效性。For optimizing the scheduling of elevator group control system, the existing problems of the scheduling algorithm of current elevator group control shall be analyzed first. Based on rough sets theory, a scheduling algorithm analyzing relationship strength is proposed for group control elevators, which forms an information table by taking the external state in a state attribute set and the scheduling policies in a decision attributes set. The table reduces the attribute values and obtains a rule set. The control machine compares the current virtual state with the rule set and obtains a control instruction for the elevator group. This algorithm breaks the limitation of experience inference, fuzzy logic, probability analysis,bionic algorithm and other scheduling algorithms;provides control rule based on external state, scheduling time and scheduling target; optimizes scheduling by taking full advantage of existing information; combines theory with living example and proves the rationality and validity of rough sets theory in solving elevator scheduling

关 键 词：电梯群控 粗糙集 不可分辩关系 决策表 电梯调度策略 轿厢状态集 楼层申请状态集 控制机 

分 类 号：TU857[建筑科学]