Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering, 5th (ICACTE 2012)Available to Purchase
Editor
Xie Yi
Xie Yi
Search for other works by this author on:
ISBN:
9780791860045
No. of Pages:
938
Publisher:
ASME Press
Publication date:
2012

Most of the scheduling algorithm of elevator group system today mainly focus on how to reduce the waiting time of passengers and the running time of elevators, and the energy consume of elevators is always ignored. A least-cost energy dispatching algorithm for elevator group system based on ant colony algorithm is proposed in this paper. Because the dispatching problem of elevator group control system is a typical combinatorial optimization problem, and the ant colony algorithm is good at solving discrete combinatorial optimization problem, and it has good global optimization ability and fast convergence ability. In order to achieve the goal of energy saving, first, the algorithm model and the energy objective function is established; second, optimal convergence mechanism based on pheromone-update and the elevator-select probability is proposed; and tabu list is used. Finally, data simulation experiment was taken and the result of data simulation show that the algorithm is efficient and effective.

1. Introduction
2. Model of the Ant Colony Dispatching Algorithm
3. Flow Chart of the Algorithm
4. Experiment Simulation
5. Conclusion
6. Acknowledgment
References
This content is only available via PDF.
You do not currently have access to this chapter.

or Create an Account

Close Modal
Close Modal