CN113581946A

CN113581946A - Elevator group management method and elevator group management system

Info

Publication number: CN113581946A
Application number: CN202010361909.5A
Authority: CN
Inventors: 陈玉东; 孙兴进
Original assignee: Shanghai Mitsubishi Elevator Co Ltd
Current assignee: Shanghai Mitsubishi Elevator Co Ltd
Priority date: 2020-04-30
Filing date: 2020-04-30
Publication date: 2021-11-02
Anticipated expiration: 2040-04-30
Also published as: CN115724306A; CN115650000A; CN113581946B

Abstract

The invention discloses an elevator group management method and an elevator group management system, which comprise the following steps: step S1, judging whether special users exist in the elevator users, if so, entering step S2, otherwise, entering step S3; step S2, adopting an optimized allocation strategy to allocate the elevator waiting persons and output allocation results, and entering step S4, wherein the optimization target of the optimized allocation strategy comprises the adverse effect of minimizing the special users on the common users; step S3, adopting a conventional group allocation strategy to allocate the elevator waiting persons and output allocation results, and entering step S4; and step S4, controlling the elevator to run according to the allocation result to respond the elevator taking request of the elevator waiting person. The elevator control method and the elevator control system can accurately judge whether the elevator user is a special user, and effectively shorten the mixed riding process of a common user and the special user under the condition that the special user exists, so that the adverse effect of the special user on the riding experience of other elevator users of the same elevator is reduced to the maximum extent.

Description

Elevator group management method and elevator group management system

Technical Field

The invention relates to an elevator group control technology, in particular to an elevator group management system and an elevator group management method which can deal with special users (such as carrying bulky articles, taking wheelchairs or sickbeds, carrying pets and the like) which affect other users for elevator users.

Background

The elevator group management system can respond to the call request of the passenger by properly allocating the elevator, thereby improving the transportation efficiency of the elevator and shortening the waiting time of the passenger. However, when the elevator waiting passengers include special elevator waiting persons, the elevator allocated by the elevator group management system may not be able to enter the car and stop the elevator inefficiently because the remaining riding space of the elevator cannot meet the required space of the special elevator waiting persons, thereby causing low elevator transportation efficiency.

In order to solve the above problems, the passenger interface device in the exemplary elevator destination entry system disclosed in chinese patent application CN104066667B provides the passenger with an interface for selecting a visual representation of his or her carried items, the controller determines the amount of space required in the elevator car to accommodate the passenger's carried items based on predetermined space information corresponding to the selected visual representation, and the elevator group management system allocates enough space to accommodate the passenger and the elevator carrying items to respond to his or her call request, thereby solving the basic problem of "riding in the car" of the passenger carrying a large volume of items.

However, when a passenger who carries a bulky article, a passenger who carries a dirt, a passenger who carries a large pet, a passenger who takes a wheelchair or a hospital bed, or the like enters the car and takes an elevator, the passenger may feel uncomfortable to the passenger who takes the elevator together with the passenger, and the passenger may feel bad. Obviously, the invention patent focuses on how to ensure that the special elevator waiting person can smoothly ride the elevator and how to reduce or eliminate the influence of the special elevator waiting person on the elevator conveying efficiency, but does not consider or relate to the elevator riding experience of other passengers riding the elevator together with the special elevator riding person.

Therefore, how to ensure the elevator riding experience of other elevator riders riding the same elevator as the special elevator waiting person becomes a problem to be solved.

Disclosure of Invention

The technical problem to be solved by the invention is to provide an elevator group management method and an elevator group management system, which can solve the problems that the adverse effect of a special user on the elevator riding experience of other users sharing the same elevator is not considered and the elevator riding experience of other users sharing the same elevator with the special user cannot be ensured in the prior art.

In order to solve the above problems, the present invention provides an elevator group management method, comprising the steps of:

step S1, judging whether special users exist in the elevator users, if so, entering step S2, otherwise, entering step S3;

step S2, allocating the elevator waiting persons by adopting an optimized allocation strategy and outputting allocation results, and entering step S4, wherein the optimization objective of the optimized allocation strategy comprises minimizing the adverse effect of the special users on the common users;

step S3, adopting a conventional group allocation strategy to allocate the elevator waiting persons and output allocation results, and entering step S4;

and step S4, controlling the elevator to run according to the allocation result to respond the elevator taking request of the elevator waiting person.

Further, in the step S1, the specific steps of determining whether there is a special user are as follows:

step S11, obtaining the characteristic attribute information of the elevator user, wherein the characteristic attribute information comprises the characteristic attribute of the elevator user and the corresponding characteristic attribute value;

step S12, judging whether the elevator user is a special user according to the characteristic attribute information of the elevator user and preset target characteristic attribute information, wherein the target characteristic attribute information comprises all characteristic attributes and characteristic attribute threshold values corresponding to the characteristic attributes.

Further, the method for acquiring the characteristic attribute information of the elevator user is any one of the following methods:

mode 1, acquiring identity information of the elevator user, and acquiring characteristic attribute information of the elevator user according to the identity information;

mode 2, directly obtaining the characteristic attribute information of the elevator user according to the received operation information of the elevator user;

in the mode 3, for the elevator waiting person in the elevator user, the image information of the elevator waiting area of the elevator waiting hall is obtained, and the image information of the elevator waiting area is analyzed to obtain the characteristic attribute information of the elevator waiting person.

Further, in the mode 1, the identification information of the elevator user is obtained by acquiring and recognizing the biometric feature of the elevator user or reading an article carried by the elevator user and storing the identification information thereof.

Further, the step S2 specifically includes the following steps:

step S21, obtaining the current state information of the elevator;

step S22, determining an elevator capable of transporting the special elevator waiting person and defining the elevator as an elevator for the special elevator waiting person;

step S23, enumerating all possible allocation schemes of the elevator waiting persons for taking the elevator;

step S24, establishing an evaluation function with the objective of minimizing the adverse effect of a special user on a common user when the special user and the common user are mixed;

step S25, calculating the evaluation results of all distribution schemes according to the evaluation function;

and step S26, selecting the allocation scheme corresponding to the optimal evaluation result as the final blending result and outputting the final blending result.

Further, in step S23, the special elevator waiting person takes only the elevator subject to the special elevator waiting person, and the general elevator waiting person takes all the elevators.

Further, in step S22, the specific step of determining the elevator to be a special elevator waiting person is as follows:

step L1, judging whether the special elevator waiting person is a limited resource of the elevator car according to the characteristic attributes, if so, entering step L2, otherwise, taking all elevators as the special elevator waiting person object elevators, and entering step L6;

l2, analyzing according to the current state information of the elevator and the characteristic attributes of the special elevator waiting persons to obtain available resources corresponding to the characteristic attributes of the elevator and the special elevator waiting persons;

step L3 of comparing a characteristic attribute value corresponding to the characteristic attribute of the special elevator waiting person with the available resources of the elevator;

step L4, judging whether the elevator is the elevator of the special elevator waiting person according to the comparison result;

step L5, judging whether all elevators are analyzed and judged, if so, entering step L6, otherwise, returning to step L2;

in step L6, the process advances to step S23.

Further, when the optimization objective of the optimized deployment strategy includes an additional objective other than an objective of minimizing adverse effects on the general users by the special users when the special users and the general users are mixed, the objective of minimizing adverse effects on the general users by the special elevator waiting persons when the additional objective is mixed with the special elevator waiting persons and the general elevator waiting persons obtains a total evaluation index by weighted summation, and a weighting coefficient of the objective of minimizing adverse effects on the general elevator waiting persons by the special elevator waiting persons when the additional objective is mixed with the special elevator waiting persons and the general elevator waiting persons is determined according to at least one of current state information of the elevator, future state information of the elevator, current elevator user information, and future elevator user information.

Further, the objective of minimizing the adverse effect of the special user on the general user during the mixed ride of the special user and the general user adopts an evaluation function with at least one of the mixed ride number, the mixed ride time, the mixed ride moving distance and the mixed ride stopping times as the characterization variable.

Further, the evaluation function adopts any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

mode 3, the mixed passenger number × (α)₁X hybrid time + beta₁X travel distance of mixing multiplication), where α₁And beta₁Is a coefficient;

mode 4. alpha₂X hybrid time + beta₂X mixed travel distance + gamma x mixed number of passengers, where alpha₂、β₂And γ is a coefficient.

Or further, the step S2 specifically includes the following steps:

step S21, judging whether the elevator waiting persons can be allocated by adopting a separation allocation algorithm, wherein the separation allocation algorithm is to allocate special elevator waiting persons to elevators carrying special elevator passengers and/or empty elevators, and allocate common elevator waiting persons to elevators not carrying special elevator passengers and/or empty elevators, so that the special users and the common users respectively take different elevators, if yes, the step S22 is carried out, otherwise, the step S23 is carried out;

step S22, allocating the elevator waiting persons by adopting a separation allocation algorithm, outputting allocation results, and entering step S4;

and step S23, allocating the elevator waiting persons by adopting a mixed-riding allocation algorithm, outputting allocation results, and entering step S4, wherein the mixed-riding allocation algorithm allocates the elevator waiting persons to part or all of elevators in an elevator group, and allocates at least one common elevator waiting person to an elevator carrying special elevator passengers or allocates at least one special elevator waiting person to an elevator carrying common elevator passengers or allocates at least one common elevator waiting person and at least one special elevator waiting person to the same elevator.

Further, in step S21, it is determined whether the elevator waiting person can be allocated by the separation and allocation algorithm as follows:

step S211, judging whether an elevator and/or an empty elevator only transporting special elevator passengers and/or only transporting common elevator passengers exist, if so, entering step S212, otherwise, entering step S23:

step S212, determining the current available resources of the elevator without the special elevator, and calculating the total available resources;

step S213, calculating the total occupied resources required by all the ordinary elevator waiting persons when taking the elevator;

step S214, judging whether the total occupied resources are larger than the total available resources, if so, judging that the elevator waiting persons cannot be allocated by adopting a separation allocation algorithm, otherwise, entering step S215;

step S215, an elevator which is not allocated with a common elevator waiting person and is provided with a special elevator passenger and/or an empty elevator which is not allocated with a common elevator waiting person is taken as an elevator subject to the special elevator waiting person;

step S216, enumerating all possible combinations of the special elevator waiting persons, constructing different sets by using the obtained combinations as elements, wherein each set comprises all the special elevator waiting persons and the number of each special elevator waiting person is 1, allocating all the elements in each set to the special elevator waiting person object elevators, and establishing the corresponding relation between the elements in each set and the special elevator waiting person object elevators;

and S217, judging whether a set of available resources of the elevator of which the necessary resources required by each element are less than or equal to those of the corresponding special elevator waiting person object exists, if so, judging that the elevator waiting person can be allocated by adopting a separation allocation algorithm, otherwise, judging that the elevator waiting person cannot be allocated by adopting the separation allocation algorithm.

Further, in step S22, the step of allocating the elevator waiting persons by using the separation and allocation algorithm is as follows:

step A1, using the elevator loaded with special elevator passengers and/or the empty elevator as the elevator for special elevator waiting people;

step A2, enumerating all possible combinations of special elevator waiting persons, constructing different sets by using the obtained combinations as elements, wherein each set comprises all the special elevator waiting persons and the number of each special elevator waiting person is 1, allocating all the elements in each set to the special elevator waiting person object elevators, and establishing the corresponding relation between the elements in each set and the special elevator waiting person object elevators;

step A3, selecting the set with the maximum residual available resources after the special elevator waiting person object elevator is allocated with the special elevator waiting person from all sets of the available resources of the special elevator waiting person object elevator with the necessary resources required by each element less than or equal to the available resources of the corresponding special elevator waiting person object elevator, and forming a special elevator waiting person allocation scheme by utilizing the selected set and the corresponding relation between the elements in the set and the special elevator waiting person object elevator;

step A4, taking the elevator without special elevator taking persons and allocated with special elevator waiting persons as the elevator for the common elevator waiting persons;

step A5, a conventional allocation algorithm is adopted to allocate the ordinary elevator waiting persons to the elevators of the ordinary elevator waiting persons, and an ordinary elevator waiting person allocation scheme is formed;

and A6, combining the special elevator waiting person allocation scheme and the common elevator waiting person allocation scheme as a final allocation result and outputting the final allocation result.

Further, the mixed-ride dispatching algorithm is any one of a common elevator waiting person priority dispatching algorithm, a special elevator waiting person priority dispatching algorithm or a corresponding priority dispatching algorithm, wherein:

the common elevator waiting people priority dispatching algorithm is that the common elevator waiting people with the matched number are firstly distributed to the elevators without carrying special elevator passengers, and then the rest common elevator waiting people and the special elevator waiting people are distributed to the elevators carrying special elevator passengers;

the special elevator waiting person priority allocation algorithm is that the special elevator waiting persons with the matched number are allocated to the elevator carrying the special elevator passengers, and then the rest special elevator waiting persons and the ordinary elevator waiting persons are allocated to the elevator not carrying the special elevator passengers;

the corresponding preferential dispatching algorithm is that the common elevator waiting persons with the matched number are firstly distributed to the elevators only carrying the common elevator riders, the special elevator waiting persons with the matched number are distributed to the elevators carrying the special elevator riders, the rest special elevator waiting persons are distributed to the elevators not carrying the special elevator riders, and the rest common elevator waiting persons are distributed to the elevators with empty cars and/or the elevators carrying the special elevator riders.

Further, when special elevator waiting persons exist and the number of special users is larger than 2, the mixed-taking and dispatching algorithm selects a special elevator waiting person priority dispatching algorithm, and the special elevator waiting persons are firstly distributed to the elevators carrying the special elevator passengers.

Further, when the special elevator waiting persons are allocated to the elevators carrying the special elevator riders, the elevators carrying the special elevator riders are sequentially selected from front to back according to the sequencing result, and the special elevator waiting persons with the matched allocation number are allocated according to the available resources of the selected elevators.

Further, when special elevator waiting persons exist and the number of the special users is larger than 2, the elevators carrying the special elevator passengers and the empty elevators are used as special elevator waiting person object elevators, all combinations of the special elevator waiting persons are enumerated, different sets are constructed by using the obtained combinations as elements, each set comprises all the special elevator waiting persons, the number of the special elevator waiting persons is 1, all the special elevator waiting persons in each set are allocated to the special elevator waiting person object elevators, the corresponding relation between the elements in each set and the special elevator waiting person object elevators is established, the set with the minimum number of the elevators carrying the special users after the special elevator waiting person object elevators are allocated to the special elevator waiting persons is selected, and the special elevator waiting persons are allocated according to the corresponding relation between the elements in the selected set and the special elevator waiting person object elevators.

Further, when the remaining special elevator waiting persons are allocated to an elevator carrying a general user or the general elevator waiting persons and the remaining special elevator waiting persons are allocated to the same elevator so that the general user and the special user ride in a mixed manner, the number of the special users in each mixed elevator is approximately equal.

Further, when the ordinary elevator waiting persons are allocated to the elevators carrying the special users, the ordinary elevator waiting persons in the mixed elevator are all behind or all earlier than the special users in the same mixed elevator.

Further, when all the common elevator waiting persons are later than all the special users, sorting the common elevator waiting persons from near to far according to the distance between the target floor of the special user and the current floor, and allocating the common elevator waiting persons to the elevator where the special user with the most front sorting result is located; and when all the common elevator waiting persons are earlier than all the special users, sequencing the common elevator waiting persons from near to far according to the distance between the target floor of the common elevator waiting person and the current floor, and selecting the common elevator waiting persons with the matched number from front to back according to the sequencing result as the common elevator waiting persons for mixed riding.

Further, in step S23, when the allocation plan obtained by the hybrid allocation algorithm is not unique and the hybrid allocation algorithm allocates the normal elevator waiting person to an elevator already carrying a special elevator or allocates the special elevator waiting person to an elevator carrying only a normal user or allocates the normal elevator waiting person and the special elevator waiting person to the same elevator so that the normal user and the special user are mixed, an evaluation function is established that aims to minimize the adverse effect of the special user on the normal user when the special user and the normal user are mixed, all the allocation plans are evaluated by using the evaluation function, and the allocation plan corresponding to the best evaluation result is output as the allocation result.

Further, the evaluation function takes at least one of the mixed passenger number, the mixed passenger time, the mixed passenger moving distance and the mixed passenger stop number as a characteristic variable.

Further, the evaluation function adopts any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

Meanwhile, in order to solve the above-mentioned technical problems, an elevator group management system according to the present invention includes:

the information acquisition unit is used for acquiring elevator user information;

the analyzing unit is used for analyzing the information of the elevator user and outputting the characteristic attribute of the elevator user and a corresponding characteristic attribute value;

the judging unit judges whether the elevator user is a special user according to the characteristic attribute and the characteristic attribute value output by the analyzing unit;

the selection unit is used for selecting an execution allocation strategy and outputting an allocation result, when the judgment unit judges that the elevator users have special users, the selection unit selects an optimized allocation strategy as the execution allocation strategy, otherwise, a conventional group allocation strategy is selected as the execution allocation strategy; wherein, the optimization goal of the optimized allocation strategy comprises minimizing the adverse effect of the special user on the ordinary user;

and the control unit controls the elevator to run according to the allocation result output by the selection unit and responds to the elevator taking request of the elevator waiting person.

Further, the elevator user information is actively acquired by the information acquisition unit by means of a sensing device or is acquired by the information acquisition unit by means of an input from an elevator user received by an information receiving module.

Further, the parsing unit includes:

a first storage module for storing all possible characteristic attributes of the elevator user;

and the analysis module judges all possible characteristic attributes one by one according to the source or the content of the elevator user information to determine whether the characteristic attribute value corresponding to the possible characteristic attribute can be obtained from the elevator user information, and finally obtains and outputs the characteristic attribute of the elevator user and the characteristic attribute value corresponding to each characteristic attribute through analysis.

Further, the judging unit includes:

the second storage module is used for storing preset target characteristic attribute information, and the target characteristic attribute information comprises all characteristic attributes and characteristic attribute thresholds corresponding to the characteristic attributes;

the query module is used for searching the characteristic attribute threshold corresponding to the characteristic attribute from the second storage module according to the characteristic attribute output by the analysis unit;

the comparison module is used for comparing the characteristic attribute value corresponding to the characteristic attribute output by the analysis unit with the characteristic attribute threshold value corresponding to the characteristic attribute searched by the query module;

and the judging module is used for judging whether the elevator user with the characteristic attribute and the characteristic attribute value is a special user or not according to the comparison result of the comparing module.

Further, the specific steps of optimizing the deployment strategy are as follows:

step S1, obtaining the current state information of the elevator;

step S2, determining an elevator capable of transporting the special elevator waiting person and defining the elevator as an elevator for the special elevator waiting person;

step S3, enumerating all possible allocation schemes of the elevator waiting persons for taking the elevator;

step S4, establishing an evaluation function with the objective of minimizing the adverse effect of a special user on a common user when the special user and the common user are mixed;

step S5, calculating the evaluation results of all distribution schemes according to the evaluation function;

and step S6, selecting the allocation scheme corresponding to the optimal evaluation result as the final blending result and outputting the final blending result.

Further, the evaluation function adopts any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

Or further, the specific steps of optimizing the deployment strategy are as follows:

step S1, judging whether the elevator waiting persons can be allocated by adopting a separation allocation algorithm, wherein the separation allocation algorithm is to allocate special elevator waiting persons to elevators carrying special elevator passengers and/or empty elevators, and allocate common elevator waiting persons to elevators not carrying special elevator passengers and/or empty elevators, so that the special users and the common users respectively take different elevators, if yes, the step S2 is carried out, otherwise, the step S3 is carried out;

step S2, allocating the elevator waiting persons by adopting a separation allocation algorithm, and outputting allocation results;

and step S3, allocating the elevator waiting persons by adopting a mixed-riding allocation algorithm and outputting allocation results, wherein the mixed-riding allocation algorithm allocates the elevator waiting persons to part or all of elevators in an elevator group, and allocates at least one common elevator waiting person to an elevator carrying special elevator passengers or allocates at least one special elevator waiting person to an elevator carrying common elevator passengers or allocates at least one common elevator waiting person and at least one special elevator waiting person to the same elevator.

Further, in step S1, it is determined whether the elevator waiting person can be allocated by the separation and allocation algorithm as follows:

step S11, judging whether there is an elevator and/or an empty elevator which only transports special elevator passengers and/or only transports common elevator passengers, if yes, entering step S12, otherwise entering step S3:

step S12, determining the current available resources of the elevator without the special elevator, and calculating the total available resources;

step S13, calculating the total occupied resources needed by all the ordinary elevator waiting persons when taking the elevator;

step S14, judging whether the total occupied resources are larger than the total available resources, if so, judging that the elevator waiting persons cannot be allocated by adopting a separation allocation algorithm, otherwise, entering step S15;

step S15, an elevator which is not allocated with a common elevator waiting person and is provided with a special elevator passenger and/or an empty elevator which is not allocated with a common elevator waiting person is taken as an elevator for a special elevator waiting person;

step S16, enumerating all possible combinations of special elevator waiting persons, constructing different sets by using the obtained combinations as elements, wherein each set comprises all the special elevator waiting persons and the number of each special elevator waiting person is 1, allocating all the elements in each set to the special elevator waiting person object elevators, and establishing the corresponding relation between the elements in each set and the special elevator waiting person object elevators;

and step S17, judging whether the necessary resources required by each element are less than or equal to the set of the available resources of the corresponding special elevator waiting person object elevator, if so, judging that the elevator waiting person can be allocated by adopting a separation allocation algorithm, otherwise, judging that the elevator waiting person cannot be allocated by adopting the separation allocation algorithm.

Further, the step of allocating the elevator waiting persons by adopting a separation allocation algorithm is as follows:

The elevator control method and the elevator control system can accurately judge whether the elevator user is a special user, and effectively shorten the mixed taking process of a common user and the special user under the condition that the special user exists, so that the adverse effect of the special user on the elevator taking experience of other elevator users of the same elevator is reduced to the maximum extent.

Drawings

Fig. 1 is an overall flowchart of a first embodiment of an elevator group management method of the present invention;

fig. 2 is a block diagram showing a first embodiment of the elevator group management system according to the present invention;

fig. 3 is a flowchart of step S2 of the second embodiment of the elevator group management method of the present invention;

fig. 4 is a flowchart of step S22 in step S2 of the second embodiment of the elevator group management method of the present invention;

fig. 5 is a flowchart of step S2 of the third embodiment of the elevator group management method of the present invention;

fig. 6 is a flowchart of step S21 in step S2 of the third embodiment of the elevator group management method of the present invention;

fig. 7 is a flowchart of step S22 in step S2 of the third embodiment of the elevator group management method of the present invention.

Detailed Description

Other advantages and effects of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein it is shown in the accompanying drawings, wherein the specific embodiments are by way of illustration. In the following description, specific details are set forth in order to provide a thorough understanding of the present invention, but the present invention may be practiced or applied in different embodiments, and the details may be based on different viewpoints and applications, and may be widely spread and replaced by those skilled in the art without departing from the spirit of the present invention.

Example one

The elevator group management method of the present embodiment, as shown in fig. 1, includes the steps of:

In step S1, the specific steps of determining whether there is a special user are as follows:

for example, when the special user is a user who takes a wheelchair or carries a large-volume article, the characteristic attribute of the special user is the elevator taking space, and the characteristic attribute value corresponding to the characteristic attribute is the space value required to be occupied by the user when the user finishes elevator taking; when the special user is a user carrying an article with pungent odor, the characteristic attribute of the special user is odor, and the characteristic attribute value corresponding to the characteristic attribute is determined according to whether the odor affects the human health, the irritation degree, the volatilization degree and the like, for example, the characteristic attribute value affecting the human health and having volatile odor is the largest, and the odor not affecting the human health is processed according to the irritation degree (high, medium and low) and the volatilization degree (high, medium and low) to obtain the characteristic attribute value; when the special user is a user carrying a sharp object, the characteristic attribute of the special user is dangerous, and the characteristic attribute value corresponding to the characteristic attribute is determined according to the danger degree (high, medium and low) of the sharp object;

Wherein, the obtaining mode of the characteristic attribute information of the elevator user is any one of the following modes:

Specifically, in the mode 1, the identification information of the elevator user is obtained by acquiring and recognizing the biometric feature of the elevator user or reading an article carried by the elevator user and storing the identification information thereof.

When the optimization target of the optimized dispatching strategy also comprises other additional targets, the total evaluation index is obtained by weighting and summing the targets of minimizing the adverse effects of the special elevator waiting persons on the common elevator waiting persons when the additional targets are mixed with the special elevator waiting persons and the common elevator waiting persons, and the weighting coefficient of the target of minimizing the adverse effects of the special elevator waiting persons on the common elevator waiting persons when the additional targets are mixed with the special elevator waiting persons and the common elevator waiting persons is determined according to at least one of the current state information of the elevator, the future state information of the elevator, the current elevator user information and the future elevator user information.

Specifically, the objective of minimizing the adverse effect of the special user on the general user during the mixed ride of the special user and the general user adopts an evaluation function with at least one of the mixed ride number, the mixed ride time, the mixed ride moving distance and the mixed ride stopping times as a characteristic variable. Preferably, the evaluation function takes any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

As shown in fig. 2, an elevator group management system based on the elevator group management method includes:

The elevator user information is actively acquired by the information acquisition unit by means of a sensing device or is acquired by the information acquisition unit by means of input from an elevator user received by an information receiving module.

Wherein the parsing unit includes:

Wherein the judging unit includes:

The embodiment can accurately judge whether the elevator user is a special user, and effectively shorten the mixed riding process of a common user and the special user under the condition that the special user exists, so that the adverse effect of the special user on the riding experience of other elevator users with the elevator is reduced to the maximum extent.

Example two

On the basis of the first embodiment, the present embodiment further illustrates an implementation manner of allocating the elevator waiting staff by using the optimized dispatching strategy in step S2. Specifically, as shown in fig. 3, the method specifically includes the following steps:

step S21, obtaining the current state information of the elevator;

In step S23, the special elevator waiting person takes only the elevator subject to the special elevator waiting person, and the general elevator waiting person takes all the elevators.

In step S22, the specific steps of determining the elevator to be the special waiting person are as shown in fig. 4, and include the following steps:

in step L6, the process advances to step S23.

The elevator group management system of the present embodiment has the same structural framework as the elevator group management system of the first embodiment, wherein when the determining unit determines that there is a special user among the elevator users, the optimized deployment strategy selected by the selecting unit adopts the elevator group management method of the present embodiment, as shown in the foregoing, and the description is not repeated here.

The optimized allocation strategy of the embodiment adopts an evaluation function aiming at minimizing the adverse effect of the special user on the common user during mixed riding to calculate and evaluate all possible allocation schemes, so that the allocation scheme with the optimal evaluation result is selected to allocate the elevator waiting users, and the adverse effect of the special user on the elevator riding experience of the common user is reduced to the greatest extent.

EXAMPLE III

On the basis of the first embodiment, the elevator group management method of the present embodiment further illustrates another implementation manner of allocating the elevator waiting users by using the optimized dispatching strategy in step S2. Specifically, as shown in fig. 5, the method specifically includes the following steps:

In step S21, as shown in fig. 6, it is determined whether the elevator waiting person can be allocated by the separation and allocation algorithm as follows:

In step S22, as shown in fig. 7, the step of allocating the elevator waiting persons by using the separation and allocation algorithm is as follows:

In step S23, the hybrid-ride dispatching algorithm is any one of a general elevator waiting person priority dispatching algorithm, a special elevator waiting person priority dispatching algorithm, or a corresponding priority dispatching algorithm, where:

When special elevator waiting persons exist and the number of special users is more than 2, the mixed-taking dispatching algorithm selects a special elevator waiting person priority dispatching algorithm and distributes the special elevator waiting persons to the elevator carrying the special elevator passengers firstly. Specifically, when the special elevator waiting persons are allocated to the elevators carrying the special elevator riders, the elevators carrying the special elevator riders are sequentially selected from front to back according to the sequencing result, and the allocated number of the special elevator waiting persons is matched according to the available resources of the selected elevators.

Or when special elevator waiting persons exist and the number of the special users is more than 2, the elevators carrying the special elevator waiting persons and the empty elevators are taken as special elevator waiting person object elevators, all combinations of the special elevator waiting persons are enumerated, different sets are constructed by using the obtained combinations as elements, each set comprises all the special elevator waiting persons, the number of the special elevator waiting persons is 1, all the special elevator waiting persons in each set are allocated to the special elevator waiting person object elevators, the corresponding relation between the elements in each set and the special elevator waiting person object elevators is established, the set with the minimum number of the elevators carrying the special users after the special elevator waiting person object elevators are allocated to the special elevator waiting persons is selected, and the special elevator waiting persons are allocated according to the corresponding relation between the elements in the selected set and the special elevator waiting person object elevators.

When the ordinary elevator waiting persons are allocated to the elevators carrying the special users, the ordinary elevator waiting persons in the mixed elevator are all behind or all earlier than the special users in the same mixed elevator. In particular, the amount of the solvent to be used,

when all the ordinary elevator waiting persons are later than all the special users, sorting the ordinary elevator waiting persons from near to far according to the distance between the target floor of the special user and the current floor, and allocating the ordinary elevator waiting persons to the elevator where the special user with the most front sorting result is located;

and when all the common elevator waiting persons are earlier than all the special users, sequencing the common elevator waiting persons from near to far according to the distance between the target floor of the common elevator waiting person and the current floor, and selecting the common elevator waiting persons with the matched number from front to back according to the sequencing result as the common elevator waiting persons for mixed riding.

In the step S23, when the allocation plan obtained by using the hybrid allocation algorithm is not unique and the hybrid allocation algorithm allocates the normal elevator waiting person to an elevator already carrying a special elevator or allocates the special elevator waiting person to an elevator carrying only a normal user or allocates the normal elevator waiting person and the special elevator waiting person to the same elevator so that the normal user and the special user are mixed, an evaluation function is established that aims to minimize the adverse effect of the special user on the normal user during the mixed riding of the special user and the normal user, and all the allocation plans are evaluated by using the evaluation function, and the allocation plan corresponding to the best evaluation result is output as an allocation result.

And the evaluation function takes at least one of the mixed passenger number, the mixed passenger time, the mixed passenger moving distance and the mixed passenger stop times as a representation variable. Preferably, any of the following expressions is used:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

The optimized dispatching strategy of the embodiment preferentially selects the separation dispatching algorithm, so that the situation that special users and common users are mixed can be completely avoided, the mixed dispatching algorithm is adopted under the condition that elevator waiting persons cannot be allocated by adopting the separation dispatching algorithm, the situations of available resources of the elevator waiting persons, the elevator taking persons and elevators are comprehensively considered in the mixed dispatching algorithm, and the adverse effect of the special users on the elevator taking experience of the common users is reduced to the maximum extent.

It should be noted that, in the present invention, the elevator waiting people refer to passengers waiting for taking the elevator in the elevator waiting area of the elevator waiting hall, and include special elevator waiting people and ordinary elevator waiting people, wherein the special elevator waiting people refer to elevator waiting people who will have adverse effect on the elevator taking experience of other elevator taking people who take the elevator together with the special elevator waiting people, such as carrying bulky articles, taking a wheelchair or a hospital bed, carrying pets, etc.; the elevator taking persons refer to passengers who are in the elevator car before the current dispatching, wherein the passengers include special elevator taking persons and ordinary elevator taking persons, and the special elevator taking persons refer to elevator taking persons who have adverse effects on elevator taking experiences of other elevator taking persons who take the elevator together with the special elevator taking persons; the elevator users are a collection of elevator waiting people and elevator taking people.

The present invention has been described in detail with reference to the specific embodiments, which are merely preferred embodiments of the present invention, and the present invention is not limited to the above embodiments. Equivalent alterations and modifications made by those skilled in the art without departing from the principle of the invention should be considered to be within the technical scope of the invention.

Claims

1. An elevator group management method, characterized by comprising the steps of:

2. The elevator group management method according to claim 1, wherein the specific step of determining whether or not a special user is present in step S1 is as follows:

3. The elevator group management method according to claim 2, wherein the characteristic attribute information of the elevator user is acquired by any one of:

4. The elevator group management method according to claim 3, wherein in mode 1, the identification information of the elevator user is obtained by acquiring and recognizing a biometric feature of the elevator user or reading an article carried by the elevator user and storing identification information thereof.

5. The elevator group management method according to claim 2, wherein the step S2 specifically includes the steps of:

step S21, obtaining the current state information of the elevator;

6. The elevator group management method according to claim 5, wherein in step S23, the special waiting person takes only the special waiting person-target elevator, and the general waiting person takes all elevators.

7. The elevator group management method according to claim 5, wherein the specific step of determining the special waiting party object elevator in step S22 is as follows:

in step L6, the process advances to step S23.

8. The elevator group management method according to claim 1, wherein when the optimization objective of the optimized dispatching strategy includes an additional objective other than minimizing the adverse effect of a special user on a general user when the special user and the general user are mixed, when the additional target is mixed with a special elevator waiting person and a common elevator waiting person, the target for minimizing the adverse effect of the special elevator waiting person on the common elevator waiting person is weighted and summed to obtain a total evaluation index, and the weight coefficient of the target for minimizing the adverse effect of the special elevator waiting person on the common elevator waiting person when the additional target is mixed with the special elevator waiting person and the common elevator waiting person is determined according to at least one of the current state information of the elevator, the future state information of the elevator, the current elevator user information and the future elevator user information.

9. The elevator group management method according to claim 1, 5 or 8, wherein a target for minimizing an adverse effect of a special user on a general user when the special user and the general user are mixed is used as an evaluation function representing at least one of the number of mixed passengers, mixed passenger time, mixed passenger moving distance, mixed passenger number of stops.

10. The elevator group management method according to claim 9, wherein the evaluation function is expressed by any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

11. The elevator group management method according to claim 1, wherein the step S2 specifically includes the steps of:

12. The elevator group management method according to claim 11, wherein in step S21, it is determined whether the elevator waiting person can be allocated by a separate allocation algorithm as follows:

13. The elevator group management method according to claim 11, wherein in step S22, the step of assigning the elevator waiting persons by using the separation and allocation algorithm is as follows:

14. The elevator group management method according to claim 11, wherein the mixed-ride dispatching algorithm is any one of a general elevator waiting person priority dispatching algorithm, a special elevator waiting person priority dispatching algorithm or a corresponding priority dispatching algorithm, wherein:

15. The elevator group management method according to claim 14, wherein when there are special waiting people and the number of special users is greater than 2, the mixed-riding dispatching algorithm selects a special waiting people priority dispatching algorithm, and allocates the special waiting people to the elevator with the special waiting people.

16. The elevator group management method according to claim 15, wherein when allocating the special waiting persons to the elevators on which special elevator riders are mounted, the elevators on which special elevator riders are mounted are sorted from a few to many according to the number of the general elevator riders mounted in the elevators on which special elevator riders are mounted, and the elevators on which special elevator riders are mounted are sequentially selected according to the sorting result from front to back and allocated with the matched number of the special waiting persons according to the available resources of the selected elevators.

17. The elevator group management method according to claim 14, wherein when there are special waiting people and the number of special users is more than 2, using an elevator loaded with special elevator passengers and an empty elevator as special elevator waiting person object elevators, enumerating all combinations of the special elevator waiting persons, constructing different sets by using the obtained combinations as elements, wherein each set comprises all the special elevator waiting persons and the number of each special elevator waiting person is 1, allocating all the special elevator waiting persons in each set to the special elevator waiting person object elevators, establishing a corresponding relation between the elements in each set and the special elevator waiting person object elevators, selecting the set which enables the number of the elevators loaded with the special users to be minimum after the special elevator waiting person object elevators are allocated to the special elevator waiting persons, and allocating the special elevator waiting persons according to the corresponding relation between the elements in the selected set and the elevators of the special elevator waiting persons.

18. The elevator group management method according to claim 14, wherein when the remaining special waiting persons are allocated to an elevator carrying a normal user or the normal waiting persons and the remaining special waiting persons are allocated to the same elevator so that the normal user and the special user ride together, the number of the special users in each of the elevators to be ridden together is approximately equal.

19. A group management method according to claim 14, characterized in that when allocating ordinary waiting persons to elevators already carrying special users, the ordinary waiting persons in the mixed-riding elevators are all later than the special users in the same mixed-riding elevator or all earlier than the special users in the same mixed-riding elevator.

20. The elevator group management method according to claim 19,

21. Elevator group management method according to any one of claims 14 to 20, in step S23, when the allocation plan obtained by the mixed-ride allocation algorithm is not unique and the mixed-ride allocation algorithm allocates the ordinary elevator waiting persons to elevators already carrying special elevators or allocates the special elevator waiting persons to elevators carrying only ordinary users or allocates the ordinary elevator waiting persons and the special elevator waiting persons to the same elevator so that the ordinary users and the special users ride together, establishing an evaluation function aiming at minimizing the adverse effect of a special user on a general user when the special user and the general user are mixed, and evaluating all the allocation schemes by using the evaluation function, and outputting the allocation scheme corresponding to the optimal evaluation result as an allocation result.

22. The elevator group management method according to claim 21, wherein the evaluation function is characterized by at least one of a number of mixed passengers, a mixed passenger time, a mixed passenger moving distance, and a mixed passenger stop number.

23. The elevator group management method according to claim 22, wherein the evaluation function takes any one of the following expressions:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

24. An elevator group management system, comprising:

25. The elevator group management system according to claim 24, wherein the elevator user information is actively collected by the information acquisition unit by means of a sensing device or is obtained by the information acquisition unit by means of an input from an elevator user received by an information receiving module.

26. The elevator group management system according to claim 24, wherein the parsing unit comprises:

27. The elevator group management system according to claim 24, wherein the judgment unit comprises:

28. The elevator group management system of claim 24, wherein the specific steps of optimizing the deployment strategy are as follows:

step S1, obtaining the current state information of the elevator;

29. The elevator group management system according to claim 24 or 28, wherein the objective of minimizing the adverse effect of the special user on the general user when the special user and the general user are mixed is to use an evaluation function in which at least one of the number of mixed passengers, the mixed passenger time, the mixed passenger moving distance, and the number of mixed passenger stops is a variable.

30. The elevator group management system according to claim 29, wherein the evaluation function is expressed in any one of the following manners:

mode 1, the number of mixed persons is multiplied by the mixed time;

mode 2, the number of mixed passengers × the mixed travel distance;

31. The elevator group management system of claim 24, wherein the specific steps of optimizing the deployment strategy are as follows:

32. The elevator group management system according to claim 31, wherein in step S1, it is determined whether the elevator waiting person can be allocated by the separate dispatching algorithm as follows:

33. The elevator group management system according to claim 31 wherein the step of assigning the waiting party using a split-dispatch algorithm is as follows:

34. The elevator group management system according to claim 31, wherein the mix-taking dispatching algorithm is any one of a general elevator waiting person priority dispatching algorithm, a special elevator waiting person priority dispatching algorithm or a corresponding priority dispatching algorithm, wherein: