GB2276470A - Group supervisory control device for elevators - Google Patents

Abstract

A plurality set of "batch call assignment plans" are prepared each of which is designed to assign at the same time respective elevator cars to a plurality of respective hall calls, the respective plans are examined and evaluated from many different angles, and an optimum plan is selected to generate a command. Thereby, an excellent call assignment control is using a much reduced calculation overhead to that required for individual call assignment, total servicing condition by a plurality of elevator cars is improved and a servicing performance thereby is enhanced. The calls may be divided into batches on the basis of the levels of crowding, the priorities of the calls, the floor zones from which they originate or predetermined service directories. <IMAGE>

Description

Group Supervisory Control Device for Elevators The present invention relates to a group supervisory control device for elevators and, in particular, relates to a group supervisory control device for elevators which may be used to assign registered calls from hall sides to optimum elevators by making use of a digital computer.

In accordance with progress of elevator control methods, nowaday, elevators are adaptively controlled dependent upon traffic demands in respective buildings.

JP-A-59-48369, for example, discloses a hall call assignment control method or a learning control technology in which parameters in the control method are automatically varied depending upon characteristic modes of traffic demands.

Further, JP-B-63-34110 discloses a control technology in which a hall call once assigned is reviewed in response to a car call to the same floor generated at an elevator moving in the same direction and capable of simultaneous servicing.

Further, JP-B-63-37024 discloses a control technology in which when an elevator approaches to a floor of an already assigned hall call a reassignment is executed.

Further, JP-B-01-14149 discloses a control technology in which an evaluation of a plurality of items including waiting time at landings and load in cars is executed.

Further, such control method is also known in which hall calls to be assigned are provisionally assigned for every hall call assignment and an elevator showing a minimum sum of increased waiting time with respect to all of the already assigned hall calls is selected.

Further, JP-A-59-223672 discloses a control technology in which a plurality of hall call assignment control methods are provided and a control method is selected depending on circumstances.

Further, JP-B-59-4355 and JP-B-59-8621 disclose a control technology in which such as predicted arrival time and predicted passengers in a car at the arrival are calculated in advance and processing time for assignment selection of a computer during hall call registration is reduced.

Further, JP-B-62-59033 discloses a group supervisory control device for elevators in which assigned elevators for the respective hall calls are selected and stored or informed to elevator car control units in advance and during hall call registration a computer performs only a simple processing of outputting assignment commands.

Further, JP-B-02-38510 discloses a control technology in which respective evaluation values for a plurality of hall calls are corrected based on priority depending on the respective hall call characteristics such as passing due to car full and number of left passengers unabled of boarding, and assignment control for inputted unassigned hall calls is performed based on the corrected evaluation values thereby such as important floors and crowded floors are served with priority.

Further, JP-A-61-211283 discloses a control method in which respective assignment patterns for a plurality of hall calls including already assigned hall calls are evaluated at every generation of a new hall call for improving total service conditions of elevators, and a combined pattern of assigned elevator cars showing a minimum sum of the evaluation values is selected to perform reassignment of a plurality of hall calls.

As has been explained above, the evaluation object for a call assignment in almost all of the conventional art relating to the call assignment for elevators is limited to a single call, accordingly an optimum elevator from a local point of view is selected and assigned for respective hall calls. However, from a total point of view an inconvenient and unreasonable service conditions are sometimes generated.

Many improvements were proposed for resolving the above problems, for example, JP-B-57-52314 discloses a control technology in which a control giving a priority to an elevator having assignment to floors ahead or behind is performed when assigning hall calls to elevators so as to resolve the above problems through reducing a partially collected operation. However, such measure is a supplemental processing method and not a fundamental improving measure and its improving effect on service performance is unstable, in particular, the improving effect of the elevator service control during crowded time was insufficient.

On one hand, in order to realize an optimum call assignment through judgement from a total point of view of an elevator control, it is necessary to consider assignment for a plurality of calls in a batch and to select an optimum call assignment based on a comprehensive evaluation.

For achieving these objects, for example, JP-B-51-28911 and JP-B-50-18261 propose a control method in which service zones are determined in advance while considering a total balance before call registration.

However, such method has a drawback which causes service unbalance when momental call unbalance is generated.

Further, JP-A-61-211283 proposes a control method in which batch assignment patterns are sequentially evaluated and an optimum assignment pattern is selected and executed.

However, in the above method, fistly when there are a multiplicity of registered calls the processing time therefor increases drastically as shown in equation (2), which will be explained later, and no specific counter measures there for are considered so that practical use thereof is difficult.

Namely, now assuming a case wherein there is six elevators and eight registered calls, number of call assignment patterns PN will reach upto about 1,700,000 sets and the processing time will reach upto 13,000,000 times in comparison with a case wherein an elevator assignment is performed only for newly generated hall calls. For this reason, with the above method it will be impossible to reduce the processing time for the call assignment below 100 times of that of the ordinary method even with several methods such as heuristic searching method, and the practical use of the above method is extremely difficult.Namely, number of call assignment patterns PN is expressed as follows PN = KH -. (1) wherein, K : number of elevators H : total already registered call number PN : combined pattern number Further, when assuming T is a multiple of the ordinary processing time for a call assignment, the above case is expressed as follows T = PN x H (2) Secondly, since the above method uses no evaluation items which are designed to improve the operation from an overview point, a drastic improvement of the call assignment processing could not be realized, therefore when evaluating respective assignment patterns, since none of the following items were evaluated, a fundamental improvement realizing a stable servicing performance could not be achieved.

(1) Namely, in order to perform an assignment in which by fully taking into account of passing because of filled up passengers before at a crowded floor of boarding passengers and developed car calls, the above mentioned method did not perform a control of assignment combination in view of importance of calls or an evaluation of importance.

(2) Further, an ideal operating method which improves both average waiting time and long waiting time rate is to uniformalize the waiting time, however, the above mentioned method neither determines balancing degree representing uniform time interval between respective elevators in near future nor evaluates the same in order to realize the above ideal operation.

(3) Still further, in order to help reversing travel direction of an elevator at intermediate floors, the above mentioned method neither estimates one cycle time of the respective elevators nor evaluates transport capacity based on the estimation.

Thirdly, the above mentioned method did not pay a sufficient consideration on an immediate reservation informing in the system so that there arised many reservation alternations which is inapplicable for practical uses.

An object of the present invention is to provide a group supervisory control device for elevators which solves the conventional problems as explained above and, in particular, may execute an assignment control for hall calls designating directions which can call a further optimum elevator and for destination designating calls which are effected by directly registering destination floors at landing floors (hereinafter these calls are simply referred to as calls) which may improve transport capacity and provide a totally balanced and stable service, in particular, for elevator operations at crowded times.

According to the present invention, in order to improve a total operating condition of elevators, the above object is achieved by providing a function which assigns elevators in a batch manner in response to a plurality of calls, by preparing a batch assignment plan which improves a total operating effeciency and by executing a command thereon.

More specifically, the object of the present invention may be achieved by forming a call assignment means for a group supervisory control device with means of (a) through (d) explained below which totally judges assignable elevators in response to the respective calls such as a plurality of registered calls, new calls requiring assignment and calls requiring reassignment (calls deferring assignment informing, calls already assigned of an elevator but which is shifted to non-supervisory one, calls passed because of filled-up passengers, calls passed because of delayed car deceleration processing, calls estimated of passing because of filled-up passengers and calls estimated of a long waiting time), prepares a plurality of assignment plans, selects a single plan among these plans based on either individual evaluation of hall calls or a total combined evaluation or a comprehensive evaluation, further selects at the same time serviceable elevators for a plurality of hall calls and generates assignment commands for the respective elevator control units.

(a) Means for extracting calls to be assigned which specifies a plurality of calls to be assigned for performing a batch call assignment.

The above extracting means can include means for limiting call number processed in one time and for grouping the calls for several time processings wherein calls having high importance are processed first.

Further, calls which will be generated with a high possibility in near future can be included in calls to be assigned as potential calls to be registered.

(b) Means for preparing limited batch call assignment plans below a predetermined number of sets.

The above preparing means is principally means for selecting one or more possible elevators for respective hall calls to be assigned based on a result of selection and evaluation of serviceable elevators for individual calls which creates batch call assignment plans through combining these possible elevator cars based on a predetermined rule.

(c) Means for selecting a plurality of calls to be assigned for performing a batch call assignment.

As explained above with reference to equations (1) and (2) which are again indicated below, for example, when assuming six elevators and eight registered calls, number of call assignment patterns PN will reach upto about 1,700,000 sets and the processing time will reach upto 13,000,000 times in comparison with a case wherein an elevator assignment is performed only for newly generated hall calls. For this reason, with the above method it will be impossible to reduce the processing time for a call assignment below 100 times of that of the ordinary method even with several methods such as heuristic searching method and the practical use of the above method is extremely difficult.

PN = KH ... (1) wherein, K : number of elevators H : total already registered call number PN : combined pattern number Further, when assuming T is a multiple of the ordinary processing time for a call assignment, the above case is expressed as follows T = PN x H -. (2) In order to prevent an explosive increase of processing time, it is necessary to limit the number of calls N to be assigned within 6 (preferably within 3 or 4).In this instance, assuming that K represents number of elevators and H represents number of total already registered calls, the plan number, which corresponds to the combined pattern number, results in KN and the multiple number T of the processing time is expressed as follows T = KN x Nx (1+H) (d) Means for performing total evaluation of respective batch call assignment plans while estimating the evaluation results when the same are executed with the following method.

(1) An operating condition in near future such as after 30sec. and 120sec. is estimated and evaluated according to such as balancing rate and coping rate against crowdness based on number of cars dispatched to crowded floors of boarding passengers to determine the total evaluation.

(2) An estimated transport passengers and estimated one cycle time according to the estimated condition in near future and a transport capacity index representing transport passengers per unit time are evaluated to determine the total evaluation.

(3) A plurality of evaluation items such as in-car crowdness, boarding time, waiting time at crowded floors, waiting time at not-busy floors, reservation altering rate, reservation lamp altering rate, first arrival rate, priority rate of an approaching elevator in response to an operation call, passing rate, energy saving rate and satisfaction on elevator speed are determined for respective elevators with regard to individual hall calls to be assigned and respective services are evaluated so as to determine a comprehensive individual evaluation.

(4) Further, according to requirement levels of customers which predetermine a plurality of evaluation items, a total evaluation or a comprehensive evaluation is performed, and by making use of a multi target evaluation and achievment rate the respective evaluation items indicated in (1) through (3) above are comprehensively evaluated and thereby a single plan is selected.

According to the present invention, with the constitution as explained above of the hall call assignment means the increasing multiple number T representing the processing time can be reduced even when there are many registered calls to thereby prevent the explosive increase thereof.

For example, when there are 6 elevators and 8 registered calls, it is assumed that the batch call assignment group setting means divides the group g into two and the batch call assignment plan preparing means determines an avarage number of possible cars as 2.5. In this instance, it is enough if 20 sets of plans are prepared for the respective groups according to equation (3) below, therefore the total number PN' of batch call assignment plans results in 40 sets. Further, the multiple number T of the processing time, when employed the batch call assignment plan method, is 100 times when avarage calls H' to be assigned for respective groups g are 4, according to equation (4) below in comparison with when independently assigning new hall calls, which is a significant improvement and is acceptable.

The present invention enables to reduce the multiple number of the assignment processing time with respect to the usual processing time below the target value of 100 times as explained above, thereby the present invention can be easily reduced into practice.

PN' = K' x D . (3) wherein PN' : number of plans K' : number of average possible cars D : number of calls to be assigned Further, when assuming that number of average calls to be assigned for respective groups g is H', the multiple number T' of the processing time is expressed as follows T' = PN' x H' (4) According to the present invention, while meeting with the use condition of elevators which changes drastically from time to time, the total balance is always maintained and the operation control of an equal time interval can be realized which is an ideal operating pattern for minimizing the average waiting time.

Further, the present invention can use an operating pattern which maximizes transport capacity when crowded.

Further, when the present invention is applied to a system incorporating a reservation informing mode, reservation altering rate is included in the evaluation items and on which evaluation item an importance is placed, thereby, substantially the same control as explained above is realized.

Further, when there arises an instance such as at lunch time wherein an increase of transport capacity is required, a batch call assignment plan which permits some reservation alternation can be selected, thereby, a control which increases transport capacity and reduces leaving of waiting passengers while minimizing change frequency of the reservation indicating lamp.

Further, when registering a call assignment by estimating a possible call generated in near future according to the present invention, a plurality of advantageous batch call assignment plans with no reservation indicating lamp change when a call is generated at the very estimated floor can be carefully prepared and among these plans a single plan can be selected in a short time processing.

In the drawings: Fig.l is a block diagram illustrating an entire hardware constitution of a group supervisory control system for elevators to which the present invention is applied Fig.2 is a block diagram illustrating a software construction of the group supervisory control device Fig.3 is a diagram for explaining a table constitution used for the group supervisory control device Fig.4 is a flowchart for explaining the entire processings performed by the operation control program Fig.5 is a flowchart illustrating the details of the call assignment processing in Fig.4 Fig.6 is a flowchart of the batch call assignment processing for explaining the details of the call assignment processing in Fig.5 Fig.7 is a flowchart for explaining the details of the assignable elevator car selection processing in Fig.6 Fig.8 is a flowchart for explaining the details of the first person's evaluation value calculation processing in Fig.7 Fig.9 is a flowchart for explaining the details of the third person's evaluation calculation processing in Fig.7 Fig.10 is a diagram for explaining constitutions of a call assignment evaluation parameter table and a call assignment rule selection table Fig.11 is a diagram for explaining constitution of a target value specification table Fig.12 is a diagram for explaining constitutions of learning tables Fig. 13 is a flowchart for explaining a batch call assignment group setting operation Fig.14 is a flowchart of a batch call assignment plan preparation for explaining preparation of a plurality of batch call assignment plans for respective batch call assignment groups Fig.15 is a diagram for explaining constitutions of batch call assignment plan tables Fig.l6 is a flowchart for explaining the batch call assignment plan evaluation and selection processings Fig.17 is a diagram for explaining a constitution of evaluation result table for respective batch call assignment plans Fig.18 is a flowchart for explaining execution command of a batch call assignment and recording processing thereof Fig.l9 is a diagram for explaining a constitution of control condition recording table Fig.20 is a flowchart for explaining evaluation value calculation processing of a concerned elevator car through which evaluation values for respective elevator cars are determined Fig.21 is a flowchart for explaining the details of the learning processing Fig.22 is a flowchart for explaining the details of a learning processing for modifying the control method and Fig.23 is a diagram for explaining assignment of possible elevator cars in response to a call from a floor crowded of boarding passengers.

Hereinbelow, one embodiment of group supervisory control devices for elevators according to the present invention is explained in detail with reference to the drawings.

Fig.l is a block diagram showing a total hardware constitution of a group supervisory control system for elevators to which the present invention is applied. In Fig.1, 1 designates an elevator control unit, 2 a call assignment rule resetting unit, 11 and 12 hall call registering units at respective floors, 13 an audible landing informing unit at respective floors, 14 a passage way displaying units at respective floors, 15 an annunciator in car, 16 an annunciator at landing, 20 through 22 elevator car control units and 30 through 32 elevator cars.

In Fig.l, the elevator control unit 1 is constituted by the group supervisory control unit 10 and the individual elevator car control units 20 through 22 and is operated by a well known microcomputer control method. The group supervisory control unit 10 is inputted signals from the hall call registering units 11 and 12 as its inputs and outputs signals representing such as response conditions and information on operating conditions for the call registering units 11 and 12, the audible informing units 13 at landings and landing displaying units 14 arranged at the landings or the passage ways.

The elevator car control units 20 through 22 perform a traveling control for the respective elevator cars 30 through 32, operation controls such as open and close control of the elevator doors, and informing controls such as activation control for in-car annunciators 15 such as in-car displays and in-car audible informing units and at-landing annunciators 16 for respective elevator cars such as hall lanterns and chimes.

Further, the hall call registering units 12 at respective floors are second hall call registering units provided at the respective common floors, and usually play the same role as the hall call registering units 11 and perform the identical control as the hall call registering units 11. Still further, the call assignment rule resetting unit 2 is connected to the group supervisory control unit 10 via a signal transmission channel 6 and performs resetting of control rules relating to such as call assignment method, batch assignment plan creating method and control data learning method according to the present invention which will be explained later.

Fig.2 is a block diagram showing a software constitution of the group supervisory control unit 10.

In Fig.2, PG10 is an operation control program, PG20 a communication program, PG30 a learning control program, and SF10 through SF14 and SF21 through SF22 are several kinds of tables necessary for the elevator control.

As shown in Fig.2, the software in the group supervisory control unit 10 includes a call assignment specification table SF22 containing one relating to a hall call assignment control, an operation control specification table SF14 set according to data scheduled or collected depending upon the past operating experience and an elevator specification table SF13 containing such as number of elevators under the group supervisory and the speed thereof, and is further provided with the operation control program PG10 which, based on the information from these tables, directly performs processings of operation controls and informing controls with respect to such as assignment for newly generated calls, reassignment, additional assignment, an advance dispatching for floors estimated of crowding and distributed standing-by elevators, and performs a group supervisory operation control for elevators.

Input information to the operation control program PG10 includes data such as elevator position, traveling direction, registered car calls and in-car load which were transmitted from the elevator car control units 20 through 22 via a transmission channel L11 and signals transmitted from the hall call registering units 11 at respective floors via a transmission channel L12, and these data are once stored in the elevator control data table SF11 and the hall call table SF12 respectively and then used via the control program PG10.

Further, calculated values and assignment signals, which are the outputs from the operation control program GP10 and necessary for the batch call assignment, are stored in the call assignment control table SF10, are transmitted by a transmission means via the transmission channel L11 to the respective elevator car control units 20 through 22 as commands and activate the at-landing annunciators 16 provided at the respective landings of the corresponding floors to inform serving elevators.

Still further, these signals are recorded at the control condition recording table SF21 while being associated with the condition for every batch call assignment, corresponding result and the control result, the traffic demand at the moment and the control condition of the respective elevators in order to provide the same to the learning control program PG30 which performs a learning control for realizing a further improving batch call assignment.

The communication program PG20 communicates with the call assignment rule resetting unit 2 via the transmission channel 6. Further, the communication program PG20 resets the control target values, learning rules and parameters on the learning control program PG30 based on the received data as well as resets control rules and multipliers on the specification tables SF14 and SF22.

Still further, the communication program PG20 performs a processing of transmitting regularly, periodically or at request the data such as on the control condition recording table SF21, operation control specification table SF14 and call assignment specification table SF22 as necessary information on which a supervisor or a brain software in the control device correctly recognizes the situation of the group supervisory system and judges the resetting indicated above.

Fig.3 is a diagram for explaining a constitution of the tables which the group supervisory control unit 10 ulilizes.

As illustrated in the drawing, the tables which the group supervisory control unit 10 utilizes are constituted by eight tables, in that, the call assignment control table SF10, the elevator control data table SF11, the hall call table SF12, the operation control specification table SF14, the work condition recording table SF210, tables SF211 through SF219 separated by traffic flow modes which record servicing states separated by traffic demand modes and target values and parameters for learning, and the call assignment specification table SF22.

The control condition recording table SF21 is one which includes the above described work condition recording table SF210 and the tables SF211 through SF219 separated by traffic flow modes.

The data on the operation control specification table SF14 and the elevator control data table SF11 are used for preparing fundamental data such as base arrival estimated time table ARIVT1 which are used in the evaluation value calculation processing for the call assignment and these data are beforehand stored in the control table SF10.

The programs PG10, PG20 and PG30 are respectively constituted while being divided into a plurality of tasks depending upon the necessity and are supervised under a system program, namely, operating system (OS) for performing an efficient control. Accordingly, the starting of these respective programs is effected correctly and regularly from a system timer or freely from other programs.

Fig.4 is a flowchart for explaining the total performance and processing of the operation control program. Hereinbelow, the total performance in the operation control is explained with reference to the flowchart.

Further, in the flowchart, for convenience of explanation, an example not using OS is illustrated.

Still further, the present operation program E5 is designed to be started after turning on the power source or by restarting.

(1) Firstly, an initial processing such as clearing processing of such as the call assignment control table SF10 and the hall call table SF12 is executed (step E10).

(2) Hall calls at all floors which have been fetched via the transmission channel L12 are stored on the hall call input table XHBT in the hall call table SF12.

Further, in response to this call input a call registration control processing including such as judgement of acceptance or non-acceptance of the hall call registration and resetting after service completion is executed by judging service conditions of the respective elevators (step E20).

(3) Data from the elevator car control units are fetched via the transmission channel Lll and are then stored on the elevator control data table SF11 (step E30).

(4) A traffic demand mode for the present operation is discriminated and based on the discrimination a service supervisory method and a hall call assignment rule are selected (step E35).

(5) According to the hall call table SF12, the elevator specification table SF13, operation control specification table SF14 which has been set depending upon respective traffic demand modes or time zones or adjusted based on an automatic learning and the traffic mode of the current operation discriminated in step E35, number of passengers at the time of the elevator arrival is calculated by estimation and further such as estimated crowdness WGT, estimated second arrival time ARIVT2 which is determined when assuming traveling direction reversal at an intermediate way, estimated possible hall call from a crowded floor in near future with a high probability and hall call assignment are prepared, and these data are stored on the call assignment control table SF10 (step E37).

(6) A batch call assignment control processing according to the present invention is executed following the processing flow illustrated in Fig.5, which will be explained in detail below, by making use of the several kinds of data values obtained in the respective steps explained above , This control processing has advantages of a high processing effeciency and a short processing time (step E40).

(7) At the completion of servicing after executing a call assignment at step E40, recording on control condition tables for respective groups as illustrated in Fig.19 is completed. Further, a learning processing is executed based on data in the tables SF210 and SF211 through SF219 such as learning target values on control target value table T231 in Fig. 11 which is set as a part of the learning program PG30 of which specific example is shown in Fig.21 and Fig.22, and the parameters in the operation control specification table SF14 and the call assignment specification table SF22 are automatically corrected (step E45).

(8) Informing and announcing processings such as on contents of the current control, services relating to elevators such as arrival informing and information in the building are performed (step E50).

(9) A servicing elevator reviewing request is effected for an already assigned hall call of which estimated in-car crowdness at the time of arrival execeeds an in-car crowdness limiting value WGC(k) and the crowdness control is continuously performed.

Further, a reassignment request is issued with regard to an elevator car which is shifted to an exclusive operation or to a maintenance operation and a call experiencing an extremely long waiting time due to such as generation of great many car calls and loading and unloading (step E60).

(10) The other service supervisory control processings such as operation of distributing elevators and adjustment of elevator departure interval from a lobby floor are performed and then the processings return to step E20 (step 70).

The processings from step E20 to step E70 as explained are repeatedly executed until the power source is shut down or a program abnormality is generated, thereby, the group supervisory operation control containing the batch call assignment according to the present invention is executed.

Fig.10 is a diagram for explaining the constitution of a call assignment evaluation parameter table and a call assignment rule selection table.

The call assignment evaluation parameter table T100 is constituted as illustrated in Fig.10(a) which is used for setting call assignment evaluation parameters for every call assignment, and the call assignment rule selection table T200 is constituted as illustrated in Fig.10(b).

In Fig.l0(a) and Fig.10(b), a typical conventional call assignment method is provided as rule 8 in which a call assignment control is executed so as to minimize the maximum waiting time. With this provision, the elevator control can be temporarily switched to the conventional control method thereby the excellence of the control method according to the present invention can be advantageously detected and demonstrated.

In one embodiment according to the present invention which will be explained hereinbelow, an example of controls is explained wherein hall calls and port calls from floors occupied mostly by executive suites, reception rooms and conference rooms and from floors having a high frequency use occupied such as by lobby and restaurants are treated as call kind R having the highest priority, and calls from a high floor zone H, an intermediate floor zone M and a low floor zone L which are respectively occupied by ordinary offices are treated as call kinds having non-priority. Further, in the present embodiment, the priority is different between respective floor zones so that rules are selected based on the traffic demand modes and the floor zones, and the elevator control is designed to achieve a target value determined for every call kind without causing significant reduction of the total operation efficiency.

The evaluation parameter table T100 as illustrated in Fig. 10(a) wherein respective parameter values for the respective rules are set is prepared or corrected artificially or by the automatic learning function through the above explained step E45 based on the past learning data. Further, in the present example, as illustrated in Fig.l0(a), the call kinds are pricipally set according to the floor zones so as not to cause service unbalance such as by passing due to filled passengers depending on the traffic demand at respective moments, and the table T200, which is designed to select kinds of assignment rules based on the traffic demands and the kinds of call to be assigned, is prepared.

In one embodiment according to the present invention, for example, in a time zone wherein the traffic demand is small, the traffic demand mode of not busy is selected through the above explained step E35, and then, through the processing at step P615 in Fig.8 and at step P715 in Fig.9 which will be explained in detail below, rule 7 can be selected which executes a control putting priority on crowdness which is designed to possibly prevent passangers boarding in a same car and to allow passengers to use an elevator in a sense of using a taxi not in a bus like sense which is experienced at an ordinary time zone.

For this reason, in rule 7 crowdness limiting value WG1 is set at 0(%). Further, in the present embodiment when a rule for performing a third person's evaluation is selected through step P715 in Fig.9 which will be explained later, the selection is performed not by the kind of call to be assigned but by the kind of call to be evaluated.

As seen from rule 8 in the table T100, elevators are conventionally selected based on two standards, in that, waiting time evaluation at a hall determined by K2=0 and T1=0, and passenger full judgement determined by WGl=80, contrary thereto, according to the rule 7 for the present embodiment of the present invention, evaluation is performed by putting priority on crowdness, thereby a selected elevator can be limited to one having no load.

According to the present embodiment of the present invention, passenger boarding on a same elevator car is eliminated and as a result the boarding time is also shortened, thereby an extremely desirable service in a sense of psychology and time can be provided for passengers. However, in the present case, during a time zone wherein there is a comparatively large traffic demand and there are few elevators having no load, passengers have to wait at a lobby floor for a long time until there appears an empty elevator.For overcoming the above problem, according to one embodiment of the present invention, rule 2 which jointly uses two evaluation standards of the first person's waiting time and the priority on crowdness as illustrated on the row of call kind R in the column of the normal traffic demand mode is selected for calls from a lobby floor in day time and priority calls from VIP by phone and the corresponding control can be performed via call assignment programs G25 and G60 in Fig.7 which will be explained later.

Further, according to one embodiment of the present invention, for evaluation of hall calls from a low zone L belonging to non-priority zone during not-busy time zone, rule 1 executing a multi target control is selected in which multi evaluation items such as waiting time, in-car crowdness, boarding time, balancing degree (desirability of time interval between respective mutual elevators), empty car preservation rate, energy saving and reservation alternation occurrence probability are controlled in a good balance.

The present embodiment according to the present invention has a characteristic in which the parameters T1 and T2 are newly provided for the standard multi target control as explained above and the function of controlling the empty car preserving rate is added and evaluated.

Further, according to one embodiment of the present invention, rule 5 is selected which executes a control putting an intermediate priority on other floors for calls from the intermediate floor zone during normal time and wherein the crowdness limiting value WG1 is set at 70(%) for including comparatively crowded elevators as selectable elevators. Further, for an elevator in operation of which waiting time in response to a hall call is short, the waiting standard value T1, which represents selection suppressing, is set at 40sec. in view of a high possibility of waiting passengers at other floors.

Further, in this instance, the reverse interruption service suppressing value T2, which limits selection of elevators of which traveling direction has to be reversed, is set at 60sec., thereby elevator reversing of the traveling direction at non-priority floor zone is suppressed. Through these controls a probability of maintaining elevators which can serve the upper floor zone is increased. Further, 100(%) of third person's evaluation degree value K1, which represents rate of consideration shared for the already assigned hall calls, indicates that an equivalent consideration as to the evaluation for hall calls to be assigned is given to the third person's evaluation with regard to waiting time, and 0(%) thereof indicates no consideration is given to the third person's evaluation.For example, for an assignment to calls from a lobby and other floors belonging to the call kind R having priority, K1 is set at 40(%) via step P615 in Fig.8, which will be explained later, and an elevator is selected by putting an importance on the call kind R to be treated with priority while giving relatively a small consideration on other already assigned hall calls.

According to the present embodiment of the present invention, as a possible result, hall calls from a non-priority floor zone likely experiences a long waiting time, and some times the serviceable elevator can be altered via reassignment control for preventing crowdedness because of boarding passengers relating to priority calls. Namely, when many boarding passengers board from the floor having priority and the estimated in-car crowdness for the already assigned hall call at its arrival exceeds the in-car crowdness limiting value WG1 set at 40(%), a reassignment request as explained above is issued via step E60 in Fig.4.

Further, according to the present embodiment of the present invention, a service supervision is performed at step E70 as explained above in which starting of elevators at starting floors such as a lobby floor and a floor for restaurants is prevented until an assigned hall call appears of which estimated waiting time determined by summing an estimated arrival time and a hall call continuing time exceeds the waiting time standard value T1. The boarding time evaluation degree value K2 with regard to waiting time is a coefficient for obtaining an evaluation value converting the boarding time evaluation into a waiting time evaluation value, accordingly, in a group supervisory control device for elevators having about 15 service floors and 4 elevator ducts, K2 of about 60(%) indicates that the boarding time is evaluated substantially equivalent with the hall call continuing time.

Fig.S is a flowchart illustrating in detail of the call assignment processing at step E40 in the flowchart shown in Fig.4. In this flowchart, an example of the assignment processings is explained when a special priority call is registered which can be registered by a person bearing a special key or a specified person via phone.

(1) Initial value setting of loop variables with regard to directions and floors is performed in order to repeatedly execute the call assignment processing for upward and downward calls of all floors (step F10).

(2) Initial setting of a loop variable m is performed in order to execute a loop processing for the four kinds of calls (step F40).

(3) Judgement whether call assignment requests exist for the loop variables set and the call kinds set, and when judged no requests exist, the process moves to the processing at step F70 which will be explained later (step 50).

(4) When judgement at step F50 indicates that there exists a call assignment request, a call assignment processing at step S40, detail of which will be explained with reference to Fig.5, is initiated and the call assignment is effected (step S40).

(5) In response to the processing result at step S40, it is judged whether the immediate reservation informing has to be effected with regard to the elevator service for the newly generated hall call and when it is judged the immediate reservation informing is unnecessary, the process moves to the processing at step F70 which will be explained later (step F62).

(6) As a result of the judgement at step F62, it is judged that the immediate reservation informing is necessary, an immediate reservation informing command is directly prepared, and the command activating such as the passage way display units 14 at respective floors and the audible landing informing units 13 at respective floors is outputted via the transmission channel L12 as well as a processing for recording the assignment on the reservation informing table in the table SF10 is performed (step F64).

(7) After completion of step F64 or when the judgement at step F50 or F62 is NO, it is judged whether the processings at steps F50 through F60 have been completed for all kinds of calls and when it is judged not completed, the loop variable with regard to kinds of calls is renewed and the processings from step F50 are repeatedly executed (steps F70 and F75).

When the judgement at step F70 indicates that the processings at steps F50 through F60 have been completed for all kinds of calls, it is further judged whether the processings have been completed for all floors, and when it is judged completed, the present processing completes, and if judged not completed, the loop variable, with regard to floor and direction are renewed and the processings starting from F40 are repeatedly executed (steps F80 and F90).

In the example of the call assignment processing explained above, the total number of the loop variable with regard to kinds of calls is assumed as 4, therefore, through step F70 wherein completion of total loop is judged with m=3 and step F75 wherein a renewal of the loop variable m is performed, the judgement processing on call assignment request at step F50 is performed 4 times, in that m=O ~ 3, for the same floor. Accordingly, when there are a plurality of calls to be assigned having different kinds of calls at a same floor, necessity of a call assignment is judged at step F50 for every kind of calls and the initiation of the call assignment processing at step S40 is subsequently effected.

Further, in steps F50 through F64, at first with m=0 priority call R is selected and the processings therefor are executed, thereafter with m=l general calls at lower zone L, with m=2 general calls at intermediate zone M and with m=3 general calls at upper zone H are selected and the processings thereof are respectively executed.

Thereafter, at step P615 in Fig.8 and step P715 in Fig.9, which will be explained later, one of the rules DRNo is selected according to the traffic demand at respective moments and the kind of calls m, and the call assignment evaluation parameters are set as explained with reference to Fig.10.

In a case of an elevator installation having many number of elevators and having slight occasions of passing due to filled passengers, the necessity of classifying the kinds of calls depending on the floor zones is low, therefore it is effective when elevators are classifyed in such a manner that when hall call buttons near the passage way are pressed elevator cars having a short waiting time are selected and when hall call buttons remote from the passage way on the same floor are pressed empty elevator cars are selected. This method can be easily realized by resetting the rule selection table T200 and the call assignment evaluation parameter table T100 depending on number of kinds of calls required.

Further, in the processing flow illustrated in Fig.S, steps F10, F80 and F90 are processings which sequentially effect the call assignment processings for upward and downward calls of all floors. Further, at step F50, it is judged whether there exist assignment request calls for the respective kinds of calls at respective floors. This judgement is performed by incorporating execution of similar processings as at step P615 in Fig.8 at step F50 by further expanding the table indicating call assignment method as illustrated in Fig.10 and by setting rules how to judge depending on time zone, traffic demand and kinds of calls.

Further, the above processing can be one for selecting only calls requiring assignment, for judging existence or non-existence of newly generated hall calls or for simply judging existence or non-existence of registered calls, and in which a judgement method is determined according to the batch call assignment method, a review thereof due to frequent generation of hall calls experiencing a long waiting time and generation of in-car crowdness and selection of an additional assignment method, and which are set on the rule and parameter tables.

When there is a call assignment request at step F50, the call assignment processing at step S40 is performed and an optimum elevator car is selected. Thereafter, it is judged at step F80 whether the processings have been completed for all of the floors, and if judged not completed the loop variable (jn, in) is renewed at step F90 and the process returns to step F40 and the judgement at step F50 and the assignment processing at S40 are likely repeatedly executed until processings for all of the floors have been completed.

With the processings at step F10 through step F80 in Fig.5, it is searched whether the batch call assignment is to be applied by renewing sequentially not only the kinds of calls but also floors. As illustrated in detail as a specific embodiment in Fig.6 the batch call assignment explained with reference to Fig.l3 through Fig.18 is executed only once, and when an individual call assignment of selecting an assigned elevator car as illustrated in Fig.7 is continued, the step F60 is repeatedly initiated via step S40.

Further, it is judged at step F62 whether the immediate reservation informing has to be effected about the serving elevator for a newly generated hall call, and if the judgement is YES, an immediate reservation informing command is directly prepared at step F64 and the command for activating such as the passage way display units 14 at respective floors and the audible landing informing unit 13 at respective floors is output via the transmission channel L12. Still further, at this moment, the processing of recording the assignment on the reservation informing hall call table in the table SF10 is performed.

Fig.6 is a flowchart of the batch call assignment processing illustrating the detail of the call assignment processing at step S40 shown in Fig.5. Hereinbelow, the flowchart of Fig.6 is explained.

(1) It is judged at step S405 whether the condition for performing the batch call assignment is fulfilled.

This judgement is effected, for example, by judging whether the call to be assigned is one from a crowded floor and whether there remains a room in the processing capacity of the microprocessor in the group supervisory control unit 10 (step S405).

(2) When the judgement at step S405 indicates that neither conditions are fulfilled, an individual assignment processing is executed without choice wherein an assignable elevator car selection processing, a recording of the floor, the kind of the call (floor zone), the evaluation values of assignment parameters, assigned elevator car and date, and transmission of the assignment data are respectively performed (steps F60, S480 and S485).

The batch call assignment according to the present invention requires a great many processing time in proportion to the crowdness, such that the batch call assignment during crowded time is executed only for important calls. Further, the following step S410 can be constituted in such a manner that even in the above instance, only the calls having a high priority are selected and a batch call assignment is executed therefor, and an individual call assignment is applied for registration of general hall calls and reassignment or the assignment and the reservation informing are deferred until there appears a room in the load rate.

For example, by adding a judgement on call registration lapse time the present step can be further improved in such a way that an individual call assignment is applied for general hall calls and calls experiencing a comparatively long waiting time, and for hall calls shortly after registration and experiencing a short waiting time a batch call assignment is applied when there appears a room in the load rate of the microprocessor.

(3) When it is judged at step S405 that the batch call assignment condition is fulfilled, at first, a batch call assignment group is set and a variable clearing processing is executed wherein a group variable g is set at 0 (step S410).

(4) For calls to be assigned within respective groups g a plurality set of possible batch call assignment plans are prepared, the respective plans are evaluated and the best batch call assignment plan is selected. Thereafter, the batch call assignment is recorded and executed (steps S420, S430 and S450).

(5) Renewal of the group variable g and completion for all of the groups are judged with g=AGN, when the processings for all of the groups have not been completed, the processings starting from step S420 are repeatedly executed, and when the processings for all of the groups have been completed, the data for the table shown in Fig.17 and the work table data for preparing Fig. 19 are inclusively recorded at T4 in the table SF210 for preparing later improvement by learning. Further, the transmission of the batch call assignment results to the respective elevator cars is requested (steps S460 and S470).

Fig.7 is a flowchart illustrating the details of the assignable elevator car selection processing in step F60 as shown in Fig.6. In Fig.7, steps G10 and G110 are processings for repeatedly performing the respective processings for all of the elevator cars. Further, in the present processings, an intial processing also can be performed wherein the respective kinds of evaluation value tables are cleared for determining such as a maximum third person's waiting time evaluation value HTM2 (k, a) through successive processings in step P720 or an upper limit value is set at a work SWK which is necessary when the best elevator car is successively selected and processed at step Gull.

(1) At first, it is judged whether the assignment of a hall call of a floor in and a traveling direction jn is allowable for an elevator car k (step G20).

(2) When it is judged at step G20 that the elevator car k is one rejecting allowance of a new or additional call assignment, an upper limit value is set on the first person's waiting time evaluation value HTMl(k, a) or the total evaluation value (k) for the elevator car k and the processings move to those for next elevator car (steps G90, G100 and G110).

(3) When it is judged at step G20 that the assignment is allowed for the elevator car k, a calculation processing of a first person's evaluation value for the registered hall call to be assigned is performed and a first person's total evaluation value Pl(k) is determined (step G25).

(4) Likely, a third person's evaluation value for the already assigned hall call, namely which represents an evaluation for the hall call which is already assigned to the elevator car k and for an in-car call from a passenger in the car, is calculated and a third person's total evaluation value P2(k) is determined (step G60).

(5) A weighted evaluation value of the first person's and third person's total evaluation values is prepared, and further, multi target total evaluation values (k) for the respective elevator cars are prepared. It is judged whether the processings for all of the elevator cars k are completed, and when judged not completed the processings starting from step G20 are repeatedly executed (steps G80, G90 and GllO).

(6) When the processings at step G20 through step G90 for all of the elevator cars have been completed, judgement on the condition of the assigned elevator car is performed based on the obtained total evaluation value (k) (step G120).

(7) Based on the condition judgement at step G120, the total evaluation values (k) for all of the elevator cars are calculated, then an elevator car having a minimum total evaluation value is selected as an assignable elevator car and is judged whether the assignable elevator car allows the assignment and the service informing, and when there exists such elevator car, an usual assignment is executed and the service informing is allowed (step G125).

(8) When it is judged that a reservation altering possibility is high because the total evaluation value (k) of the selected elevator car based on the condition judgement at step G120 is no good, the assignment is made to a floor at which the elevator car is under acceleration, or because it may be judged that the assigned elevator car is crowded since the estimated in-car crowdness is comparatively high, the elevator assignment is simply effected and the service informing thereof is limited (step G130).

(9) When the condition judgement at step G120 reveals that evaluation values for all of the elevator cars exceed a predetermined value or exceed the upper limit value set at step G100, an assignable elevator car can not be decided. In such instance, generation of a call assignment deferring is recorded and reassignment request is issued. Further, such content is recorded not on a work area for transmission use but on such as an IC card which can be safely kept (step Gl4O).

Thereafter, not only the total evaluation value (k) but also such as respective evaluation parameter values, kinds of hall calls, floors, traveling directions, assigned elevator car number, non-assigned elevator car number and date are temporarily recorded, and further the assignment data is transmitted to proper apparatuses requiring such data such as the elevator car control units and annunciators. Still further, the assignment record, which is temporarily recorded as explained above, is sometimes transmitted to maintenance units.

Fig.8 is a flowchart for explaining the details of the first person's evaluation value calculation processing in step G25 shown in Fig.7. Hereinafter, the flowchart in Fig.8 is explained.

(1) Based on the kind of a newly generated hall call and the traffic demand characteristic mode one of call assignment rules is selected among the rule selection table T200 as illustrated in Fig.lO(b), and then based on the selected rule respective parameters for the first person's evaluation use are prepared according to the evaluation parameter table T100 as illustrated in Fig.10(a). In the present embodiment, it is assumed that the upper floors are occupied such as by hotels, schools, and condominiums, such that kinds of calls are classified in view of specific floors and floor zones.However, in case of an ordinary office building it is enough if an ordinary call can be distinguished over calls bearing special purposes such as a call for an elevator designed for wheel chairs, a call for an elevator serving for specified floors, a priority call only manageable by specified persons, a call for an empty elevator and a call designating destination from a register unit at landing (hereinafter called as port call).

Namely, in the processing at the present step, one of call assignment rules DRNo. is selected among the call assignment selection table T200 illustrated in Fig.l0(b) based on the traffic demand mode for operation use which has been discriminated at step E35 shown in Fig.4 and the kind (herein, determined by floor zones) of the call to be assigned such as a call newly generated, a call with no fixed assignment and a call of which serving elevator informing is deferred, the evaluation coefficient values associated with the kind of already assigned call and the floor zone are read out for every third person's call from the call assignment evaluation parameter table T100, and then evaluation parameters K1, K2, WG1, T1 and T2 for the first person are set.

For example, in a building with no restaurants or in a building wherein restaurants are used through the lobby floor, the traffic demand mode in the former half of lunch time is excessive downwarding. At this moment, the first person's evaluation value with regard to a call to be assigned belonging to the upper floor zone H selects rule DRNo.6 putting a high priority on other floors from the call assignment rule selection table T200 and the parameters such as K1=50% provided for rule 6 in the call assignment parameter table T100 are set as the evaluation parameters. Thereby, other already informed call is evaluated with a slight priority in comparison with a newly generated call.

As a result, downwarding hall calls from lower floors can not be neglected at which passings due to filled passengers were likely generated successively, accordingly an elevator service having a good balance can be provided. Further, since the hall call assignment putting an importance on hall calls from the intermediate zone and the lower zone rather than ones from the upper zone is selected, for calls from the upper zone elevators locating comparatively remote therefrom are likely to serve therefor, instead, an elevator which is trying to respond to a call from an intermediate zone reverses its traveling direction at its midway without responding calls from the upper floor zone and efficiently serves for passengers at the intermediate floor zone and the lower floor zone.As a result, one cycle time of the elevators are shortened, thereby transport capacity per unit time is improved as well as the average waiting time is shortened (step 615).

(2) A first person's waiting time evaluation value HTM1 is determined according to equation (5), which will be explained later, and is stored in a good order on an array of HTMl(k, a) in a work table. When selecting an elevator for an assignment in response to an ordinary new hall call a=O is set (step P620).

(3) In the present embodiment, a priority is given for specified floors such as a lobby floor, a floor for restaurants and a floor for executive offices at the upper floor zone, an evaluation value TURNl(k, a) representing suppression of an interrupting operation causing a midway traveling direction reversal is determined for floor zones having a low priority. For this purpose, it is judged at first whether the direction of a call to be assigned coincides with the traveling direction of a possible elevator and when judged not coincides, the reversing interruption suppressing evaluation value TURNl(k, a) is provided with the evaluation parameter T2 for suppressing a reversing interruption (steps P625 and P635).

(4) When it is judged at step P625 that the direction of the call to be assigned coincides with the traveling direction of the elevator, the reversing interruption suppressing evaluation value TURNl(k, a) is set at 0 (step P630).

(5) The evaluation values determined at steps P625, P630 and P635 increase depending upon the increase of the evaluation parameter T2, and the first person's total evaluation value Pl(k) determined according to equation (8), which will be explained later, increases so that HCR (high call return) and LCR (low call return) are correspondingly suppressed. As a result, the suppressing effect of assigning new calls is increased for a remoto elevator traveling in the opposite direction and for an elevator traveling in the opposite direction which is ready to reverse its traveling direction at midway thereof immediately before the important floor as explained above.

(6) A first person's crowdness evaluation value WG1 and a first person's boarding time evaluation value CTM1 are determined (steps P640 and P650).

(7) Based on the respective evaluation items determined at steps P640 and P650, first person's total evaluation values Pl(k) for respective elevator cars are determined and are stored successively in an array of Pl(k) for determining a first person's transport capacity.

Further, calculation methods of the respective evaluation values are explained later. Still further, the loop variable k used here for the array table is set at step G10 and reset at step G110 as shown in Fig.7 (steps P655 and P670).

Fig.9 is a flowchart for explaining the details of the preparation processing of the third person's evaluation values at step G60 in Fig.7, through which processing the respective kinds of evaluations for third person's calls through hall calls, car calls and port calls all of which are already assigned to a designated elevator car k are determined. In the illustrated flowchart of the third persons evaluation value preparation processing, the steps P705 and P780 are ones for repeatedly executing the already assigned calls wherein at step P705 an initial processing is performed and at step P780 a renewal of the loop variables jd, id and a completion judgement of the loop variables are performed for ensuring completion of the processings.

(1) It is judged whether there is an already assigned hall call in ij direction and for id floor among any kinds of hall calls for the elevator car k, namely, it is judged whether there exists a waiting third person at any landings (step P710).

When it is judged at step P710 that there exists a waiting third person at any landings, similar processings as those for the first person's evaluation value preparation as explained in Fig.8 are performed at steps P715 through P750-. At this instant, since it is unclear that the number of the third person is one or more, the number is assumed as x and number from 0 to x-l is used for the array a. Further, as an example of modifications the maximum values of the respective evaluation items can be used as the third person's evaluation values without preparing the array a and by successively maintaining the maximum evaluation values for passenger number x in the steps determining the respective evaluation values.

(2) One of the call assignment rules is selected from the call assignment rule selection table T200 based on the current traffic demand mode and the kind of already assigned call (in the present embodiment, the floor zone) and the evaluation coefficient values corresponding to the kinds of call and floor zones of already assigned hall calls are read out for every third person's call from the call assignment evaluation parameter table T100 to set the third parson's parameters K1', K2', WG1', T1' and T2'.For example, during a traffic demand mode of excessively downwarding at the former half of lunch time, the evaluation of already assigned calls of the kind belonging to the intermediate floor zone M selects rule 5 putting a medium priority on other floors among the assignment rule selection table T200 and sets constants such as the evaluation parameter K1'=40(%) which are set for the rule 5 according to the call assignment evaluation parameter table T100.

Thereby, the corresponding calls informed of their servicing are evaluated in a good balance with newly generated calls or other calls (step P715).

(3) The third person's waiting time evaluation value HTM2(k, a) is determined according to equation (9), which will be explained later, and the results are stored in a good order on the array (k, a) of the work table (step P720).

(4) In the present embodiment, in order to execute a control of putting priority on midway reversing assignment and to reduce one cycle time of an elevator as well as to improve a transport capacity, the third person's evaluation value putting priority on reversing interruption TURN2(k, a) is prepared. For this purpose, at first, it is judged whether the direction of a hall call to be assigned coincides with the direction of an already assigned hall call and when judged not coincides, the third person's evaluation value suppressing reversing interruption TURN2(k, a) is provided with the reversing interruption parameter T2' in order to suppress the third person's reversing interruption (steps P725 and P735).

(5) When it is judged at step P725 that the direction of the call to be assigned coincides with that of the already assigned call, the third person's evaluation value suppressing reversing interruption TURN2(k, a) is set at 0 (step P730).

The evaluation values determined at steps P725, P730 and P735 increase dependent upon the increased value of the reversing interruption parameter T2', a traveling direction reversal is effected with priority for elevator cars having already assigned calls many of which traveling direction is opposite to that of a call to be assigned, and other elevator cars having already assigned calls many of which traveling direction is identical to that of the call to be assigned are selected with priority for servicing.

(6) The third person's crowdness evaluation value WG2(k, a) is determined according to equation (10), which will be explained later, as well as the third person's boarding time evaluation value CTM2(k, a) is obtained according to equation (11), which will also be explained later, and further, number of boarding third persons is accumulated (steps P740, P750 and P755).

(7) After judging whether there are an already registered car call and an already boarded port call, third person's in-car servicing evaluation value P2C(k, c) is prepared, wherein c represents an array variable for recording the number of in-car passengers (steps P760 and P765).

(8) Based on these evaluation items calculation according to equation (13) is performed and the third person's total evaluation values P2(k) for respective elevator cars are determined. Further, grand total evaluation values (k) for the respective elevator cars are determined based on the first person's total evaluation values Pl(k) and the third person's total evaluation values P2(k) determined for the respective elevator cars. When there exist no third persons, a first person's total evaluation value Pl(k) determined while assuming that a hall call to be assigned is assigned to a specified elevator car (k) is used as the grand total evaluation value (k) for the specified elevator car k (steps P760 and P795).

At step G120 shown in Fig.7, the grand total evaluation values for the respective elevator cars determined as explained above are compared by making use of the work SWK, and an elevator car having a minmum grand toatl evaluation value is selected, and which is then assigned to the hall call to be assigned at step G125 or step G130, thereafter, the transmission request of the assignment to the corresponding elevator car control unit is issued and the corresponding signal is transmitted to the elevator car control unit at step E30 shown in Fig.4 to thereby complete the elevator selection control for assigning to a series of hall calls.

Hereinafter, several kinds of evaluations which are necessary for determining the total evaluation are explained, wherein symbols used throughout the following equations respectively represent the following meanings ; a : number of calls to be assigned for the respective elevator cars b : number of registered car calls for the respective elevator cars d : supplementary symbol for denoting the floor and direction of an already assigned call e : supplementary symbol for denoting an end floor in the direction of a call to be evaluated i : floor j : direction k : elevator car number m : kind of call n : supplementary symbol for denoting the floor and direction of a hall call to be assigned In a conventional art, hall calls are generally classified in such a manner that a general hall call at right side landing is designated as m=O, at left side landing as m=1, a hall call requiring wheel chairs as m=2 and a priority call registered such as via phone as m=3.

In the one embodiment of the present invention, although a first priority is placed on the transport capacity, kinds of the general calls are classified depending on their floor zones in order to realize a control for uniformalizing service conditions for the entire floors. Namely, m=3 is assigned to hall calls H from the upper floor zone, m=2 to hall calls M from the intermediate floor zone, m=1 to hall calls L from the lower floor zone and m=O to hall calls R from floors having possibility of crowded by boarding passengers such as from the lobby floor and the floor for restaurants.

Further, it is preferable to treat general calls from the floor for the restaurants other than at the lunch time zone as general hall calls L from a lower floor zone.

Hereinbelow, respective kinds of evaluation values are identified as follows First person's total evaluation value : Pl(k, a) First person's waiting time evaluation value HTMl(k, a) First person's evaluation value for suppressing reversing interruption : TURNl(k, a) First person's crowdness evaluations value WGl(k, a) First person's boarding time evaluation value CTMl(k, a) Service evaluation value for in-car passengers P2C(k, c) Further, identification of respective third person's evaluation values are similar to those corresponding to the first person's but distinguished therefrom by replacing the numeral 1 at the end thereof with numeral 2.

Now, calculation methods of the respective kinds of evaluation values, which were used in the respective processing flows explained above, are explained specifically.

The first person's waiting time evaluation value HTMl(k, a), when assuming a call is assigned to an elevator car (k), is determined according to the following equation ; HTMl(k, a)=iARIVT(k, jn, in)+ HTM(m, jn, in)-T1 -. (5) When estimating a first person's waiting time during a traffic demand wherein a possibility of an elevator traveling upto the end floor is low, it is assumed that the traveling direction of the elevator is reversed at midway HCR/LCR at a lifted floor corresponding to a last car call and an estimated arrival time ARIVTI is used.

The first person's waiting time evaluation is determined according to equation (5) as indicated above based on a time until arrival of the elevator car k to a registered floor for the hall call to be assigned, a time HTM(jn, in) already waited of the first person at the hall concerned and the waiting time standard value T1.

In the above equation, an absolute value is used, however the present invention is not limited thereto.

For example, such a control can be performed, in that, when the subtraction of the waiting time standard value T1 results in a negative value, a predetermined value T4 is further added to the absolute value, thereby an elevator car exhibiting an evaluation value below a standard value is designed hardly to be assigned to a call, or a service informing thereof or assignment itself is designed to be deferred.

Further, the crowdness evaluation value # WGl(k, a) is determined according to the following equation ; # WGl(k, a)=ll WGT(k, jn, in)-WG1 2 . (6) According to equation (6), when a value determined by subtracting the crowdness standard value WG1 from the estimated crowdness WGT(k, jn, in), when an elevator car k arrives at the called floor of jn, in, is a positive value, the first person's crowdness evaluation value # WGl(k, a) is determined by squaring the positive value or by multiplying the positive value by a predetermined coefficient K3.

Further 11 11 in the above equation indicates that when the calculation result inside the 11 11 is negative, value 0 is set therefor.

Other than the above method, when the subtraction result is negative, another method can be used in which an extremely large value is set there for which value never allows an assignment.

The first person's boarding time evaluation value CTMl(k, a) is determined according to the following equation CTMl(k, a)=K2 x [ARIVT2(k, jn, ie) - ARIVT2(k, jn, in)] -- (7) In equation (7), when jn is upwarding direction, ie represents floors having great many de-boarding passengers such as at the upper most floor, a floor in upper zone for restaurants and a junction floor.

Further, ARIVT2, which is estimated while assuming no reversal at midfloors, is used for the estimated arrival time table.

The first person's total evaluation value Pl(k, a) is determined according to the following equation based on the values determined above Pl(k, a)= HTMl(k, a)+ TURNl(k, a) + WGl(k, a)+ CTMl(k, a) -- (8) The third person's waiting time evaluation value HTM2(k, a) is determined according to the following equation HTM2(k, a)= K1' x lARIVT2(k, jd, id) + HTM(jd, id)- T1' I ... (9) Different from the first person's waiting time, when estimating the third person's waiting time, there exists a possibility that an elevator car can travel to an end floor in response to a car call which is developed from a hall call to be assigned, the estimated arrival time data ARIVT2, which is estimated with no reversal at midfloors HCR (high call return)/LCR (low call return), is used.

This data table is prepared at step E37 as shown in Fig.4.

The third person's crowdness evaluation value WG2(k, a) is determined according to the following equation WG2(k, a)=K1' x II WGT(k, jd, id)-WG1' 1l 2 (10) In equation (10), when a value determined by subtracting the crowdness standard value WG1 from the estimated crowdness WGT (k, jd, id), when the elevator car k arrives at the called floor of jd, id, is a positive value, the third person's crowdness evaluation value WG2(k, a) is determined either by squaring the positive value or by multiplying the positive value by a predetermined coefficient K3'.

The third person's boarding time evaluation value CTM2(k, a) is determined according to the following equation CTM2(k, a)= K1' x K2' x [ARIVT2(k, jd, ie) - ARIVT2(k, jd, id)] -- (11) In the above equation (11), when id is upwarding direction, ie represents a floor having great many de-boarding passengers such as at the upper most floor, a floor at upper zone for restaurants and a junction floor.

The service evaluation value P2C(k, c) for third persons who have already boarded within the car is determined according to the following equation # P2C(k, c)=K1" x [CHTM(k, jd, id) + MAX fWGT(k, jd, id) ~ WGT(k, jd, ie)}- WG1 1l 2 + K2 x fCTM(k, jd, id)+ ARIVT(k, jd, id) - ARIVT(k, jd, ic)]] (12) In the above equation (12), ic represents the floor corresponding to the current car position.Further, the waiting time at a hall until boarding of a passenger p(k, jd, id) who has registered his or her destination floor id in the boarded elevator car k during its traveling into the direction jd, the third person's evaluation rate parameter K1 corresponding to the kind of the hall call and the boarding time priority parameter K2 are recorded at step E37 in Fig.4 on a passenger information table (k, jd, id) for the called floor, on which the crowdness allowance parameter WGl is registered, at the time of the car call registration such as boarding waiting time CHTM(k, jd, id).

Based on these values, the third person's total evaluation value # P2(k) is determined according to the following equation ; # P2(k, a)=max[{# HTM2(k, a)- # TURN2(k, a) + WG2(k, a)+ CTM2(k, razz P2C(k, c)] (13) Finally, the grand total evaluation values (k) for the respective elevator cars are determined according to the following equation (k)=MAX{ Pl(k), P2(k)} (14) In general, with equation (14), a maximum value among evaluation values of individual passengers to which respective elevators have to respond is determined.

However, for an elevator selection in response to a kind of hall call with priority, another method represented by the following equation can be used (k)= Pl(k)+ P2(k) -- (15) According to equation (14), since a third person's evaluation value P2(k)=0 represents an empty elevator car, the evaluation value of an elevator car having waiting third persons and already boarded passengers increases so that selection of such elevator car is suppressed. Accordingly, a like selective function, which is executed when the rule 7 or 3 is selected, can be provided at step G120.

In the one embodiment according to the present invention, individual third waiting person's evaluation values HTM2(k, a) for already assigned hall calls of 1 ~ n are determined according to equation (9) above, total evaluation values for respective waiting passengers are determined according to equation (13) and the maximum value thereamong is determined as the third person's waiting time evaluation value P2(k) for the elevator car k.

In the one embodiment of the present invention, other than the above explained processings, the following modified method can be used, in that, after determining through sequential processings of the maximum evaluation values for the respective items of HTM2(k, a), WG2(k, a) and CTM2(k, a), the sum of the respective items is simply determined according to equation (13) as the third waiting person's total evaluation value P2(k) for the elevator car k. Further, the one embodiment of the present invention can be improved by incorporating a co-boarding probability evaluation, in that, probability having a fellow passenger, which represents desirability of servicing efficiency of the total elevators.

Still further, servicing balance evaluation values such as time interval between respective elevators and evaluation of transport passenger balance can be incorporated in the evaluation items.

JP-A-01-236178(1989), for example, discloses a group supervisory control device for elevators in which a plurality of control targets are provided and the elevators are controlled to achieve these targets through dialy learning. The above document further discloses a control method using a norm formula as a multi target decision making method.

Now, another embodiment of the present invention is explained in which the present invention is applied to a group supervisory control device for elevators performing the above explained learning control.

Fig.ll is a diagram showing a target value specification table T231 similar to that explained above which is designed for use in the learning at step E45 as explained above.

The table can be constituted in such a manner that the values thereof can be served as the target values for the operation control by incorporating the same as a part of the table T100 as explained in connection with Fig.10. Since in the present embodiment the kinds of calls are classified depending on the floor zones, in the table T231 priority is different for every floor zone to which the respective calls to be evaluated belong, such that a learning target value is determined for every floor zone. Further, when target values for every traffic demand mode are provided as in the same manner as the table T100, a learning control depending on respective elevator use conditions can be performed.

Fig. 12 is a diagram for explaining a constitution of a tearning table at that day T232 representing elevator working results at that day collected at step E45 in Fig.4 and determined by classifying, accumulating and calculating the same depending on the kinds of calls and the traffic demand modes, and of a learning table T233 representing average past elevator working results incorporating the learning values at that day.

Fig.12 shows an example of learning in which three evaluation items are learned depending on four traffic demand modes, however, in actual application, the working data including such as elevator midway reversing rate, elevator one cycle time, boarding rejection rate, reservation alternation rate, reservation non-alternation rate, first arrival rate due to car call, passing rate representing passing of waiting passenger call, long waiting rate corresponding to long waiting time locating within 5% by call number from the longest waiting time or the waiting time more than 60sec., time balancing rate of respective elevator cars and partially collected operation rate, are classified into about from 3 to 32 modes for performing learning.

Based on the working data in the learning value table T233 and the learning use target value for the corresponding traffic mode in the target value table T231 a corrective learning control is performed for the call assignment evaluation parameter table T100 and the call assignment rule table T200. Through the daily renewal of the learning value table at that day T232 and the learning table T233, learning is performed.

More specifically, the renewed learning values are subjected to a total evaluation by making use of a norm formula represented by the following equation (16) based on the target values HTi, WTi, CTi for the respective evaluation items provided at the table T231 and weight coefficients Wht, Wwt, Wct between evaluation items which are provided individually as a part (not shown) of the table SF22. In the above explanation, three evaluation items are referred to, however the respective evaluation items as illustrated in Fig.17 are actually used.

N(t)=Whtx 11 HT(t)-HTi II + Wwt x 11 WT(t)-WTi II + Wctx 1I CT(t)-CTi II - (16) When the absolute value of the norm value N(t) is larger than a predetermined value and there is an unbalancing between evaluation values for every term in the norm formula, the total evaluation judges that unsatisfaction degree is high which will be explained later with reference to a flowchart shown in Fig.22.In this instance, an improvement proposal for obtaining a good balance is created by changing the degree of improvement for the respective evaluation items, the control rule for realizing the same and the control parameter values, and is evaluated by estimating the effects thereof if the proposal is executed, and when the improving proposal is satiafactory the proposal is employed, and if not satisfactory, another improving proposal is again created and the same processings are repeated.

When a learning for improving the call assignment method itself with these learning controls is performed, an elevator operation afterward can be effected through an operation control further desirably close to the target. For example, in a conventional control method during excessive downwarding at former half of lunch time, the rule 8 as explained in connection with Fig.10 is employed for all kinds of calls and in which already reservation informed calls having maximum waiting time are searched for respective elevator cars and through comparison of these values a serviceable elevator car is selected.

In the present embodiment of the present invention, in order to achieve the waiting time target values in the table T231, rules 4, 5 and 6 are successively selected starting from the lower floor zone and set for respective floor zones to perform the call assignment, however the above rule selection is designed to be controlled automatically resetable through a learning.

Further, in the embodiment of the present invention, the respective parameter values in the evaluation parameter table T100 explained in connection with Fig.10 can be constituted so as to allow an automatic learning for achieving the above explained target at step E45 in Fig.4 of which detailed example is illustrated in Fig.22. Still further, the rule table T200 can be designed to be directly set by an elevator system supervisor or a command therefrom via the call assignment rule resetting unit 2.

Nextly, a specific example of batch call assignment control methods according to one embodiment of the present invention is explained with reference to Fig.13 through Fig.21.

Fig.13 is a flowchart for explaining an operation of a batch call assignment group setting which decides a number of batch call assignment groups and sets of calls constituting the respective groups.

(1) At first, an estimation of the current traffic demand such as number of operating elevator cars, number of registered car calls, number of registered car calls made in a short time, generation of filled passengers and generation of midway reversing is prepared and a judgement processing therefor is performed (step K105).

(2) Nextly, such as number of already registered total actual calls HCMN, number of calls to be reassigned HCNDN, number of calls not informed HCNAN due to such as reservation informing deferring and newly registered calls and number of provisionally registerable calls HCNMN which are estimated to be registered shortly based on such as judgement of a condition at a crowded floor of boarding passengers and information from a waiting passenger sensor are successively determined (steps K110 through K125).

(3) Based on the respective kinds of data determined at steps K110 through K125 and by making use of such as the day in the week of that day, the schedule, the time zone, the current traffic demand mode, number of registered calls, number of destination registered calls, basic number of calls to be assigned ASIN determined according to the following equation and in-car load, a batch call assignment method is selected (step K130).

ASIN = HCNDN + HCNAN + HCNMN (17) The followings are major examples of the batch call assignment methods one of which is selected according to step K130 above (a) A method in which only newly generated calls are treated as calls to be assigned This method is selected when a load factor for the processings by a microprocessor in the group supervisory control unit 10 is high and the load factor is further increased due to many numbers of registered calls HCMN, or when it is estimated that a batch call assignment processing will not be completed within a predetermined time. With this method, a delay time for activating a diagnosis circuit in the microprocessor and for informing reservation for a newly registered call is kept within a predetermined time, thereby irritation of the passengers and mistaken for malfunctioning are prevented.

(b) A method in which newly registered calls and provisionally registered calls are treated as calls to be assigned This method is likely selected as the above method when the landing is comparatively crowded such as represented by many number of basic calls to be assigned. With the present method substantially the same advantages as the previous method can be obtained as well as a selection of a serviceable elevator car in response to a newly registered call in view of crowded floors and informing of the serviceable elevator car are quickly performed.

(c) A method in which the basic calls represented by equation (17) are treated as calls to be assigned, and normally this method is selected (d) A method in which all of the registered calls and provisionally registered calls are treated as calls to be assigned This method is only once selected when the following conditions are newly generated, in that, when an elevator car is newly filled up by passengers under a condition that the positions of respective elevator cars are extremely lacking a balance, when an elevator car reversing at midway is caused, when an elevator car of which service call is temporarily cut off is generated, when many car calls are registered in a short time, when there appears a room for processing time and when there are no newly registered important calls which require immediate reservation.The present method, on one hand, requires a long processing time because it necessitates reviews of entire calls, however, on the other hand, it can execute in a batch from a further broader view a new call assignment and reassignment, thereby an excellent servicing control with originality, which meets the use of the building and the elevator supervisory target, can be realized.

(4) In order to determine the number of groups AGN for applying a batch call assignment processing based on the calls to be assigned which are determined according to a batch call assignment method, at first, it is judged whether number of calls to be assigned exceeds a predetermined number (in the illustrated example, 8) (step K140).

(5) When it is determined at step K140 that the number of calls to be assigned is below 8, the number of groups is determined as 1 and all of the calls to be assigned are set to be the calls belonging to the first group and to prepare ASIT(o, n) (steps K160 and K180).

(6) Further, when it is determined at step K140 that the number of calls to be assigned is over 8, the number of groups AGN is determined as AGN=(ASIN+7)/8, and all of the calls to be assigned are classified into a plurality of groups, then calls to be assigned are successively stored according to their ranks in the table of calls to be assigned ASIT(g, n) for group g which is processed first (steps K150 and K170).

In the present embodiment of the present invention, since a batch call assignment is performed in a manner as explained above, important calls are at first subjected to a batch call assignment, therefore even if such batch call assignment is performed after dividing the calls into a plurality of groups, generation of an inconvenience in which a plurality of important calls are overlappingly assigned to a single elevator car can be prevented.

Fig.14 is a flowchart of a batch call assignment plan preparation for explaining processings of preparing a plurality of batch call assignment plans for respective batch call assignment groups, Fig.lS(a) is a diagram for explaining a constitution of a batch call assignment table SF10-21 illustrating selection examples of possible serviceable elevator cars for the calls to be assigned, Fig.1S(b) is a diagram for explaining a batch call assignment plan table SF10-22 illustrating prepared batch call assignment plans. The table in Fig.15(b) illustrates examples of 14 sets of batch call assignment plans from A to N for three calls ASIN(g, n) to be assigned.

Fig.l embodiment according to the present invention illustrates three elevator cars, however, in the following an example of eight parallelly disposed elevator cars is explained.

Plan A is a basic plan wherein first through third calls to be assigned and corresponding to from n=0 to n=2 are respectively assigned to elevator cars No.l, No.4 and No.6 which are selected at the assignable elevator car selecting processing shown in Fig.7 as the optimum elevator cars for the respective calls to be assigned.

Plan B is one wherein, in contrast to the plan A, a second possible elevator car No.5 is selected for the first call to be assigned. Further, plans below C are ones wherein elevator cars of below third possibility are selected for the calls to be assigned.

When effective possible elevator cars for the first call to be assigned are exhausted at plan D, combinations setting effective possible elevator cars for the second call to be assigned are created. However, since both first and second calls to be assigned are important calls having higher ranks or calls from crowded floors of boarding passengers, a combination of selecting the same elevator car such as a combination of 2-2-6 is avoided in the processing at step K250 in a flowchart shown in Fig.14 which will be explained later. In contrast thereto, since the third call to be assigned is a general call having a low rank, combinations including the same elevator car as that for the upper rank calls to be assigned which are processed first are prepared by making use of the second possible elevator car No.3.

The above mentioned plan preparation processing is explained below with reference to Fig.14.

(1) An initial processing is performed as well as in order to ensure processings for all of the calls to be assigned the number of calls to be assigned HN(g) is set at loop processing variable n(step K205).

(2) Number of elevators to be selected as possible elevator cars is set at loop variable Q. In the present embodiment, four possible elevator cars are set for the first call to be assigned and two possible elevator cars are respectively set for the calls to be assigned below second. However, the number of possible elevator cars is not limited to that of the above example and is set separately for the first through eighth calls to be assigned according to such as the batch call assignment method and the number of working elevator cars (step K212).

(3) The selection processing of possible elevator cars to be assignable to the calls to be assigned is executed according to the processings explained with reference to Fig.7 and it is judged whether the selected elevator cars are possible elevator cars. An elevator car which is selected through step G125 in Fig.7 is judged as a proper possible elevator car. Further, an elevator car of which total evaluation value (k) is worse more than 400% of an optimum elevator car is not selected as a possible elevator car (steps F60 and K215).

(4) When no possible elevator cars can be selected at step K215, the nth call to be assigned is erased from the table for calls to be assigned (step K238).

(5) When possible elevator cars are selected at step K125, the possible elevator cars are recorded on the table SF10-21 and it is judged by making use of 2=0 whether the renewal of the loop variable 2 and the processing of the set number are completed (steps K217 and K225).

(6) When it is judged at step K225 that the processings for the set number of elevator cars are not completed, while excluding the already processed possible elevator cars, the processings from step F60 to step K225 are repeatedly executed for the remaining possible elevator cars to successively select elevator cars below second possibility (step K227).

(7) When it is judged at step K225 that the processings for all of the set number of possible elevator cars have been completed or when it is judged at step K220 that possible elevator cars more than one are selected although the number of the possible elevator cars is below the number set at step 212, it is judged whether the selected possible elevator cars are for the first call to be assigned, and when judged the selected ones are for the first call to be assigned, the possible elevator cars for the first call to be assiged are repeatedly set at the upper most row in the plan table by the times corresponding to the estimated maximum plan number as possible elevator cars for the first call to be assigned (steps K230 and K240).

(8) When it is judged at step K230 that the selected possible elevator cars are not for the first call to be assigned, it is further judged whether the call is an important one and when judged as an important call which necessitates suppression of assigning the same elevator car for the first call to be assigned, possible elevator cars for the call are stored on the plan table SF10-22(g) while eliminating combinations including the same possible elevator cars for the first call to be assigned (steps K235 and K250).

(9) When it is judged at step K235 that the call is a general one, the first and second possible elevator cars for the nth call to be assigned are respectively combined to already constituted plans to prepare plans upto the nth call (step K245).

(10) After completing the above explained processings, it is judged whether the processings for all of the calls to be assigned are completed by renewing the loop processing variable n, and when judged not completed, the processings starting from step K212 are repeatedly executed (step K255).

Further, in the above explained processings, the present embodiment of the present invention can be modified in such a manner that the plans are prepared, after completing both the loop processing at step K255 and the batch call assignment possible elevator car table.

Fig.l5(c) is a diagram illustrating an example of prepared plans in such a case when a possible elevator car for the second call to be assigned is identical to that for the first call to be assigned.

Fig.16 is a flowchart for explaining processings for evaluation and selection of batch call assignment plans in which evaluations on a plurality of batch call assignment plans are respectively executed and an optimum batch call assignment plan is selected based on their total evaluation values, and Fig.17 is a diagram for explaining the constitution of an evaluation table SF10-31(g) for respective batch call assignments in which the respective evaluation values used for the above processings are temporarily stored. Hereinbelow, the selection processing of batch call assignment plans is explained with reference to Fig.16 and Fig.17.

(1) An initial setting of a loop variable p for judging completion of plan evaluation is performed as well as other initial processings are performed (step K305).

(2) An initial processing is executed such as clearing of calculation use tables belonging to the table SF10 and storing such as number of calls and transport passengers for determining evaluation values of respective items, then such as the estimated arrival time table and the estimated in-car crowdness table, which were already prepared at step E37 explained in connection with Fig.4, are reprepared while assuming that plan p is executed (steps K310 and K315).

(3) Evaluation values of a concerned elevator car k are calculated through the processings in Fig.20, which will be explained later, and the determined evaluation values for the respective items are added on the evaluation use table for the respective items which constitutes a part (not shown) of the table SF10 (steps K320 and K330).

(4) It is judged whether the processings for all of the elevator cars are completed through renewal of the loop variable k for all of the elevator cars and with k=0, and when judged not completed, the processings starting from step K320 are repeatedly executed (step K340).

(5) A time interval of the respective elevator cars after a predetermined time (for example after 30sec.) is determined from the estimated arrival time table which is prepared at step K315 as explained above while assuming that the plan p is executed and is stored in the row of item &num;10 for time balance degree in a plan evaluation result table SF10-31(g, p). This processing can be modified so as to prepare a balancing degree which is determined by estimating one cycle time when executing the plan p and by evaluating the uniformness of the one cycle time and the uniformness of time interval based on the estimated arrival time to crowded floors such as a lobby floor (step K350).

(6) In order to evaluate the plan p, evaluation values for the respective items are determined by making use of the already determined data for the respective items through such as a weighted average value calculation and are stored in the corresponding items &num; in the plan evaluation result table SF10-3l(g, p) (step K360).

(7) A comprehensive evaluation value F(p) of the plan p is determined according to the following equation (step K370).

(8) The renewal of the loop variable p and the completion of all of the plans are judged by making use of p=O at step K380, and when judged the processings are not completed for all of the plans, the processings starting from step K310 are repeatedly executed, and when judged the processings for all of the plans are completed, a batch call assignment plan which provides the highest satisfaction is selected principally based on item &num;12 of the comprehensive evaluation value F(p) in the plan evaluation result table SF10-31(g, p) (steps K380 and K390).

Fig.18 is a flowchart for explaining an execution command of the batch call assignment and its recording processings and Fig.l9 is a diagram for explaining a constitution of the record table SF2lO-T4. Hereinbelow, the execution command of the batch call assignment and the recording processing thereof are explained.

(1) When a batch call assignment is executed, common operating conditions such as the time, traffic demand mode and characteristic, traffic volume, the position, traveling direction and in-car load of preceeding cars which can respond to a call, and registration state of all kinds of calls, and number of groups AGN are respectively recorded on the tables D1, D2 and D3 (step K510).

(2) In order to execute processings for all of the groups, setting of the loop processing of the group number of the batch call assignment is performed (step K520).

(3) Starting from the first call to be assigned in group g the batch call assignment conditions such as the batch call assignment rule are recorded on the table D4-1 and with regard to four plans showing desirable comprehensive evaluation values F(p) among the batch call assignment plans, the respective evaluation results illustrated in Fig.17 are recorded on the table D4-2 (steps K530 and K540).

(4) In order to execute the selected best plan, processings such as recording the plan on the assigned hall call table in the table SF10 are performed. Such data are periodically transmitted through step E30 as explained in connection with Fig.4 to the respective elevator car control units via the transmission channel Lll so that concerned elevator cars respond without delay to the respective assignment or reassignment according to the batch call assignment (step K550).

(5) An erasing processing of the assignment request table HCT in the table SF10 is executed, and renewal of the loop variable g and the processing completion for all of the plans are judged by making use of g=O, and when judged not completed the processings starting from step K530 are repeatedly executed (steps K560 and K580).

Fig.20 is a flowchart for explaining an evaluation value calculation processing of a concerned elevator car for determining evaluation values for the respective elevator cars, which is explained hereinbelow.

(1) First, in order to determine evaluation values for an elevator car k, an initial processing such as clearing of a work table used for an elevator car evaluation use is executed and a loop for the first person evaluation is set (steps K321 and K322).

(2) It is judged whether the call is a first person's evaluation call representing a call to be assigned, and when judged as the first person's evaluation call, the processings explained in connection with Fig.8 or the like are performed and evaluation data of the respective first person's evaluation items are determined (steps K323 and K324).

(3) Renewal of the first person's evaluation loop a is performed and it is judged whether the first person's call evaluations for all of the calls to be assigned are completed, and when judged not completed, the processings starting from step K323 are repeatedly executed (step K325).

(4) A calculation such as an average value calculation is executed and the evaluation values of the elevator car k are stored in the work table in the same manner as illustrated in Fig.17 (step K326).

(5) For third person's call evaluation, the processings as explained in connection with Fig.9 and the like are performed to determine third person's call evaluation values for the respective items and the number of car calls of which arrival is estimated to be prior to the reservation informed elevator car is successively counted as prior arrival time (steps K330 and K331).

(6) Number of times of third person's elevator cars passing through the assigned or already informed floor called is successively counted as the third person's passing time and number of third person's elevator cars which is estimated to arrive earlier than the first person's elevator car by a predetermined time, for example, by 15sec. is counted as the first person's passing time (steps K332 and K333).

(7) An estimated one cycle time RTT(k) of the first person's elevator car when the plan p is executed is determined and is added to the table RTT(g, p) (step K334).

(8) It is judged whether a reservation is already informed for a call to be assigned to an elevator car other than the designated elevator car and when judged as already informed, such is counted as reservation alternation time to complete the processings (steps K336 and K337).

Fig.21 is a flowchart for explaining details of a part of the processing in the learning processing E45 explained in connection with Fig.4 which is executed after completing the call assignment, and Fig.22 is a flowchart for explaining details of the learning processing K985 for changing the control method.

Hereinbelow, these processings are explained.

(1) Setting of loop processing for all of the calls is performed as well as an initial processing for a learning processing is executed (step K905).

(2) It is judged whether the service is a called service based on reset of the car call table CTM and the value on the car call continuing time table CTM or the boarding waiting time table HTM until the arrival (step K910).

(3) When it is judged at step K910 that the service is a called service, it is judged to which first calls to be assigned recorded on D4 and others in Fig.l9 the call concerned corrsponds, and a balancing degree representing degree of equal interval of car positions in a service time in view of the traveling direction of all of the elevator cars is determined and is recorded on the pertinent table such as table D4-3 (steps K920 and K930).

(4) When the called service is one for second through eighth calls to be assigned, such as the in-car crowdness at the time of arrival and the waiting time are recorded on the table D4-3 and table T232 in the tables SF211 through SF219 for respective traffic demand modes (step K940).

(5) Loop variables j, i are renewed and processing completion for all of the calls is judged with j=l and i=O, when judged not completed, the processings starting from step K910 are repeatedly executed (step K950).

(6) After 10 minutes, it is judged whether either the sum of boarding and de-boarding passengers exceeds 200 or the traffic demand mode changes and if the judgement turns to positive, a processing for preparing such as table T2 collecting the traffic demand at that day for the respective modes and processing for renewing the evaluation parameter table (a part of SF10) associated with the current operating use control method and evaluation method (steps K960 and K970).

(7) Termination of that day is judged based on the traffic demand mode and the time zone, and a learning processing on the data of the working condition is executed. Finally, a learning processing for control method alternation is performed (steps K981, K984 and K985).

Now, the learning processing on control methods at step K985 is explained with reference to Fig.22.

(1) Traffic demand modes to be relearned today are selected according to either the elevator ulilization rate or total user passenger number from the previous learning processing (step G910).

(2) It is judged whether the total satisfaction rate is high which is equivalent to an extremely good service performance for the concerned mode and represented by a desirable comprehensible evaluation value F (step G915).

(3) When the judgement at step G915 is unsatisfactory, as a first step for creating improvement proposals, a plurality set of improvement proposals for evaluation values of the respective control items are created, and further, control methods for improving the respective items are created (steps G920 and G930).

(4) The created improvement proposals are executed such as by making use of the simulation function as disclosed in JP-A-59-223673 and evaluated, and comprehensive evaluation values F for the created improvement proposals are totally evaluated by making use of such as a norm function (step G940).

(5) Satisfaction rate for the presently created improvement proposals is judged and when judged unsatisfactory, the processings starting G920 via N1 are repeatedly executed to prepare next creation (step G950).

(6) When it is judged at step G950, the total evaluation is satisfactory, the improvement on the control rule and parameters for the concerned traffic demand mode is recorded and an automatic renewal of the evaluation parameter table T100 or the call assignment selection rule table T200 is performed (step G960).

(7) It is judged whether the processings on all of the extracted traffic demand modes are completed, and when judged not completed, the processings starting from step G915 are repeatedly executed (step G970).

Fig.23 is a diagram illustrating a table SF10-22B for explaining an example for preparing assignable possible elevator cars when assigning a call from a floor crowded by boarding passengers. Hereinbelow, the example of preparing the assignable possible elevator cars is explained with reference to the drawing. The illustrated table SF10-22B is a modification of the assignable possible elevator car table SF10-21 as illustrated in Fig.15(a).

In the previous embodiment of the present invention, the plan p is prepared by combining respective elevator cars having small total evaluation value (k), however, for responding to a call from a crowded floor it is necessary to prepare a plan p through which all of the waiting passengers can be on board. For this purpose, so as not to leave any passengers a plan in which a plurality of elevator cars respond to a single call may have to be prepared.

In such circumstance, an elevator car selecting plan for responding to a call to be assigned from a crowded floor such as a floor for restaurants or lobby floor wherein about 20 passengers are actually waiting or are estimated waiting is prepared by extracting either an elevator car having possible boarding passengers estimated based on the estimated in-car passengers at the time of its arrival to the concerned crowded floor which exceeds the boarding passengers from the floor or combination of elevator cars each showing a comparatively desirable total evaluation value (k) (in the drawing for the sake of convenience estimated arrival time is illustrated) selected among combinations of elevator cars of which total possible boarding passengers exceed 20 as a possible combination.

According to the present invention as explained hitherto, a call assignment control which is excellent from a broader point of view is performed and a total servicing condition of a plurality of elevator cars is improved, as a result, the servicing performance of the elevator cars is improved.

Claims (10)

Claims

1. A group supervisory control device for elevators comprising, a plurality of elevators disposed in parallel which serve between multiplicity of floors, a call register unit which registers calls for operating a plurality of the elevators, a group supervisory control unit including a call assignment means which assigns the registered calls to a plurality of the elevators and a plurality of elevator car control units which control operation of the respective elevators in response to the assigned calls, characterized in that, said call assignment means includes a batch call assignment plan producing means which sets a plurality set of combined plans assigning one or a plurality of the elevators for one or a plurality of the respective registered calls, a batch call assignment plan selecting means which evaluates a plurality of the batch call assignment plans and selects an optimum batch call assignment plan, and means for assigning at the same time one or a plurality of the registered calls for one or a plurality of said respective elevator car control units according to the optimum batch call assignment plan.

2. A group supervisory control device for elevators according to claim 1, characterized in that, said batch call assignment plan producing means includes means for extracting calls to be assigned which selects a plurality of calls to be assigned necessitating a new assignment or a reassignment among the registered calls.

3. A group supervisory control device for elevators comprising, a plurality of elevators disposed in parallel which serve between multiplicity of floors, a call register unit which registers calls for operating a plurality of the elevators, a group supervisory control unit including a call assignment means which assigns the registered calls to a plurality of the elevators and a plurality of elevator car control units which control operation of the respective elevators in response to the assigned calls, characterized in that, said call assignment means includes a batch call assignment group setting means which divides a plurality of the calls to be assigned into a plurality of groups depending upon levels of crowded conditions, ranks of the calls, service directions and floor zones of the calls, means for sequentially performing a batch call assignment processing depending upon importance of the groups among a plurality of the batch call assignment groups, a batch call assignment plan producing means which sets a plurality set of combined plans assigning one or a plurality of the elevators for one or a plurality of the respective registered calls, a batch call assignment plan selecting means which evaluates a plurality of the batch call assignment plans and selects an optimum batch call assignment plan, and means for assigning at the same time one or a plurality of the registered calls for one or a plurality of said respective elevator car control units according to the optimum batch call assignment plan, wherein the batch call assignment is sequentially executed depending upon the order of importance of a plurality of the batch call assignment groups determined by classifing a plurality of the registered calls and the respective registered calls are assigned to one or a plurality of the elevators.

4. A group supervisory control device for elevators according to claim 3, characterized in that, said batch call assignment group setting means includes means for dividing calls to be assigned which are subjected to one batch call assignment at one time into a plurality set of groups so as to limit number of calls contained in one group within a predetermined number.

5. A group supervisory control device for elevators according to claim 3, characterized in that, said batch call assignment group setting means sets one batch call assignment group by incorporating calls to be assigned belonging to a lower priority when number of calls to be assigned belonging to a same priority is below a predetermined number and limits number of batch call assignment groups so as to keep the number of calls to be assigned contained in one batch call assignment group at the predetermined number.

6. A group supervisory control device for elevators according to one of claim 1 through claim 5, characterized in that, said batch call assignment plan producing means and call assignment means include means for judging in which level condition the respective elevators belong, to which the respective calls to be assigned are to be assigned, among an assignment deferring level characterized by one of non-supervisory, non-service call, passing due to car full, shortage of deceleration completing time, passing estimation due to car full and temporarily invalidated call, a reservation informing deferring level characterized by one of crowded floor, long waiting time estimated floor, remote floor, service suppressing zone, a selection suppressing level characterized by one of transport capacity increasing operation, servicing for crowded floor calls, servicing for priority calls and a general selection level characterized by one of multi target control, approaching elevator priority control for operation calls, passing, energy saving and high speed feeling operation, and an elevator belonging to a lower level condition is selected with priority.

7. A group supervisory control device for elevators according to one of claim 1 through claim 6, characterized in that, when a predetermined call which has been specified in advance is newly registered, an independent call assignment is applied for the predetermined call, and for the registered calls other than the predetermined call and reassignment the batch call assignment is applied.

8. A group supervisory control device for elevators according to one of claim 1 through claim 7, characterized in that, said batch call assignment plan producing means and call assignment means include a pseudo call producing means which treats calls from a crowded floors of boarding passengers as if the same had been registered, and performs a batch call assignment therefor.

9. A group supervisory control device for elevators according to one of claim 1 through claim 8, characterized in that, said batch call assignment plan selecting means determines for every batch call assignment plan a passenger evaluation value which includes at least one of a first person's evaluation value and a third person's evaluation value containing at least one of waiting time and a total evaluation value which includes an evaluation value either of a balancing degree or of a total transport capacity of the respective elevator cars in near furtre when assuming that each of the batch call assignment plans is executed, further determines a comprehensive evaluation value based on the determined two kind evaluation values, evaluates the respective batch call assignment plans and selects a single batch call assignment plan.

10. A group supervisory control device for elevators substantially as herein described with reference to and as illustrated in the accompanying drawings.