基于匈牙利算法的群控电梯调度的实现  

Achieving the Dispatching of Group Control Elevator Based on Hungarian Algorithm

作　　者：刘美菊[1] 刘冬[1] 刘剑[1] 

机构地区：[1]沈阳建筑大学信息与控制工程学院,辽宁沈阳110168

出　　处：《沈阳建筑大学学报（自然科学版）》2013年第5期955-960,共6页Journal of Shenyang Jianzhu University：Natural Science

基　　金：国家自然科学基金项目(61070024);沈阳建筑大学科研基金项目(2012007)

摘　　要：目的运用匈牙利算法实现基于多目标优化的群控电梯调度.方法将匈牙利算法运用于电梯调度中,通过采集当前电梯运行状态,获取电梯呼梯信号,将各呼梯信号用效率评价函数进行处理,获取总效率评价矩阵,再采用匈牙利算法对矩阵进行处理,得到派梯方案矩阵.结果运用匈牙利算法得到的派梯方案能够有效地实现高峰期人员的合理调度,为每一个呼梯信号提供合理电梯响应.评价函数能够正确反应电梯一天内的评价指标,算法能够有效地抑制随人数的增多对电梯造成的严重负担.结论将匈牙利算法运用于电梯调度中可以有效地提高电梯运行效率,提高综合性能指标,实现对电梯的多目标优化.This paper aims to achieve the dispatching of group control elevator for multi-objective optimiza- tion by utilizing the Hungarian algorithm. This paper applies Hungarian algorithm to elevator dispatching. First, we collect the current operation status to get the call signal of the elevator. Then we process the call signal by using the Efficiency Evaluation Function to obtain the evaluation matrix of the overall efficiency. At last we use the Hungarian algorithm to process the matrix to gain the elevator dispatching solution matrix. The result shows that the elevator dispatching solution gained by applying the Hungarian algorithm can effec- tively achieve reasonable dispatching of staff during the rush hours and provide reasonable elevator response for each call signal. Evaluation Function can correctly reflect the evaluation index of the elevator in the whole day and the Hungarian algorithm can effectively inhibit the serious burden of the elevator caused by the increasing number of people. The simulation result shows that applying the Hungarian algorithm to eleva- tor dispatching can improve the elevator operation efficiency, improve the comprehensive performance indi- cators and achieve multi-objective optimization of the elevator.

关 键 词：群控电梯 调度 匈牙利算法 多目标 

分 类 号：TU857[建筑科学]