A dispatching device for coordinating elevators in multiple buildings based on dynamic time prediction dispatching algorithm

Abstract

The present invention belongs to the technical field of scheduling decision-making, and proposes a scheduling device for coordinating elevators in multiple buildings based on a dynamic time prediction scheduling algorithm, which includes two parts: hardware and software. The hardware part includes a controller, a human-machine interface, a switch and a network cable. The software is a dynamic time prediction scheduling algorithm. The controller and the human-machine interface are connected to each elevator at the remote end through a network cable and a switch; the dynamic time prediction scheduling algorithm runs inside the controller; within a working cycle, the controller first uses the network cable to obtain the current operating data of each elevator, and then calculates the most suitable operating state of each elevator through the calculation of the dynamic time prediction scheduling algorithm and generates a control instruction, and finally the controller sends the control instruction to each elevator and the human-machine interface through the network cable; the present invention can realize the intelligent scheduling of multi-story buildings and multiple elevators, and can be used for the optimal use scheduling decision of elevators in large shopping malls, large transportation hubs, office buildings, residential buildings and other buildings.

Description

Technical Field

[0001] The present invention relates to the technical field of dispatching decision making, and in particular to a dispatching device for coordinating elevators in multiple buildings based on a dynamic time prediction dispatching algorithm. Background Art

[0002] Elevators have become an indispensable means of transportation in cities. More and more buildings choose to install multiple elevators to alleviate the problem of increased passenger flow. At the same time, how to achieve the coordinated work of multiple elevators in multi-story buildings has become a hot topic. The elevator group control system based on the minimum waiting time proposed in "Xue Xulu, Zhang Li, Gao Qing, Tan Haiyan, Han Yisa. Research on improved algorithm of elevator group control based on the shortest distance [J]. Measurement and Control Technology, 2018, 37(11)" is currently a commonly used method in engineering. However, the time prediction algorithm used in this paper uses a static value method to define the highest and lowest floors that the elevator can reach. This does not conform to the dynamic operation of the elevator, which will cause the system to predict the waiting time. The deviation increases, resulting in energy waste in the scheduling process. In view of the new problems faced, it is necessary to study an intelligent scheduling device based on a dynamic time prediction scheduling algorithm to optimize the coordinated operation of multiple elevators in multi-story buildings to solve this problem. Summary of the invention

[0003] In order to solve the problem of how to realize the coordinated work of multiple elevators in multi-story buildings, the purpose of the present invention is to provide a dispatching device for coordinating elevators in multiple buildings based on a dynamic time prediction dispatching algorithm, which is used to realize the coordinated work of multiple elevators;

[0004] The technical solution adopted by the present invention is as follows: a scheduling device for coordinating elevators in multiple buildings based on a dynamic time prediction scheduling algorithm, including a connection between hardware devices and a dynamic time prediction scheduling algorithm; the connection between the hardware devices realizes data transmission, including the acquisition of current operating data of each elevator and the sending of control instructions; the dynamic time prediction scheduling algorithm obtains the optimal operating state of each elevator by calculating the current operating data of each elevator, and generates control instructions to be sent; the dynamic time prediction scheduling algorithm 2 includes a dynamic time prediction algorithm and a dynamic task allocation algorithm; the dynamic time prediction algorithm is used to dynamically predict the arrival time of each elevator; the dynamic task allocation algorithm is used to allocate elevator floor call requests to a specific elevator; the controller 1 uses a network cable 4 to obtain the current operating data of each elevator, and then obtains the optimal operating state of each elevator and generates control instructions through calculation of the dynamic time prediction scheduling algorithm, and finally the controller 1 sends the control instructions to each elevator and the human-machine interface 2 through the network cable 4 to realize the collaborative work of multiple elevators in multi-story buildings.

[0005] The dynamic time prediction algorithm is implemented in five cases according to the different directions and positions of the elevator car and the elevator call floor; the dynamic time prediction calculation formulas in each case are as follows:

[0006] 1) When the elevator car running direction is the same as the elevator calling direction and the elevator calling floor is in front of the elevator car running direction, The calculation formula is:

[0007]

[0008] In the formula, represents the predicted time for the i-th elevator car to arrive at the j-th called floor in the k-th calculation cycle; Indicates the current floor number of the i-th elevator car in the k-th calculation cycle; represents the floor number of the jth elevator call floor in the kth calculation cycle; Tw is the time required for the elevator car to pass through one floor of the building at a uniform speed without stopping; represents the number of stops experienced by the i-th elevator car on the way to the j-th call floor in the k-th calculation cycle; Ts is the average stop time of the elevator car to a call floor; i represents the i-th elevator in the elevator group numbered in a certain order; j represents the j-th call floor numbered in a certain order among all the call floors, which includes both up and down meanings; k represents the k-th calculation cycle of the dynamic time prediction scheduling algorithm;

[0009] 2) When the elevator car is running in the same direction as the elevator call direction and the elevator call floor is behind the elevator car running direction, the elevator car will be The calculation is divided into two calculation methods, as follows;

[0010] Car up:

[0011]

[0012]

[0013] Car down:

[0014]

[0015]

[0016] In the formula, It represents the highest floor reached by the i-th elevator car in the k-1-th calculation cycle, that is, the number of the highest floor reached by the elevator among all the assigned tasks and all the target floors of the responded passengers; It represents the lowest floor reached by the i-th elevator car in the k-1-th calculation cycle, that is, the lowest floor reached by the elevator among all the assigned tasks and all the target floors of the responding passengers;

[0017] 3) When the elevator call direction is opposite to the elevator car running direction, the elevator will There are two calculation methods, as follows:

[0018] Car up:

[0019]

[0020] Car down:

[0021]

[0022] Formulas (1)(2)(3)(4)(5) can be used to predict the time it takes for the elevator car to arrive at the called floor.

[0023] The dynamic task allocation calculation formula of the dynamic task allocation algorithm is as follows:

[0024]

[0025] In the formula, i represents the i-th elevator in the elevator group numbered in a certain order; j represents the j-th call floor in all the call floors numbered in a certain order, which includes both up and down meanings; k represents the k-th calculation cycle of the dynamic time prediction scheduling algorithm; represents the predicted time for the i-th elevator car to arrive at the j-th called floor in the k-th calculation cycle; represents a set of all floors that call the elevator in the kth calculation cycle; Indicates the elevator number that responds to the j-th elevator call floor in the k-th calculation cycle.

[0026] The workflow of the dynamic time prediction scheduling algorithm is as follows;

[0027] Step 1: Controller 1 runs the dynamic time prediction scheduling algorithm and enters the initialization state; assigns variable k=0; Assign constants Tw, Ts;

[0028] Step 2: The dynamic time prediction scheduling algorithm is initialized and enters the dynamic calculation state; the dynamic time prediction scheduling algorithm first executes k plus 1; then the controller 1 obtains the status information of each remote elevator through the network cable 4, and obtains data;

[0029] Step 3: Controller 1 obtains After the data is collected, the dynamic time prediction calculation formula of the dynamic time prediction algorithm is used to calculate

[0030] Step 4: Controller 1 uses the calculated Data is obtained according to the dynamic task allocation calculation formula of the dynamic task allocation algorithm Controller 1 obtains data based on Send control instructions to the human-machine interface 4 and each remote elevator through the network cable 4, so that each elevator makes corresponding action adjustments;

[0031] Step 5: Before entering the next control cycle, controller 1 Update of definition Value, used for subsequent dynamic adjustment;

[0032] Step 6: Jump to step 2 to enter the next control cycle.

[0033] The connection between the hardware devices is mainly composed of a controller 1, a human-machine interface 2, a switch 3 and a network cable 4; the controller 1 and the human-machine interface 2 are respectively connected to the switch 3 through the network cable 4, and the switch 3 is connected to each remote elevator controller through the network cable 4; the dynamic time prediction scheduling algorithm runs inside the controller 1.

[0034] The beneficial effect of the present invention is that a dispatching device based on a dynamic time prediction dispatching algorithm to coordinate multi-building elevators can dynamically predict the time required for an elevator to reach a floor for which an elevator is called, has strong real-time performance, and has a powerful dispatching capability. The device of the present invention can realize intelligent dispatching of multi-story buildings and multiple elevators, and can be used for optimal dispatching decisions for elevators in large shopping malls, large transportation hubs, office buildings, residential buildings, and other buildings. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 is a schematic diagram of the connection between the hardware devices of the present invention;

[0036] Figure 2 It is the operation logic diagram of the dispatching device that coordinates the elevators of multiple buildings based on the dynamic time prediction dispatching algorithm;

[0037] Figure 3 It is the flow chart of dynamic time prediction scheduling algorithm.

[0038] In the figure: 1-controller; 2-human-machine interface; 3-switch; 4-network cable. DETAILED DESCRIPTION

[0039] The present invention is further described below in conjunction with the accompanying drawings and implementation modes.

[0040] like Figure 1As shown, the hardware of the present invention includes a controller 1, a human-machine interface 2, a switch 3, and a network cable 4; the controller 1 and the human-machine interface 2 are respectively connected to the switch 3 through the network cable 4, and the switch 3 is connected to each remote elevator controller through the network cable 4; the network cable 4 is used to realize data acquisition and transmission between the controller 1 and the human-machine interface 2 and each remote elevator controller;

[0041] like Figure 2 As shown, the device enters the running state after being turned on; within a control cycle, the controller 1 obtains the state information of each elevator at the remote end through the network cable 4, and then runs the dynamic time prediction scheduling algorithm inside the controller 1 to obtain the most suitable running state of each elevator and generate control instructions, and finally sends the control instructions to each elevator and the human-machine interface 2 through the network cable 4; wherein the dynamic time prediction scheduling algorithm is composed of a dynamic time prediction algorithm and a dynamic task allocation algorithm;

[0042] Figure 2 In the dynamic time prediction algorithm, the dynamic prediction of the arrival time of each elevator is realized; for the convenience of the subsequent description, the variables contained in the dynamic time prediction algorithm are first declared; i represents the i-th elevator in the elevator group numbered in a certain order; j represents the j-th call floor in all the call floors numbered in a certain order, which includes both up and down meanings; k represents the k-th calculation cycle of the dynamic time prediction scheduling algorithm; represents the predicted time for the i-th elevator car to arrive at the j-th called floor in the k-th calculation cycle; Indicates the floor number of the jth elevator call floor in the kth calculation cycle; Indicates the current floor number of the i-th elevator car in the k-th calculation cycle; It represents the highest floor that the i-th elevator car should reach in the k-1-th calculation cycle, that is, the highest floor that the elevator should reach among all the tasks assigned to it and all the target floors that the passengers want to go to; It represents the lowest floor that the i-th elevator car should reach in the k-1-th calculation cycle, that is, the lowest floor that the elevator should reach among all the tasks assigned to it and all the target floors that the passengers want to go to; Tw is the time it takes for the elevator car to pass through one floor of the building at a uniform speed without stopping; Ts is the average stop time of the elevator car at a calling floor; Indicates the number of stops that the i-th elevator car should experience when reaching the j-th elevator call floor in the k-th calculation cycle; according to the different directions and positions of the elevator car and the elevator call floor, the dynamic time prediction algorithm is divided into 5 cases for implementation; the dynamic time prediction calculation formulas in various cases are as follows;

[0043] 1) When the elevator car running direction is the same as the elevator calling direction and the elevator calling floor is in front of the elevator car running direction, The calculation formula is:

[0044]

[0045] 2) When the elevator car is running in the same direction as the elevator call direction and the elevator call floor is behind the elevator car running direction, the elevator car will be There are two calculation methods, as follows.

[0046] Car up:

[0047]

[0048]

[0049] Car down:

[0050]

[0051]

[0052] 3) When the elevator call direction is opposite to the elevator car running direction, the elevator will There are two calculation methods, as follows.

[0053] Car up:

[0054]

[0055] Car down:

[0056]

[0057] Formulas (1)(2)(3)(4)(5) can predict the time it takes for the elevator car to arrive at the floor where the elevator is called. The core of the dynamic time prediction algorithm is to clarify and The algorithm clearly states that and Derived from all the tasks assigned to the elevator and all the destination floors that the passengers want to go to;

[0058] Figure 2 In the example, the dynamic task allocation algorithm is used to allocate the elevator floor call request to a specific elevator. For the convenience of the subsequent steps, the variables included in the dynamic task allocation algorithm are first declared. represents a set of all floors that call the elevator in the kth calculation cycle; Indicates the elevator number that responds to the jth elevator call floor in the kth calculation cycle; the dynamic task allocation calculation formula is as follows:

[0059]

[0060] Here’s how it works:

[0061] The algorithm flow of the dynamic time prediction scheduling algorithm is as follows Figure 3 As shown; for subsequent convenience, first declare the variables included in the dynamic time prediction scheduling algorithm; represents a set of all operable elevators in the kth calculation cycle;

[0062] Combination Figure 1-Figure 3 ,The workflow of the dynamic time prediction scheduling algorithm is as follows:

[0063] Step 0: The device starts, and controller 1 runs the dynamic time prediction scheduling algorithm to enter the initialization state; assigns variable k = 0; Assign constants Tw, Ts;

[0064] Step 1: The dynamic time prediction scheduling algorithm is initialized and enters the dynamic calculation state; the dynamic time prediction scheduling algorithm first executes k plus 1; then the controller 1 obtains the status information of each remote elevator through the network cable 4, and obtains data;

[0065] Step 2: Controller 1 obtains After the data is collected, the dynamic time prediction calculation formula of the dynamic time prediction algorithm is used to calculate

[0066] Step 3: Controller 1 uses the calculated Data is obtained according to the dynamic task allocation calculation formula of the dynamic task allocation algorithm Then controller 1 is based on the obtained data Send control instructions to the human-machine interaction interface 2 and each remote elevator through the network cable 4, so that each elevator makes corresponding action adjustments;

[0067] Step 4: Before entering the next control cycle, controller 1 should Update of definition value to facilitate subsequent dynamic adjustment;

[0068] Step 5: Jump to step 1 to enter the next control cycle;

[0069] Steps 0 to 5 implement the complete process of elevator dispatching by controller 1; the core of the present invention is to clarify and The algorithm clearly states that and It is derived from all the tasks assigned to the elevator and all the target floors that the passengers want to go to; at the same time, the entire scheduling process is constantly adjusted dynamically, so when a new elevator call floor is generated or cancelled, the controller 1 can quickly implement new task allocation based on the dynamic time prediction scheduling algorithm, which has strong adaptability.

Claims

1. A dispatching device for coordinating elevators in multiple buildings based on a dynamic time prediction dispatching algorithm, characterized in that: The intelligent scheduling device includes a connection between hardware devices and a dynamic time prediction scheduling algorithm; the connection between the hardware devices realizes data transmission, including the acquisition of current operating data of each elevator and the sending of control instructions; the dynamic time prediction scheduling algorithm obtains the optimal operating state of each elevator by calculating the current operating data of each elevator, and generates control instructions to be sent; the dynamic time prediction scheduling algorithm (2) includes a dynamic time prediction algorithm and a dynamic task allocation algorithm; the dynamic time prediction algorithm is used to dynamically predict the arrival time of each elevator; the dynamic task allocation algorithm is used to allocate elevator floor call requests to a specific elevator; the controller (1) uses a network cable (4) to obtain the current operating data of each elevator, and then obtains the optimal operating state of each elevator and generates control instructions through calculation of the dynamic time prediction scheduling algorithm, and finally the controller (1) sends the control instructions to each elevator and the human-machine interface (2) through the network cable (4); The dynamic time prediction algorithm is implemented in five cases according to the different directions and positions of the elevator car and the elevator call floor; the dynamic time prediction calculation formulas in each case are as follows: 1) When the elevator car running direction is the same as the elevator calling direction and the elevator calling floor is in front of the elevator car running direction, The calculation formula is: In the formula, represents the predicted time for the i-th elevator car to arrive at the j-th called floor in the k-th calculation cycle; Indicates the current floor number of the i-th elevator car in the k-th calculation cycle; represents the floor number of the jth elevator call floor in the kth calculation cycle; Tw is the time required for the elevator car to pass through one floor of the building at a uniform speed without stopping; represents the number of stops made by the i-th elevator car on its way to the j-th floor in the k-th calculation cycle; Ts is the average stop time of the elevator car at a call floor; i represents the i-th elevator in the elevator group numbered in a certain order; j represents the j-th call floor in a certain order among all the call floors, which includes both up and down meanings; k represents the k-th calculation cycle of the dynamic time prediction scheduling algorithm; 2) When the elevator car is running in the same direction as the elevator call direction and the elevator call floor is behind the elevator car running direction, the elevator car will be There are two calculation methods, as follows: Car up: Car down: In the formula, It represents the highest floor reached by the i-th elevator car in the k-1-th calculation cycle, that is, the number of the highest floor reached by the elevator among all the assigned tasks and all the target floors of the responded passengers; It represents the lowest floor reached by the i-th elevator car in the k-1-th calculation cycle, that is, the lowest floor reached by the elevator among all the assigned tasks and all the target floors of the responding passengers; 3) When the elevator call direction is opposite to the elevator car running direction, the elevator will There are two calculation methods, as follows: Car up: Car down: Formulas (1)(2)(3)(4)(5) can be used to predict the time it takes for the elevator car to arrive at the called floor.

2. The dispatching device for coordinating multiple building elevators based on dynamic time prediction dispatching algorithm according to claim 1 is characterized in that: The dynamic task allocation calculation formula of the dynamic task allocation algorithm is as follows: In the formula, i represents the i-th elevator in the elevator group numbered in a certain order; j represents the j-th call floor in all the call floors numbered in a certain order, which includes both up and down meanings; k represents the k-th calculation cycle of the dynamic time prediction scheduling algorithm; represents the predicted time for the i-th elevator car to arrive at the j-th called floor in the k-th calculation cycle; represents a set of all floors that call the elevator in the kth calculation cycle; Indicates the elevator number that responds to the j-th elevator call floor in the k-th calculation cycle.

3. The dispatching device for coordinating multiple building elevators based on dynamic time prediction dispatching algorithm according to claim 2 is characterized in that: The workflow of the dynamic time prediction scheduling algorithm is as follows; Step 1: The controller (1) runs the dynamic time prediction scheduling algorithm and enters the initialization state; assigns a variable k=0; Assign constants Tw, Ts; Step 2: The dynamic time prediction scheduling algorithm is initialized and enters the dynamic calculation state; the dynamic time prediction scheduling algorithm first executes k plus 1; then the controller (1) obtains the status information of each remote elevator through the network cable (4) and obtains data; Step 3: The controller (1) obtains After the data is collected, the dynamic time prediction calculation formula of the dynamic time prediction algorithm is used to calculate Step 4: The controller (1) uses the calculated Data is obtained according to the dynamic task allocation calculation formula of the dynamic task allocation algorithm Then the controller (1) based on the obtained data Sending control instructions to the human-machine interface (4) and each remote elevator via a network cable (4), so that each elevator makes corresponding action adjustments; Step 5: Before entering the next control cycle, the controller (1) Update of definition Value, used for subsequent dynamic adjustment; Step 6: Jump to step 2 to enter the next control cycle.

4. The dispatching device for coordinating multiple building elevators based on dynamic time prediction dispatching algorithm according to claim 2 or 3, characterized in that: The connection between the hardware devices is mainly composed of a controller (1), a human-machine interface (2), a switch (3) and a network cable (4); the controller (1) and the human-machine interface (2) are respectively connected to the switch (3) through the network cable (4), and the switch (3) is connected to each remote elevator controller through the network cable (4); and a dynamic time prediction scheduling algorithm runs inside the controller (1).

Images