Elevator Group Scheduling by Improved Dayan Particle Swarm Algorithm in Computer Cloud Computing Environment

Abstract

The world is entering the era of cloud computing. Due to the rapid development of computer technology, as the core content of elevator transportation technology, elevator group control dispatching systems and group intelligent algorithms will have a wide range of application prospects due to their significant advantages. The purpose of this paper is to study the elevator group scheduling problem of the improved Dayan particle swarm algorithm in the computer cloud computing environment.This article first summarizes the research status of elevator group control technology and algorithms, and then analyzes and studies the basic theory of cloud computing task scheduling. Combined with the improved Dayan particle swarm algorithm, the elevator prediction model is established. This paper systematically expounds the theory and algorithm principle of the basic particle swarm algorithm, and analyzes the Dayan particle swarm algorithm on this basis. In this paper, the experimental research is carried out by comparing the two algorithms on the simulation software. Research shows that the improved Dayan particle swarm algorithm has better scheduling performance than the traditional basic particle swarm algorithm.