电梯运行的特性 c++（Characteristics of elevator operation c++）.doc

电梯运行的特性 c++（Characteristics of elevator operation c++） Within the ladder outside the first priority, in order to operate the minimum distance to respond to the request of the passengers outside the ladder Consider the characteristics of several elevator operations: 1. states: stationary wait, uplink, downlink, 2. during the uplink, the instructions are divided into four cases: the current position has two instructions, the up and down instructions, and the up and down instructions at the current position 3. downlink process, the same 3. uplink description of the four cases 4. up and down, received a number of instructions, priority setting method (priority can also be the nearest principle, can also be the same direction priority, can also press the right way of calculating the priority level of the same direction: the power of 0.7 or more, the current level is the right distance from the target direction / final level, instructions wait longer more. According to all these results to determine the multiplication level to the next. 5., when the static state receives more than one user instruction, the priority choice method is set (can be close to the first meet, or the same 4 priority selection algorithm) 6. according to the cycle per week, record the number of times per day on each level up and down, count the activation level of each layer and the possible degree of uplink and downlink, which can be chosen as the algorithm to select the instruction priority 7. according to the data obtained from 6, it is possible to determine which layer the elevator should stop at rest and optimize the response time of each layer of the command 8., you can add the function that you can set the change priority method. You can adjust the algorithm according to the changing situation in order to expect the best priority selection algorithm The simulation is easy to run. However, when the number of elevators is greater than a moment, if the algorithm is not good, it will appear: 1, e