Design And Implementation Of Elevator Group Control System Based On Ant Colony Optimization

With the continuous development of the global economy, the urbanization around theworld is constantly advancing, followed by kinds of towering building. The elevator hasbecome most selected way for people to go to high-floor, elevator system has also comethrough the course of development from a single elevator to double elevator and to the groupcontrol. Until today, any building has a lot of people working at, the research anddevelopment of the Elevator Group Control System is inevitable. On the basis of the study ofant algorithm and its basic principles, give a ant algorithm based elevator group controlalgorithm, and use it as the basis for the design and realization of the ant algorithm basedelevator group control system.The focus of this article is the design and implementation of the ant algorithm basedelevator group control system, specifically the following points:1. On the basis research of the elevator group control problem, and combining thecharacteristics of the ant algorithm, give the design thinking of the problem of the elevatorgroup control solved using ant algorithm, which are the design of selection probability and thedesign of pheromone update method. And on this basis, give the detail description of the antalgorithm based elevator group control algorithm and its flowchart, and its pseudo-code.2. Give the general design and diagram of the elevator group control system, and thedesign ideas and the flow chart of every main module. On this basis, give the detailed designof every main module and implement the group control system in VS2005platform using C#language. Elevator Group Control System designed in this article use the three elevator jointcontrol for example, the system can meet the users’ demand for elevator group control.Finally, make a summary on the full text and the shortcomings of the ant algorithm basedelevator group control system designed in this article, and make an outlook for the futurework.