摘要
为了研究多台电梯的群控调度问题,并根据现有电梯调度策略的不足,建立以服务间和运行能耗为优化目标函数的调度模型,提出将电梯群控调度问题转化为离散组合优化问题,并利用蚁群优化算法求解。算法在接受众多乘客的随机请求下,能根据各电梯的运行现状,将不同层的乘客请求组合分配到相应电梯进行服务的最优调度方案,优化了群控电梯的运行模式,仿真实验证明算法能大幅度减少乘客的平均侯梯时间及缩短运行路径,证明了算法的有效性。
The Services time and energy consumption were selected as the optimization objective function, and then the elevator group control scheduling problem was converted into a discrete combinatorial optimization problems and ant colony optimization algorithm was proposed to solve this optimization problem. According the random request of passengers and the operation status of the elevators, algorithm assigned the passengers requesting of different layers to the corresponding optimal service elevator, and then optimized the operation of elevator group control mode, through the simulation results show that the effectiveness of this optimization algorithm.
出处
《计算技术与自动化》
2009年第2期42-44,49,共4页
Computing Technology and Automation
关键词
电梯群控
调度方法
蚁群优化算法
elevator group control
dispatching method
ant colony optimization algorithm
