<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ep-patent-document PUBLIC "-//EPO//EP PATENT DOCUMENT 1.5//EN" "ep-patent-document-v1-5.dtd">
<ep-patent-document id="EP09727809B1" file="EP09727809NWB1.xml" lang="en" country="EP" doc-number="2261160" kind="B1" date-publ="20181024" status="n" dtd-version="ep-patent-document-v1-5">
<SDOBI lang="en"><B000><eptags><B001EP>ATBECHDEDKESFRGBGRITLILUNLSEMCPTIESILTLVFIROMKCY..TRBGCZEEHUPLSK..HRIS..MTNO........................</B001EP><B005EP>J</B005EP><B007EP>BDM Ver 0.1.63 (23 May 2017) -  2100000/0</B007EP></eptags></B000><B100><B110>2261160</B110><B120><B121>EUROPEAN PATENT SPECIFICATION</B121></B120><B130>B1</B130><B140><date>20181024</date></B140><B190>EP</B190></B100><B200><B210>09727809.7</B210><B220><date>20090326</date></B220><B240><B241><date>20100929</date></B241></B240><B250>ja</B250><B251EP>en</B251EP><B260>en</B260></B200><B300><B310>2008097172</B310><B320><date>20080403</date></B320><B330><ctry>JP</ctry></B330></B300><B400><B405><date>20181024</date><bnum>201843</bnum></B405><B430><date>20101215</date><bnum>201050</bnum></B430><B450><date>20181024</date><bnum>201843</bnum></B450><B452EP><date>20180430</date></B452EP></B400><B500><B510EP><classification-ipcr sequence="1"><text>B66B   1/18        20060101AFI20140811BHEP        </text></classification-ipcr><classification-ipcr sequence="2"><text>B66B   3/00        20060101ALI20140811BHEP        </text></classification-ipcr><classification-ipcr sequence="3"><text>B66B   1/24        20060101ALI20140811BHEP        </text></classification-ipcr></B510EP><B540><B541>de</B541><B542>GRUPPENVERWALTUNGSVORRICHTUNG FÜR EINEN AUFZUG</B542><B541>en</B541><B542>GROUP MANAGEMENT DEVICE OF ELEVATOR</B542><B541>fr</B541><B542>DISPOSITIF DE GESTION DE GROUPE D'ASCENSEURS</B542></B540><B560><B561><text>EP-A1- 1 873 106</text></B561><B561><text>WO-A1-2007/066390</text></B561><B561><text>JP-A- 4 094 384</text></B561><B561><text>JP-A- 7 223 780</text></B561><B561><text>JP-A- 2001 310 877</text></B561><B561><text>JP-B- 3 040 524</text></B561><B561><text>JP-B2- 3 511 167</text></B561><B561><text>US-A- 5 092 431</text></B561><B565EP><date>20140818</date></B565EP></B560></B500><B700><B720><B721><snm>SUZUKI, Naohiko</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>KOBORI, Shingo</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>IWATA, Masafumi</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>KOBA, Yoshimasa</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>TOKURA, Sakurako</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>TAKESHIMA, Koji</snm><adr><str>c/o Mitsubishi Electric Corporation
7-3 Marunouchi 2-chome
Chiyoda-ku</str><city>Tokyo 100-8310</city><ctry>JP</ctry></adr></B721><B721><snm>HIKITA, Shiro</snm><adr><str>c/o Mitsubishi Electric Mechatronics 
Software Co. Ltd.
1-14 Yadaminami 5-chome
Higashi-ku</str><city>Nagoya-shi
Aichi 461-8670</city><ctry>JP</ctry></adr></B721></B720><B730><B731><snm>Mitsubishi Electric Corporation</snm><iid>100785331</iid><irf>M/SOG-848-PC/EP</irf><adr><str>7-3, Marunouchi 2-chome</str><city>Chiyoda-ku
Tokyo 100-8310</city><ctry>JP</ctry></adr></B731></B730><B740><B741><snm>Sajda, Wolf E.</snm><sfx>et al</sfx><iid>100004927</iid><adr><str>Meissner Bolte Patentanwälte 
Rechtsanwälte Partnerschaft mbB 
Postfach 86 06 24</str><city>81633 München</city><ctry>DE</ctry></adr></B741></B740></B700><B800><B840><ctry>AT</ctry><ctry>BE</ctry><ctry>BG</ctry><ctry>CH</ctry><ctry>CY</ctry><ctry>CZ</ctry><ctry>DE</ctry><ctry>DK</ctry><ctry>EE</ctry><ctry>ES</ctry><ctry>FI</ctry><ctry>FR</ctry><ctry>GB</ctry><ctry>GR</ctry><ctry>HR</ctry><ctry>HU</ctry><ctry>IE</ctry><ctry>IS</ctry><ctry>IT</ctry><ctry>LI</ctry><ctry>LT</ctry><ctry>LU</ctry><ctry>LV</ctry><ctry>MC</ctry><ctry>MK</ctry><ctry>MT</ctry><ctry>NL</ctry><ctry>NO</ctry><ctry>PL</ctry><ctry>PT</ctry><ctry>RO</ctry><ctry>SE</ctry><ctry>SI</ctry><ctry>SK</ctry><ctry>TR</ctry></B840><B860><B861><dnum><anum>JP2009056136</anum></dnum><date>20090326</date></B861><B862>ja</B862></B860><B870><B871><dnum><pnum>WO2009123014</pnum></dnum><date>20091008</date><bnum>200941</bnum></B871></B870></B800></SDOBI>
<description id="desc" lang="en"><!-- EPO <DP n="1"> -->
<heading id="h0001"><u>Technical Field</u></heading>
<p id="p0001" num="0001">The present invention relates to a group supervisory control apparatus for elevators, which supervises a travel of an elevator group composed of a plurality of elevators.</p>
<heading id="h0002"><u>Background Art</u></heading>
<p id="p0002" num="0002">For example, in a conventional group supervising system for elevators as described in Patent Document 1, upon generation of a landing call, a group supervising/controlling apparatus calculates a difference between an arrival time of an allocation candidate car selected from an elevator group at a boarding floor and that of a user (passenger) who has performed a landing call operation.</p>
<p id="p0003" num="0003">If the allocation candidate car arrives at the landing a predetermined time or more earlier than the user, the group supervising/controlling apparatus cancels the selection of the car as the allocation candidate in the elevator group so as to prevent a travel efficiency of the elevator group from being lowered. Therefore, the group supervising/controlling apparatus selects a car different from the above-mentioned car as the allocation candidate to determine the allocated car which meets conditions.</p>
<p id="p0004" num="0004">Patent Document 1: <patcit id="pcit0001" dnum="JP2005112520A"><text>JP 2005-112 520 A</text></patcit></p>
<p id="p0005" num="0005"><patcit id="pcit0002" dnum="EP0440967A1"><text>EP 0 440 967 A1</text></patcit> discloses a further exemplary conventional group control of lifts.</p>
<p id="p0006" num="0006"><patcit id="pcit0003" dnum="EP1873106A1"><text>EP 1 873 106 A1</text></patcit> discloses a further exemplary conventional group control of lifts according to the preamble of the independent claims 1, 3 and 19.</p>
<heading id="h0003"><u>Disclosure of the Invention</u></heading>
<heading id="h0004"><u>Problems to be Solved by the Invention</u></heading>
<p id="p0007" num="0007">In some cases, a plurality of continuous landing calls for the same traveling direction are generated on the same boarding floor within a short period time. Specifically, while a car is yet to leave a boarding floor related with a previously registered landing call (that is, registered landing call), a new landing call for the same traveling direction as that of the registered landing call is sometimes generated on the same boarding floor as the boarding floor on which the registered landing call is generated.</p>
<p id="p0008" num="0008">On the other hand, in the conventional group supervising system for the<!-- EPO <DP n="2"> --> elevators as described above, a criterion for the range of users which may be allocated to the same car is not appropriately given. Therefore, if the new landing call having the same content as that of the registered landing call is generated, the car, which is allocated to the registered landing call, is also allocated to the new landing call. As a result, a door-open waiting time period of the car allocated to the registered landing call is extended.</p>
<p id="p0009" num="0009">With the allocation control method as described above, however, if the number of users increases, the door-open waiting time period of the car on the boarding floor also increases. Therefore, the waiting time period for the user who is the first to perform the landing call operation becomes longer after the arrival of the car. Moreover, it happens that the user who has performed the new landing call operation cannot board the car because a door of the car is closed quickly so that the car leaves the boarding floor or because the car is already fully loaded.</p>
<p id="p0010" num="0010">In addition, in the case where the same car as the car whose door-open waiting time period is extended is allocated to a landing floor different from the boarding floor, the arrival time of the car at the different landing floor is greatly delayed.</p>
<p id="p0011" num="0011">Thus, due to the factors described above, the conventional group supervising system for the elevators as described above has a problem of a lowered travel efficiency of the elevators and a problem of increased discomfort of the users when a plurality of users continuously perform the landing call operations.</p>
<p id="p0012" num="0012">The present invention has been made to solve the problems described above, and therefore has an object to provide a group supervisory control apparatus for elevators, which can improve a travel efficiency of the elevators and reduce discomfort of a user.</p>
<p id="p0013" num="0013">The present invention provides a group supervisory control apparatus for elevators according to independent claims 1, 3 and 19. Further embodiments of the invention may be realized in accordance with the corresponding dependent claims.<!-- EPO <DP n="3"> --></p>
<heading id="h0005"><u>Brief Description of the Drawings</u></heading>
<p id="p0014" num="0014">
<dl id="dl0001" compact="compact">
<dt>FIG. 1</dt><dd>is a perspective view illustrating the schema of a landing for elevators according to a first embodiment of the present invention;</dd>
<dt>FIG. 2</dt><dd>is a block diagram illustrating a group supervisory control apparatus for elevators according to the first embodiment of the present invention;</dd>
<dt>FIG. 3</dt><dd>is a block diagram illustrating an allocation candidate selection index calculating section and an allocation candidate selecting section illustrated in <figref idref="f0002">FIG. 2</figref> in a specific manner;</dd>
<dt>FIG. 4</dt><dd>is an explanatory diagram illustrating a relation between predicted user arrival times and a predicted car arrival time;</dd>
<dt>FIG. 5</dt><dd>is another explanatory diagram illustrating the relation between the predicted user arrival times and the predicted car arrival time;</dd>
<dt>FIG. 6</dt><dd>is a further explanatory diagram illustrating the relation between the predicted user arrival times and the predicted car arrival time;<!-- EPO <DP n="4"> --></dd>
<dt>FIG. 7</dt><dd>is a further explanatory diagram illustrating the relation between the predicted user arrival times and the predicted car arrival time;</dd>
<dt>FIG. 8</dt><dd>is a further explanatory diagram illustrating the relation between the predicted user arrival times and the predicted car arrival time;</dd>
<dt>FIG. 9</dt><dd>is an explanatory diagram illustrating processing for excluding a car from the selection of an allocation candidate by car excluding means for excluding a car based on door-open time period illustrated in <figref idref="f0003">FIG. 3</figref>;</dd>
<dt>FIG. 10</dt><dd>is another explanatory diagram illustrating processing for excluding the car from the selection of the allocation candidate by the car excluding means for excluding the car based on door-open time period illustrated in <figref idref="f0003">FIG. 3</figref>;</dd>
<dt>FIG. 11</dt><dd>is a further explanatory diagram illustrating processing for excluding the car from the selection of the allocation candidate by the car excluding means for excluding the car based on door-open time period illustrated in <figref idref="f0003">FIG. 3</figref>;</dd>
<dt>FIG. 12</dt><dd>is a further explanatory diagram illustrating processing for excluding the car from the selection of the allocation candidate by the car excluding means for excluding the car based on door-open time period illustrated in <figref idref="f0003">FIG. 3</figref>;</dd>
<dt>FIG. 13</dt><dd>is a flowchart illustrating an operation of a group supervisory control apparatus main body illustrated in <figref idref="f0003">FIG. 3</figref>;</dd>
<dt>FIG. 14</dt><dd>is an explanatory view illustrating a state in which a plurality of users sequentially arrive at the landing illustrated in <figref idref="f0001">FIG. 1</figref>;</dd>
<dt>FIG. 15</dt><dd>is an explanatory diagram illustrating an operation for determining the allocated car with the use of a general allocation method;</dd>
<dt>FIG. 16</dt><dd>is an explanatory diagram illustrating the operation for determining the allocated car with the use of another general allocation method;</dd>
<dt>FIG. 17</dt><dd>is a perspective view illustrating the schema of the landing for elevators according to a second embodiment of the present invention;</dd>
<dt>FIG. 18</dt><dd>is a block diagram illustrating the group supervisory control apparatus for the elevators according to a third embodiment of the<!-- EPO <DP n="5"> --> present invention;</dd>
<dt>FIG. 19</dt><dd>is a flowchart illustrating an operation of a group supervisory control apparatus main body illustrated in <figref idref="f0018">FIG. 18</figref>;</dd>
<dt>FIG. 20</dt><dd>is a block diagram illustrating the group supervisory control apparatus for the elevators according to a fourth embodiment of the present invention;</dd>
<dt>FIG. 21</dt><dd>is a flowchart illustrating an operation of a group supervisory control apparatus main body illustrated in <figref idref="f0020">FIG. 20</figref>;</dd>
<dt>FIG. 22</dt><dd>is a block diagram illustrating the group supervisory control apparatus for the elevators according to a fifth embodiment of the present invention;</dd>
<dt>FIG. 23</dt><dd>is a flowchart illustrating an operation of a group supervisory control apparatus main body illustrated in <figref idref="f0022">FIG. 22</figref>;</dd>
<dt>FIG. 24</dt><dd>is a block diagram illustrating the group supervisory control apparatus for the elevators according to a sixth embodiment of the present invention; and</dd>
<dt>FIG. 25</dt><dd>is a flowchart illustrating an operation of a group supervisory control apparatus main body illustrated in <figref idref="f0024">FIG. 24</figref>.</dd>
</dl></p>
<heading id="h0006"><u>Best Mode for Carrying Out the Invention</u></heading>
<p id="p0015" num="0015">Hereinafter, preferred embodiments of the present invention are described referring to the drawings.</p>
<heading id="h0007"><u>First Embodiment</u></heading>
<p id="p0016" num="0016"><figref idref="f0001">FIG. 1</figref> is a perspective view illustrating the periphery of a landing for elevators according to a first embodiment of the present invention. <figref idref="f0002">FIG. 2</figref> is a block diagram illustrating a group supervisory control apparatus for elevators according to the first embodiment of the present invention.</p>
<p id="p0017" num="0017">In <figref idref="f0001">FIGs. 1</figref> and <figref idref="f0002">2</figref>, a plurality of elevators are installed in a building. The plurality of elevators constitute an elevator group. The plurality of elevators respectively have cars 1A to 1D.</p>
<p id="p0018" num="0018">Operations of the cars 1A to 1D are respectively controlled by individual car controllers 2A to 2D. The individual car controllers 2A to 2D are connected to a group supervisory control apparatus main body 100. The group supervisory control apparatus main body 100 collectively supervises the operations of the cars<!-- EPO <DP n="6"> --> 1A to 1D, that is, a travel of the elevator group, via the individual car controllers 2A to 2D.</p>
<p id="p0019" num="0019">Remote landing-call registration devices 11A to 11E are provided on (in an area of) each landing floor of the building so as to be a predetermined distance away from a landing 3 for the elevators (only the remote landing-call registration devices 11A are illustrated in <figref idref="f0001">FIG. 1</figref>). Further, the remote landing-call registration devices 11A to 11E are located, for example, on a lobby floor, at a boundary between a general zone and a supervised zone (that is, at a zone boundary) in the building or the like. Each of the remote landing-call registration devices 11A to 11E includes an operation section and a display section. Further, the remote landing-call registration devices 11A to 11E are connected to the group supervisory control apparatus main body 100.</p>
<p id="p0020" num="0020">The remote landing-call registration devices 11A to 11E are subjected to a landing call operation performed by a user. The landing call operation includes: an operation for calling the car to a boarding floor which corresponds to the landing floor on which the user boards the car; and an operation for registering an exit floor which corresponds to the landing floor on which the user gets off the car. The remote landing-call registration devices 11A to 11E are operated by almost all the users of the elevators, who pass through the lobby floor, the zone boundary, or the like.</p>
<p id="p0021" num="0021">When the landing call operation is performed by the user, a corresponding one of the remote landing-call registration devices 11A to 11E transmits a content of the landing call operation as (information of) a request to register the landing call, to the group supervisory control apparatus main body 100. In response to the request to register the landing call, the group supervisory control apparatus main body 100 allocates one of the cars 1A to 1D as an allocated car to the boarding floor for which the request to register the landing call is made, and registers the landing call.</p>
<p id="p0022" num="0022">Upon registration of the landing call, the group supervisory control apparatus main body 100 transmits information of a car number of the allocated car as a response to the request to register the landing call to the corresponding one of the remote landing-call registration devices 11A to 11E. Upon reception of the information of the car number of the allocated car, the corresponding one of the remote landing-call registration devices 11A to 11E displays the car number of<!-- EPO <DP n="7"> --> the allocated car on the display section to inform the user of which is the allocated car.</p>
<p id="p0023" num="0023">Moreover, upon registration of the landing call, the group supervisory control apparatus main body 100 transmits an operation command relating to an operation of the allocated car to one of the individual car controllers 2A to 2D, which controls the allocated car. The corresponding one of the individual car controllers 2A to 2D controls the operation of the allocated car based on the operation command from the group supervisory control apparatus main body 100.</p>
<p id="p0024" num="0024">Moreover, the individual car controllers 2A to 2D perform, for example, destination floor registration (car call registration) or door opening/closing control for the cars 1A to 1D in response to the operation of each of car operating panels (not shown) respectively provided inside the cars 1A to 1D, which is performed by the user.</p>
<p id="p0025" num="0025">Next, a configuration of the group supervisory control apparatus main body 100 is specifically described. The group supervisory control apparatus main body 100 prestores information of the car numbers of the cars 1A to 1D. Moreover, the group supervisory control apparatus main body 100 receives information relating to operating statuses of the cars 1A to 1D from the individual car controllers 2A to 2D.</p>
<p id="p0026" num="0026">The information relating to the operating statuses of the cars 1A to 1D is information of positions of the cars 1A to 1D, running directions of the cars 1A to 1D, running statuses of the cars 1A to 1D (indicating whether the car is running or in a waiting state), door-open/closed statuses of the cars 1A to 1D, the landing calls registered for the cars 1A to 1D, destination floors registered for the cars 1A to 1D, and the like.</p>
<p id="p0027" num="0027">Upon each reception of the request to register the landing call, the group supervisory control apparatus main body 100 selects the allocated car for the landing call. When receiving another request to register a new landing call while the landing call is already registered, the group supervisory control apparatus main body 100 verifies whether the new landing call and the registered landing call are made for the same boarding floor and traveling direction. Specifically, the group supervisory control apparatus main body 100 verifies whether or not there is any registered landing call for the same boarding floor and traveling direction as those of the new landing call.<!-- EPO <DP n="8"> --></p>
<p id="p0028" num="0028">When there is a registered landing call for the same boarding floor and traveling direction, the group supervisory control apparatus main body 100 determines whether or not the car allocated to the registered landing call can also be allocated to the new landing call, and then allocates the car, which is already allocated to the registered landing call, or the car other than the allocated car, to the new landing call.</p>
<p id="p0029" num="0029">Moreover, the group supervisory control apparatus main body 100 includes: an allocation candidate selection index calculating section 120; an allocation candidate selecting section 130; a travel constant setting section 140; an allocated car determining section 150; and an operation command section 160. The allocation candidate selection index calculating section 120 calculates allocation candidate selection indices (first index and second index). The allocation candidate selection indices are indices for selecting (extracting), from all the cars 1A to 1D, the allocation candidate corresponding to a candidate for the allocated car to the new landing call.</p>
<p id="p0030" num="0030">The allocation candidate selecting section 130 evaluates all the cars 1A to 1D for the possibility of the allocation based on information of the allocation candidate selection indices from the allocation candidate selection index calculating section 120 and the operating statuses of the cars 1A to 1D (traveling status of the elevator group). Then, the allocation candidate selecting section 130 selects the allocation candidate corresponding to the candidate for the allocated car based on the evaluation result. Moreover, the allocation candidate selecting section 130 stores an allocation candidate list corresponding to a list of the car numbers of the selected allocation candidate cars.</p>
<p id="p0031" num="0031">Moreover, upon generation of the landing call, the allocation candidate selecting section 130 selects the allocation candidate from all the cars 1A to 1D and updates the stored allocation candidate list.</p>
<p id="p0032" num="0032">The travel constant setting section 140 prestores information of distances between the remote landing-call registration devices 11A to 11E and boarding/exiting positions for all the cars 1A to 1D (specifically, landing doorways (in front of the cars)) as travel distance information therein. The travel constant setting section 140 also prestores a standard value of traveling rates (walking rates) of the users as traveling rate information therein.</p>
<p id="p0033" num="0033">Upon operation of one of the remote landing-call registration devices 11A<!-- EPO <DP n="9"> --> to 11E by the user, the travel constant setting section 140 transmits the travel distance information between one of the remote landing-call registration devices 11A to 11E, on which the new landing call operation has been performed, and the boarding positions for all the cars 1A to 1D for the new landing call, and the traveling rate information, to the allocation candidate selection index calculating section 120.</p>
<p id="p0034" num="0034">The allocated car determining section 150 refers to the allocation candidate list generated by the allocation candidate selecting section 130 to select the car which provides a minimum increment in a total waiting time period when allocated, from the allocation candidate cars, and determines the selected car as the allocated car.</p>
<p id="p0035" num="0035">The allocated car determining section 150 also transmits the information of the car number of the thus selected allocated car to the operation command section 160. The operation command section 160 transmits the operation command relating to the operation of the allocated car to one of the individual controllers 2A to 2D, which controls the allocated car determined by the allocated car determining section 150.</p>
<p id="p0036" num="0036">Next, configurations of the allocation candidate selection index calculating section 120 and the allocation candidate selecting section 130 illustrated in <figref idref="f0002">FIG. 2</figref> are specifically described. <figref idref="f0003">FIG. 3</figref> is a block diagram illustrating in a specific manner the allocation candidate selection index calculating section 120 and the allocation candidate selecting section 130 illustrated in <figref idref="f0002">FIG. 2</figref>.</p>
<p id="p0037" num="0037">In <figref idref="f0003">FIG. 3</figref>, the illustration of the individual car controllers 2A to 2D, the travel constant setting section 140, the allocated car determining section 150, and the operation command section 160 is omitted.</p>
<p id="p0038" num="0038">In <figref idref="f0003">FIG. 3</figref>, the allocation candidate selection index calculating section 120 includes: predicted car arrival time computing means 21; predicted user arrival time computing means 22; scheduled door-open waiting time period computing means 23; and prediction boarding time interval computing means 24. The predicted car arrival time computing means 21 calculates a predicted time of the arrival of each of the cars 1A to 1D, specifically, a predicted car arrival time, at the boarding floor related with the new landing call based on a time at which the request to register the new landing call is generated.<!-- EPO <DP n="10"> --></p>
<p id="p0039" num="0039">The predicted car arrival time is calculated by the predicted car arrival time computing means 21 based on the information of the operating statuses of the cars 1A to 1D from the individual car controllers 2A to 2D.</p>
<p id="p0040" num="0040">The predicted user arrival time computing means 22 calculates a predicted time of the arrival of the user, that is, a predicted user arrival time, at each of the boarding positions for the cars 1A to 1D based on the time at which the request to register the landing call is generated. The predicted user arrival time is calculated by the predicted user arrival time computing means 22 based on standard travel distance information and standard traveling rate information from the travel constant setting section 140.</p>
<p id="p0041" num="0041">The scheduled door-open waiting time period computing means 23 receives the information of the predicted car arrival time from the predicted car arrival time computing means 21. The scheduled door-open waiting time period computing means 23 also receives the information of the predicted user arrival time from the predicted user arrival time computing means 22. Further, the scheduled door-open waiting time period computing means 23 stores the predicted user arrival times in the form of a time-sequential list.</p>
<p id="p0042" num="0042">Upon generation of the new landing call, the scheduled door-open waiting time period computing means 23 supposes that each of the cars 1A to 1D is allocated to the boarding floor related with the landing call and calculates a scheduled door-open waiting time period of each of the cars 1A to 1D after the arrival of each of the cars 1A to 1D at the boarding floor as a second index.</p>
<p id="p0043" num="0043">The scheduled door-open waiting time period is a scheduled time period during which the car waits with a door open at the landing 3 after the arrival of the car at the landing 3. The scheduled door-open waiting time period is calculated by the scheduled door-open waiting time period computing means 23 based on the predicted car arrival time and the list of the predicted user arrival times.</p>
<p id="p0044" num="0044">The prediction boarding time interval computing means 24 receives the information of the predicted car arrival time from the predicted car arrival time computing means 21. The prediction boarding time interval computing means 24 also receives the information of the predicted user arrival times from the predicted user arrival time computing means 22.</p>
<p id="p0045" num="0045">Further, the prediction boarding time interval computing means 24 also stores the information of the predicted user arrival times in the form of a<!-- EPO <DP n="11"> --> time-sequential list as in the case of the scheduled door-open waiting time period computing means 23.</p>
<p id="p0046" num="0046">Moreover, the prediction boarding time interval computing means 24 calculates a predicted arrival time interval corresponding to a time difference between a prediction boarding time of the user who performs the registered landing call operation immediately before the new landing call operation is performed and a prediction boarding time of the user who makes the new landing call as a first index based on the list of the prediction user arrival times.</p>
<p id="p0047" num="0047">Next, a method of computing the scheduled door-open waiting time period by the scheduled door-open waiting time period computing means 23 illustrated in <figref idref="f0003">FIG. 3</figref> and a method of computing the prediction boarding time interval by the prediction boarding time interval computing means 24 are more specifically described. Here, the scheduled door-open waiting time period is tw, the prediction boarding time interval is tint, and the predicted arrival time of the car 1A at the boarding floor is CarPT(A).</p>
<p id="p0048" num="0048">Moreover, the description is given with three users x, y, and z. The users x, y, and z are as follows.</p>
<p id="p0049" num="0049">User x: a user who is the first to arrive at the boarding position for the car 1A among a plurality of users who have performed the registered landing call operation.</p>
<p id="p0050" num="0050">User y: a user who is the last to arrive at the boarding position for the car 1A among the plurality of users who have performed the registered landing call operation.</p>
<p id="p0051" num="0051">User z: a user who has performed the new landing call operation.</p>
<p id="p0052" num="0052">Here, a time at which the user z performs the new landing call operation (current time) is T = 0. Moreover, the predicted arrival times of the users x, y, and z are respectively HT(x),HT(y), and HT(z), However, in the case where the user who boards the car 1A on the different landing floor remains in the car without getting off when the car 1A traveling in the same direction as that for the new landing call arrives at the boarding floor related with the new landing call, HT(x) = (predicted arrival time of the car 1A at the boarding floor).</p>
<p id="p0053" num="0053">In this case, the scheduled door-open waiting time period tw is expressed by the following Expression (1).<!-- EPO <DP n="12"> --> <maths id="math0001" num="Expression (1)"><math display="block"><mrow><mo>{</mo><mtable columnalign="left"><mtr><mtd><mi mathvariant="italic">tw</mi></mtd><mtd><mrow><mo>=</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>−</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>x</mi></mfenced><mo>,</mo><mi mathvariant="italic">CarPT</mi><mfenced><mi>A</mi></mfenced></mrow></mfenced><mn>,0</mn></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>≥</mo><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced></mrow></mtd></mtr><mtr><mtd><mi mathvariant="italic">tw</mi></mtd><mtd><mrow><mo>=</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced><mo>−</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>x</mi></mfenced><mo>,</mo><mi mathvariant="italic">CarPT</mi><mfenced><mi>A</mi></mfenced></mrow></mfenced><mn>,0</mn></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>x</mi></mfenced><mo>&lt;</mo><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>&lt;</mo><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced></mrow></mtd></mtr><mtr><mtd><mi mathvariant="italic">tw</mi></mtd><mtd><mrow><mo>=</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>x</mi></mfenced><mo>−</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>,</mo><mi mathvariant="italic">CarPT</mi><mfenced><mi>A</mi></mfenced></mrow></mfenced><mn>,0</mn></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>≤</mo><mi mathvariant="italic">HT</mi><mfenced><mi>x</mi></mfenced></mrow></mtd></mtr></mtable></mrow></math><img id="ib0001" file="imgb0001.tif" wi="126" he="28" img-content="math" img-format="tif"/></maths></p>
<p id="p0054" num="0054">Specifically, the scheduled door-open waiting time period tw is based on a relation of three times, that is, the predicted arrival time of the car allocated to the landing call at the boarding floor, the prediction boarding time of the user who makes the registered landing call for the allocated car, and the prediction boarding time of the user who makes the new landing call.</p>
<p id="p0055" num="0055">The prediction boarding time interval tint is expressed by the following Expression (2). <maths id="math0002" num="Expression (2)"><math display="block"><mrow><mo>{</mo><mtable columnalign="left"><mtr><mtd><mi mathvariant="italic">tint</mi></mtd><mtd><mrow><mo>=</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>−</mo><mi>max</mi><mfenced><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced><mo>,</mo><mi mathvariant="italic">CarPT</mi><mfenced><mi>A</mi></mfenced></mrow></mfenced><mn>,0</mn></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>≥</mo><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced></mrow></mtd></mtr><mtr><mtd><mi mathvariant="italic">tint</mi></mtd><mtd><mrow><mo>=</mo><mn>0</mn></mrow></mtd><mtd><mrow><mi mathvariant="italic">HT</mi><mfenced><mi>z</mi></mfenced><mo>≤</mo><mi mathvariant="italic">HT</mi><mfenced><mi>y</mi></mfenced></mrow></mtd></mtr></mtable></mrow></math><img id="ib0002" file="imgb0002.tif" wi="121" he="21" img-content="math" img-format="tif"/></maths></p>
<p id="p0056" num="0056">If there is no user predicted to board (already allocated to) the car 1A on the boarding floor related with the new landing call, the scheduled door-open waiting time period computing means 23 and the prediction boarding time interval computing means 24 respectively calculate the scheduled door-open waiting time period tw and the prediction boarding time interval tint with x = y = z.</p>
<p id="p0057" num="0057">If there is only one user predicted to board the car 1A, the scheduled door-open waiting time period computing means 23 and the prediction boarding time interval computing means 24 respectively calculate the scheduled door-open waiting time period tw and the prediction boarding time interval tint with x = y.</p>
<p id="p0058" num="0058">Further, in this example, the prediction boarding time interval computing means 24 calculates the prediction boarding time interval tint as the first index based on the predicted user arrival time. However, the prediction boarding time interval computing means 24 (or the allocation candidate selection index calculating section 120) can calculate an operation time interval corresponding to a time difference between a time at which the user y operates the landing-call registration device 11A and a time at which the user z operates the landing-call registration device 11A based on the above-mentioned operation times so that the<!-- EPO <DP n="13"> --> calculated operation time interval is used as the first index in place of the prediction boarding time interval tint. The operation time interval in this case can be handled in the same manner as that for the prediction boarding time interval tint in the computation processing described below.</p>
<p id="p0059" num="0059">Here, <figref idref="f0004 f0005 f0006 f0007">FIGs. 4 to 7</figref> are explanatory diagrams illustrating the relation between the predicted user arrival times of the users x, y, and z and the predicted car arrival time of the car 1A. <figref idref="f0004">FIG. 4</figref> illustrates the case where the car 1A arrives at a target boarding floor before the user x arrives at the boarding position (boarding position for the car 1A).</p>
<p id="p0060" num="0060"><figref idref="f0005">FIG. 5</figref> illustrates the case where the car 1A arrives at the target boarding floor after the user x arrives at the boarding position and before the user y arrives at the boarding position. <figref idref="f0006">FIG. 6</figref> illustrates the case where the car 1A arrives at the target boarding floor after the user y arrives at the boarding position and before the user z arrives at the boarding position. <figref idref="f0007">FIG. 7</figref> illustrates the case where the car 1A arrives at the target boarding floor after the user z arrives at the boarding position.</p>
<p id="p0061" num="0061">As illustrated in <figref idref="f0004 f0005 f0006 f0007">FIGs. 4 to 7</figref>, it is understood that the scheduled door-open waiting time period tw and the prediction boarding time interval tint vary according to the predicted user arrival times HT(x), HT(y), and HT(z) of the users x, y, and z and the predicted arrival time CarPT(A) of the car 1A.</p>
<p id="p0062" num="0062">Specifically, depending on the registered relation between HT(x), HT(y), HT(z) and CarPT(A), a target with which a difference with HT(z) is computed in a processing of calculating the scheduled door-open waiting time period tw and the prediction boarding time interval tint is determined to be any one of HT(x), HT(y), CarPT(A), and 0. In the case where the operation time interval is used as the first index in place of the prediction boarding time interval tint, the operation time interval is tint2 as illustrated in <figref idref="f0008">FIG. 8</figref>.</p>
<p id="p0063" num="0063">Next, a configuration of the allocation candidate selecting section 130 of the group supervisory control apparatus main body 1 is described. In <figref idref="f0003">FIG. 3</figref> referred to above, the allocation candidate selecting section 130 includes: car excluding means 31 for excluding car based on door-open time period; means 32 for excluding waiting car based on waiting time period; and allocation candidate list computing means (allocation candidate car selecting means) 37.</p>
<p id="p0064" num="0064">The car excluding means 31 for excluding car based on door-open time<!-- EPO <DP n="14"> --> period receives the information of the scheduled door-open waiting time period tw for each of the cars 1A to 1D from the scheduled door-open waiting time period computing means 23. At the same time, the car excluding means 31 for excluding car based on door-open time period receives the information of the prediction boarding time interval tint for each of the cars 1A to 1D from the prediction boarding time interval computing means 24.</p>
<p id="p0065" num="0065">Here, the scheduled door-open waiting time period tw and the prediction boarding time interval tint for the allocated car which is already allocated to the boarding floor related with the registered landing call are values which are obtained by supposing that the allocated car is also allocated to the new landing call. Specifically, the scheduled door-open waiting time period tw and the prediction boarding time interval tint in this case are values in the case where a response is simultaneously made to the registered landing call and to the new landing call.</p>
<p id="p0066" num="0066">The car excluding means 31 for excluding car based on door-open time period uses the scheduled door-open waiting time period tw and the prediction boarding time interval tint to perform computation expressed by the following Expression (3) for each of the cars 1A to 1D. <maths id="math0003" num="Expression (3)"><math display="block"><mfenced><mrow><mi mathvariant="italic">tw</mi><mo>≤</mo><mi mathvariant="italic">TW</mi><mn>0</mn><mi mathvariant="normal"> </mi><mi>a</mi><mi>n</mi><mi>d</mi><mi mathvariant="normal"> </mi><mi mathvariant="italic">tint</mi><mo>≤</mo><mi mathvariant="italic">TINT</mi><mn>0</mn></mrow></mfenced><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mfenced><mrow><mi mathvariant="italic">tw</mi><mo>≤</mo><mi>T</mi><mi>W</mi><mi>M</mi><mi>A</mi><mi>X</mi><mi mathvariant="normal"> </mi><mi>a</mi><mi>n</mi><mi>d</mi><mi mathvariant="normal"> </mi><mi mathvariant="italic">tint</mi><mo>≤</mo><mi mathvariant="italic">TINT</mi><mn>1</mn></mrow></mfenced></math><img id="ib0003" file="imgb0003.tif" wi="124" he="13" img-content="math" img-format="tif"/></maths></p>
<p id="p0067" num="0067">Each of the parameters TW0, TINT0, TWMAX, and TINT1 is as described below.
<ul id="ul0001" list-style="none" compact="compact">
<li>TW0: a standard allowable door-open waiting time period,</li>
<li>TINT0: a standard prediction boarding time interval within the standard allowable door-open waiting time period,</li>
<li>TWMAX: a maximum allowable door-open waiting time period, and</li>
<li>T1NT1: a standard prediction boarding time interval after lapse of the standard allowable door-open waiting time period.</li>
</ul></p>
<p id="p0068" num="0068">The allocation candidate selecting section 130 prestores a plurality of prediction boarding time interval values including TINT0 and TINT1 as first allowable values. The allocation candidate selecting section 130 also prestores a plurality of allowable door-open waiting time period values including TW0 and<!-- EPO <DP n="15"> --> TWMAX as second allowable values.</p>
<p id="p0069" num="0069">Then, the car excluding means 31 for excluding car based on door-open time period determines whether or not each of the cars 1A to 1D (each car) satisfies Expression (3). As a result, the car excluding means 31 for excluding car based on door-open time period registers the car number of the car which satisfies Expression (3) as the allocation candidate on the allocation candidate list. On the other hand, the car excluding means 31 for excluding car based on door-open time period excludes the car number of the car which does not satisfy Expression (3) from the selection of the allocation candidate to be registered on the allocation candidate list.</p>
<p id="p0070" num="0070">The means 32 for excluding waiting car based on waiting time period receives the information of the predicted car arrival time from the predicted car arrival time computing means 21. The means 32 for excluding waiting car based on waiting time period also receives the information of the predicted user arrival times from the predicted user arrival time computing means 22. Further, the means 32 for excluding waiting car based on waiting time period stores the information of the predicted user arrival times in the form of a time-sequential list.</p>
<p id="p0071" num="0071">Moreover, the means 32 for excluding waiting car based on waiting time period compares the predicted car arrival time and the predicted user arrival time for the car which is not allocated to the boarding floor related with the new landing call. Then, the means 32 for excluding waiting car based on waiting time period excludes the car number of the car whose predicted car arrival time is a limit time Tb or more earlier than the predicted user arrival time from the selection of the allocation candidate to be registered on the allocation candidate list. The limit time Tb is a preset threshold value so as to prevent the travel efficiency of the elevator group from being lowered.</p>
<p id="p0072" num="0072">The allocation candidate list computing means 37 computes, for example, the following Expression (4) for the allocation candidate list to select the allocation candidate from all the cars 1A to 1D. <maths id="math0004" num="Expression (4)"><math display="block"><mi>C</mi><mn>37</mn><mo>=</mo><mi>A</mi><mi>L</mi><mi>L</mi><mi>C</mi><mi>A</mi><mi>G</mi><mi>E</mi><mi mathvariant="normal"> </mi><mi>a</mi><mi>n</mi><mi>d</mi><mi mathvariant="normal"> </mi><mi mathvariant="italic">NOT</mi><mfenced><mrow><mi>N</mi><mn>31</mn><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mi>N</mi><mn>32</mn></mrow></mfenced></math><img id="ib0004" file="imgb0004.tif" wi="90" he="13" img-content="math" img-format="tif"/></maths>
<ul id="ul0002" list-style="none" compact="compact">
<li>where ALLCAGE: the car numbers of all the cars,<!-- EPO <DP n="16"> --></li>
<li>N31: the car number of the car excluded by the car excluding means 31 for excluding car based on door-open time period,</li>
<li>N32: the car number of the car excluded by the means 32 for excluding waiting car based on waiting time period, and</li>
<li>C37: the car number of the allocation candidate car selected by the allocation candidate list computing means 37.</li>
</ul></p>
<p id="p0073" num="0073">Therefore, the car(s) which does(do) not satisfy the conditions is(are) excluded from the selection of the allocation candidate by the car excluding means 31 for excluding car based on door-open time period and the means 32 for excluding waiting car based on waiting time period.</p>
<p id="p0074" num="0074">Then, upon reception of the result of the exclusion processing performed by the car excluding means 31 for excluding car based on door-open time period and the means 32 for excluding waiting car based on waiting time period, the allocation candidate list computing means 37 narrows down all the cars 1A to 1D to select the allocation candidate for the new landing call.</p>
<p id="p0075" num="0075">If the boarding floor or the exit floor for the new landing call corresponds to a floor which cannot be serviced because the boarding/exit floor is situated in a different service zone or is an unserviced floor (non-stop floor), the allocation candidate list computing means 37 excludes a car unavailable for the boarding/exit floor from the selection of the allocation candidate.</p>
<p id="p0076" num="0076">Next, the processing of excluding the car from the selection of the allocation candidate by the car excluding means 31 for excluding car based on door-open time period is specifically described. <figref idref="f0009 f0010 f0011 f0012">FIGs. 9 to 12</figref> are explanatory diagrams illustrating the processing of excluding the car from the selection of the allocation candidate by the car excluding means 31 for excluding car based on door-open time period illustrated in <figref idref="f0003">FIG. 3</figref>. In <figref idref="f0009 f0010 f0011 f0012">FIGs. 9 to 12</figref>, each of the users x and y is in a state in which the landing call made by each is registered and the car 1A is allocated to the landing calls.</p>
<p id="p0077" num="0077">In the case illustrated in <figref idref="f0009">FIG. 9</figref>, the scheduled door-open waiting time period tw is equal to or less than TW0 for the user z, while the prediction boarding time interval tint between the users z and y is TINT0 or less. Accordingly, Expression (3) is satisfied. As a result, the car excluding means 31 for excluding car based on door-open time period selects the car 1A as the allocation candidate for the new landing call made by the user z.<!-- EPO <DP n="17"> --></p>
<p id="p0078" num="0078">In the case illustrated in <figref idref="f0010">FIG. 10</figref>, the prediction boarding time interval tint between the users z and y is TINT1 or less. As a result, the limit value of the scheduled door-open waiting time period is changed (extended) from TW0 to TWMAX.</p>
<p id="p0079" num="0079">Then, the conditions of Expression (3) are satisfied because the scheduled door-open waiting time period tw for the user z is TWMAX or less. As a result, the car excluding means 31 for excluding car based on door-open time period selects the car 1A as the allocation candidate for the new landing call made by the user z as in the case illustrated in <figref idref="f0009">FIG. 9</figref>.</p>
<p id="p0080" num="0080">On the other hand, in the case illustrated in <figref idref="f0011">FIG. 11</figref>, the scheduled door-open waiting time period tw for the user z is less than each of TW0 and TWMAX. However, the prediction boarding time interval tint between the users z and y exceeds each of TINT0 and TINT1. Therefore, the conditions of Expression (3) are not satisfied. Accordingly, the car excluding means 31 for excluding car based on door-open time period excludes the car 1A from the selection of the allocation candidate for the new landing call made by the user z.</p>
<p id="p0081" num="0081">On the other hand, in the case illustrated in <figref idref="f0012">FIG. 12</figref>, the prediction boarding time interval tint between the users z and y is less than each of TINT0 and TINT1. However, the scheduled door-open waiting time period tw for the user z exceeds each of TW0 and TWMAX. Therefore, the conditions of Expression (3) are not satisfied. Accordingly, the car excluding means 31 for excluding car based on door-open time period excludes the car 1A from the selection of the allocation candidate for the new landing call made by the user z as in the case illustrated in <figref idref="f0011">FIG. 11</figref>.</p>
<p id="p0082" num="0082">Next, an operation of the group supervisory control apparatus main body 100 is described. Here, an operation for selecting the allocation candidate, which is performed by the group supervisory control apparatus main body 100 (allocation candidate selecting index calculating section 120 and allocation candidate selecting section 130), is specifically described.</p>
<p id="p0083" num="0083"><figref idref="f0013">FIG. 13</figref> is a flowchart illustrating an operation of the group supervisory control apparatus main body 100. In <figref idref="f0013">FIG. 13</figref>, first, upon reception of the request to register the new landing call from any one of the remote landing-call registration devices 11A to 11E, the group supervisory control apparatus main body 100 selects an arbitrary one of all the cars 1A to 1D as a car to be evaluated (Step<!-- EPO <DP n="18"> --> S101).</p>
<p id="p0084" num="0084">Then, the group supervisory control apparatus main body 100 calculates a predicted arrival time of the car to be evaluated at a target landing floor based on an operating status of the car to be evaluated (Step S102). At the same time, the group supervisory control apparatus main body 100 calculates a predicted arrival time of the user who has performed the new landing call operation at the boarding position for the car to be evaluated (Step S103).</p>
<p id="p0085" num="0085">Then, the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated has already been allocated to the same landing floor and the same traveling direction as the boarding floor and the traveling direction related with the new landing call (Step S104).</p>
<p id="p0086" num="0086">If the car to be evaluated is not allocated to the same landing floor and the same traveling direction as the boarding floor and the traveling direction related with the new landing call (NO in Step S104), the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated arrives at the target landing floor the limit time Tb or more earlier than the user (Step S105).</p>
<p id="p0087" num="0087">If the car to be evaluated arrives at the target landing floor the limit time Tb or more earlier than the user, the group supervisory control apparatus main body 100 excludes the car number of the car to be evaluated from the selection of the allocation candidate to be registered on the allocation candidate list (Step S106).</p>
<p id="p0088" num="0088">On the other hand, if the car to be evaluated does not arrive at the target landing floor the limit time Tb or more earlier than the user, the group supervisory control apparatus main body 100 sets the car to be evaluated as the allocation candidate and adds the car number of the car to be evaluated to the allocation candidate list (Step S107).</p>
<p id="p0089" num="0089">If the car to be evaluated is allocated to the same landing floor and the same traveling direction as the boarding floor and the traveling direction related with the new landing call (YES in Step S104), the group supervisory control apparatus main body 100 calculates the scheduled door-open waiting time period tw of the car to be evaluated on the target landing floor (Step S108). ^</p>
<p id="p0090" num="0090">At the same time, the group supervisory control apparatus main body 100 calculates the prediction boarding time interval tint between the user who has performed the new landing call operation and the last one of the plurality of users<!-- EPO <DP n="19"> --> who have performed the registered landing call operation (Step S109).</p>
<p id="p0091" num="0091">Then, the group supervisory control apparatus main body 100 verifies whether or not the calculated scheduled door-open waiting time period tw and the calculated prediction boarding time interval tint satisfy the conditions of Expression (3) (Step S110). If the scheduled door-open waiting time period tw and the prediction boarding time interval tint satisfy the conditions of Expression (3), the group supervisory control apparatus main body 100 sets the car to be evaluated as the allocation candidate and adds the car number of the car to be evaluated to the allocation candidate list (Step S107).</p>
<p id="p0092" num="0092">On the other hand, if the scheduled door-open waiting time period tw and the prediction boarding time interval tint do not satisfy the conditions of Expression (3), the group supervisory control apparatus main body 100 excludes the car number of the car to be evaluated from the selection of the allocation candidate to be registered on the allocation candidate list (Step S106).</p>
<p id="p0093" num="0093">After determining whether or not to set the car to be evaluated as the allocation candidate (after Steps S106 and S107), the group supervisory control apparatus main body 100 verifies whether or not all the cars 1A to 1D have been evaluated (Step S111). If all the cars 1A to 1D have been evaluated, the operation for selecting the allocation candidate by the group supervisory control apparatus main body 100 is terminated.</p>
<p id="p0094" num="0094">On the other hand, if all the cars 1A to 1D have not been evaluated yet, the group supervisory control apparatus main body 100 changes the car to be evaluated to an unevaluated car (Step S112). Then, the group supervisory control apparatus main body 100 calculates the predicted arrival time of the car to be evaluated after changing the car to be evaluated (Step S102) and then repeats the same operation until the evaluation is terminated for all the cars 1A to 1D.</p>
<p id="p0095" num="0095">Through the operation described above, the group supervisory control apparatus main body 100 refers to the allocation candidate list to determine the car providing a minimum total waiting time period when the new landing call is allocated thereto, as the allocated car. Then, the group supervisory control apparatus main body 100 transmits information of the car number of the allocated car to the corresponding one of the remote landing-call registration devices 11A to 11E, on which the landing call operation is performed by the user, while transmitting a command relating to the operation of the allocated car to one of the<!-- EPO <DP n="20"> --> individual car controllers 2A to 2D, which controls the allocated car.</p>
<p id="p0096" num="0096">Next, an operation for allocating the car by the group supervisory control apparatus main body 100 with the use of a general car allocation method in a situation where a plurality of users sequentially arrive at the landing 3 illustrated in <figref idref="f0001">FIG. 1</figref> is described. <figref idref="f0014">FIG. 14</figref> is an explanatory diagram illustrating the situation where the plurality of users sequentially arrive at the landing 3 illustrated in <figref idref="f0001">FIG. 1</figref>.</p>
<p id="p0097" num="0097">In <figref idref="f0014">FIG. 14</figref>, the remote landing-call registration device 11A is operated by the first user to perform the landing call operation. In response to the above-mentioned operation, the group supervisory control apparatus main body 100 allocates the car 1A to the boarding floor to register the landing call as a response to the landing call operation performed by the first user.</p>
<p id="p0098" num="0098">When the landing call operation is performed by the second or subsequent user within a short period of time after the landing call operation is performed by the first user, the group supervisory control apparatus main body 100 makes the previously allocated car 1A wait with a door open on the boarding floor as a response to the landing call operation performed by the second or subsequent user. Specifically, the plurality of users are grouped into one so that only one car 1A is allocated. In this case, the car 1A, which is allocated to the landing call operation performed by the first user, waits with the door open on the boarding floor until there are no more users to board the car on the boarding floor.</p>
<p id="p0099" num="0099">In the case where the allocation method as described above is used, the travel efficiency of the elevator group becomes relatively high because a relatively large number of users can be transported for each round-trip (each reciprocation) of the car 1A. However, there is a problem in that the door-open waiting time period of the car 1A become longer to relatively increase the waiting time period for the user who is in the car to result in increased discomfort of the user.</p>
<p id="p0100" num="0100">On the other hand, according to another general allocation method, when the landing call operation is performed by the second or subsequent user within a short period of time after the landing call operation is performed by the first user, the group supervisory control apparatus main body 100 divides the plurality of users who have performed the landing call operation into a plurality of groups Ga to Gd, as illustrated in <figref idref="f0016">FIG. 16</figref>.</p>
<p id="p0101" num="0101">Then, the group supervisory control apparatus main body 100 allocates the<!-- EPO <DP n="21"> --> cars 1A to 1D to the groups Ga to Gd in a one-by-one manner. In this case, the waiting time period of the user who is the first to board any one of the cars 1A to 1D becomes shorter as compared with that in the case illustrated in <figref idref="f0015">FIG. 15</figref>. However, the travel efficiency of the elevator group is lowered as compared with that in the case illustrated in <figref idref="f0015">FIG. 15</figref> because the number of users to board each car is as few as about one to three.</p>
<p id="p0102" num="0102">Specifically, in the case where the plurality of users are grouped into one (in the case illustrated in <figref idref="f0015">FIG. 15</figref>), there is a problem of a longer waiting time period of the user in the car 1A. On the other hand, in the case where the plurality of users are divided into the plurality of groups (in the case illustrated in <figref idref="f0016">FIG. 16</figref>), there is a problem of impossibility of transporting a large number of users at a time.</p>
<p id="p0103" num="0103">In order to solve the problems described above at the same time, it is necessary to appropriately select the allocated car for each user so as to simultaneously realize the reduction of the waiting time period in the car and the improvement of the travel efficiency of the elevators.</p>
<p id="p0104" num="0104">In regard of the problems descried above, in the group supervisory control apparatus for the elevators according to the first embodiment, when the scheduled door-open waiting time period tw calculated by the allocation candidate selection index calculating section 120 exceeds the maximum allowable door-open waiting time period TWMAX, the car allocated to the registered landing call is excluded from the selection of the allocation candidate for the new landing call by the allocation candidate selecting section 130.</p>
<p id="p0105" num="0105">In this manner, the car different from the allocated car is selected as the allocation candidate for the new landing call. As a result, the door-open waiting time period of the allocated car to the registered landing call is reduced, and thus it is possible to improve the travel efficiency of the elevator group. At the same time, the in-car waiting time period of the user arriving at the landing earlier is reduced, and thus it is possible to reduce the discomfort of the user.</p>
<p id="p0106" num="0106">Moreover, the allocation candidate is obtained by narrowing down the cars by the allocation car excluding means 31 for excluding car based on door-open time period, based on the scheduled door-open waiting time period tw and the prediction boarding time interval tint respectively calculated by the scheduled door-open waiting time period computing means 23 and the prediction boarding<!-- EPO <DP n="22"> --> time interval computing means 24.</p>
<p id="p0107" num="0107">As a result, the door-open waiting time period of the allocated car can be prevented from being longer than needed. In addition, in the case where there is any user who can board immediately after the scheduled door-open waiting time period tw exceeds TW0, the door-open time period is slightly extended with TINT1 to allow the boarding of the user.</p>
<p id="p0108" num="0108">Further, the allocation candidate is obtained by narrowing down the cars by the allocation car excluding means 31 for excluding car based on door-open time period, based on the scheduled door-open waiting time period tw and the prediction boarding time interval tint respectively calculated by the scheduled door-open waiting time period computing means 23 and the prediction boarding time interval computing means 24. As a result, the travel efficiency of the elevators can be improved because the users to board can be appropriately distributed,</p>
<p id="p0109" num="0109">Moreover, even within the maximum allowable door-open waiting time period TWMAX and the standard allowable door-open waiting time period TW0, the target car can be excluded from the selection of the allocation candidate by using the limit value TINT0 of the prediction boarding time interval.</p>
<p id="p0110" num="0110">As a result, the prevention of the operation which provides discomfort, and which increases the door-open waiting time period of the car or the user waiting time period in the car, and the improvement of the travel efficiency of the elevator group, can be realized at the same time.</p>
<p id="p0111" num="0111">Further, in the case where the car arrives at the target landing floor the limit time Tb or more earlier than the user, the means 32 for excluding waiting car based on waiting time period excludes the car from the selection of the allocation candidate. As a result, the car can be prevented from waiting with the door open for a long period of time at a landing floor. Thus, the travel efficiency of the elevator group can be further improved.</p>
<p id="p0112" num="0112">Moreover, the predicted user arrival time computing means 22 predicts the arrival time of the user at the boarding position for each of the cars 1A to 1D from the corresponding one of the remote landing-call registration devices 11A to 11E. With the above-mentioned configuration, hoistways for the cars of the elevator group which is to be supervised by the single group supervisory control apparatus main body 100 and the remote landing-call registration devices can be freely<!-- EPO <DP n="23"> --> arranged. As a result, the degree of freedom in design can be greatly increased.</p>
<p id="p0113" num="0113">Although the car excluding means 31 for excluding car based on door-open time period uses the above-mentioned Expression (3) to determine whether or not to exclude the car to be evaluated from the selection of the allocation candidate in the first embodiment, whether or not to exclude the car to be evaluated from the selection of the allocation candidate may be determined according to the following Expression (5) without taking the prediction boarding time interval within the standard time period into consideration. <maths id="math0005" num="Expression (5)"><math display="block"><mfenced><mrow><mi mathvariant="italic">tw</mi><mo>≤</mo><mi mathvariant="italic">TW</mi><mn>0</mn></mrow></mfenced><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mfenced><mrow><mi mathvariant="italic">tw</mi><mo>≤</mo><mi>T</mi><mi>W</mi><mi>M</mi><mi>A</mi><mi>X</mi><mi mathvariant="normal"> </mi><mi>a</mi><mi>n</mi><mi>d</mi><mi mathvariant="normal"> </mi><mi mathvariant="italic">tint</mi><mo>≤</mo><mi mathvariant="italic">TINT</mi><mn>1</mn></mrow></mfenced></math><img id="ib0005" file="imgb0005.tif" wi="95" he="13" img-content="math" img-format="tif"/></maths></p>
<p id="p0114" num="0114">Moreover, in the first embodiment, the processing of excluding the car from the selection of the allocation candidate by the car excluding means 31 for excluding car based on door-open time period is performed based on the scheduled door-open waiting time period tw and the prediction boarding time interval tint respectively from the scheduled door-open waiting time period computing means 23 and the prediction boarding time interval computing means 24.</p>
<p id="p0115" num="0115">In contrast to the example described above, the prediction boarding time interval computing means 24 may be omitted so that the processing of excluding the allocation candidate by the car excluding means 31 for excluding car based on door-open time period is performed based only on the scheduled door-open waiting time period tw from the scheduled door-open waiting time period computing means 23.</p>
<p id="p0116" num="0116">Similarly, the scheduled door-open waiting time period computing means 23 may be omitted so that the processing of excluding the allocation candidate by the car excluding means 31 for excluding car based on door-open time period is performed based only on the prediction boarding time interval tint from the prediction boarding time interval computing means 24.</p>
<p id="p0117" num="0117">Further, although the parameters TW0, TINT0, TWMAX, and TINT1 used in the above-mentioned Expression (3) are common to all the landing floors in the first embodiment, the values of the parameters may be changed for some landing floor(s). For example, for the landing floor on which there are a large number of users to board the cars such as a lobby floor, at least one of the parameters TWO,<!-- EPO <DP n="24"> --> TINT0, TWMAX, and TINT1 may be set larger than a standard value.</p>
<p id="p0118" num="0118">In this case, by increasing the parameter, on the landing floor such as the lobby floor, on which there are a large number of users to board the cars, the users can be grouped into one to board the same car.</p>
<p id="p0119" num="0119">Moreover, Expression (3) described in the first embodiment is an operational expression including two combinations (specifically, two pairs of parentheses in Expression (3)) for the standard allowable door-open waiting time period and the standard prediction boarding time interval.</p>
<p id="p0120" num="0120">However, the operational expression used for the computation processing performed by the car excluding means 31 for excluding car based on door-open time period is not limited to the above-mentioned example. An operational expression including three or more combinations for the standard allowable door-open waiting time period and the standard prediction boarding time interval may also be used.</p>
<p id="p0121" num="0121">Here, for example, in the example illustrated in <figref idref="f0011">FIG. 11</figref> in the first embodiment, in the case where the car 1A arrives at a floor F after the user y moves to and arrives at the boarding position (after HT(y)), specifically, in the case where there is CarPT(A) between HT(y) and HT(z), a starting point of the door-open waiting time period tw is delayed as compared with that in the example illustrated in <figref idref="f0011">FIG. 11</figref>.</p>
<p id="p0122" num="0122">Therefore, in the case where the above-mentioned car excluding means 31 for excluding car based on door-open time period executes the computation processing expressed by the above-mentioned Expression (3) without any change, the waiting time period of the user y in the car 1A becomes relatively long along with the delayed starting point of the door-open waiting time period tw as compared with that of the example illustrated in <figref idref="f0011">FIG. 11</figref> when the user z arrives at the boarding position for the car 1A immediately before the standard allowable door-open waiting time period TW0 or the maximum allowable door-open waiting time period TWMAX ends.</p>
<p id="p0123" num="0123">To cope with the problem described above, the car excluding means 31 for excluding car based on door-open time period may change, the computation processing expressed by the above-mentioned Expression (3), the standard allowable door-open waiting time period TW0 to a smaller value in the case where it is verified that the prediction boarding time interval tint is larger than the<!-- EPO <DP n="25"> --> standard prediction boarding time interval TINT0.</p>
<p id="p0124" num="0124">Alternatively, the car excluding means 31 for excluding car based on door-open time period may change the maximum allowable door-open waiting time period TWMAX to a smaller value in the case where it is verified that the prediction boarding time interval tint is larger than the standard prediction boarding time interval TINT1. In this manner, in the case where the starting point of the door-open waiting time period tw is situated after the arrival time of the user y at the boarding position for the car 1A, the waiting time period of the user y in the car 1A can be prevented from increasing.</p>
<heading id="h0008"><u>Second Embodiment</u></heading>
<p id="p0125" num="0125">In the first embodiment, the target to be supervised by the group supervisory control apparatus main body 100 is the elevator group for which the hoistways are arranged so as to be adjacent to the single landing 3 in the building. On the other hand, in the second embodiment, a plurality of landings 3A and 3B are provided in the building as illustrated in <figref idref="f0017">FIG. 17</figref>.</p>
<p id="p0126" num="0126">The target to be supervised by the group supervisory control apparatus main body 100 according to the second embodiment is an elevator group for which the hoistways are provided so as to be adjacent to the landings 3A and 3B, respectively. Specifically, the group supervisory control apparatus main body 100 according to the second embodiment supervises the travel of the elevator group including cars 1A to 1H illustrated in <figref idref="f0017">FIG. 17</figref>.</p>
<p id="p0127" num="0127">Moreover, the travel constant setting section 140 included in the group supervisory control apparatus main body 100 of the second embodiment prestores information of boarding positions for the cars 1E to 1H in addition to the information of the boarding positions for the cars 1A to 1D on each landing floor. Further, the allocation candidate selection index calculating section 120 included in the group supervisory control apparatus main body 100 of the second embodiment obtains distance information between the boarding positions for the cars 1A to 1H and the remote landing-call registration devices 11A to 11E.</p>
<p id="p0128" num="0128">Then, upon reception of the request to register the new landing call, the allocation candidate selection index calculating section 120 calculates the predicted car arrival time of each of the cars 1A to 1H and the predicted user arrival time at the boarding position for each of the cars 1A to 1H. The other configuration and operation are the same as those of the first embodiment.<!-- EPO <DP n="26"> --></p>
<p id="p0129" num="0129">In the group supervisory control apparatus for the elevators as described above, even in the case where the elevators are provided at a plurality of positions which are separated away from each other in the building, the same effects as those of the first embodiment can be obtained.</p>
<p id="p0130" num="0130">The number of cars included in the elevator group is not limited to those of the examples of the first and second embodiments, and can be appropriately determined according to specifications and an environment where the elevator group is installed, and the like.</p>
<heading id="h0009"><u>Third Embodiment</u></heading>
<p id="p0131" num="0131">In the allocation candidate selecting section 130 of the first embodiment, the processing of excluding the car from the selection of the allocation candidate for the new landing call is performed by the car excluding means 31 for excluding car based on door-open time period and the means 32 for excluding waiting car based on waiting time period. On the other hand, in the allocation candidate selecting section 130 of the third embodiment, the processing of excluding the car from the selection of the allocation candidate for the new landing call is performed even with another method.</p>
<p id="p0132" num="0132"><figref idref="f0018">FIG. 18</figref> is a block diagram illustrating the group supervisory control apparatus for the elevators according to the third embodiment of the present invention.</p>
<p id="p0133" num="0133">In <figref idref="f0018">FIG. 18</figref>, the illustration of the individual car controllers 2A to 2D, the travel constant setting section 140, the allocated car determining section 150, and the operation command section 160 is omitted, as in the case of <figref idref="f0003">FIG. 3</figref> referred to above. In <figref idref="f0018">FIG. 18</figref>, the allocation candidate selecting section 130 of the third embodiment further includes: fully-loaded car excluding means 33; empty car selecting means 34; car-about-to-leave excluding means 35; means 36 for changing limit value based on traffic flow, which serves as threshold value changing means; and selection condition relaxing means 38.</p>
<p id="p0134" num="0134">The fully-loaded car excluding means 33 excludes one of the cars 1A to 1D, which becomes unavailable by responding to a different landing call on the boarding floor related with the new landing call when the new landing call is made, and then performs the registration on the allocation candidate list.</p>
<p id="p0135" num="0135">Specifically, the fully-loaded car excluding means 33 verifies a call registered in a zone between the boarding floor related with the new landing call<!-- EPO <DP n="27"> --> and a landing floor which is situated one floor before the exit floor (on the side closer to the boarding floor) for which the new landing call is made.</p>
<p id="p0136" num="0136">Then, if the car is fully loaded by responding to the already registered landing call, the fully-loaded car excluding means 33 excludes the car number of the fully-loaded car from the selection of the allocation candidate to be registered on the allocation candidate list.</p>
<p id="p0137" num="0137">Specifically, in the case where the car would be overloaded if the user who has performed the new landing call boards the car, the fully-loaded car excluding means 33 excludes the car from the selection of the allocation candidate.</p>
<p id="p0138" num="0138">The empty car selecting means 34 registers (adds) the car whose operation is currently stopped, the car whose operation is scheduled to be stopped, or the car which is moving (is being dispatched) to a specific floor among all the cars 1A to 1D on (to) the allocation candidate list as the allocation candidate.</p>
<p id="p0139" num="0139">The car whose operation is currently stopped is a car for which the allocated landing call and car call are not set, specifically, a car to which the landing call and the car call are not allocated. The car whose operation is scheduled to be stopped is a car which is now responding to the last set car call and is brought into an operation stop state upon completion of all the services after responding to the car call, specifically, the car from which the landing call and the car call are soon to be deallocated. The car which is moving to the specific floor is, for example, a car which is moving so as to wait on a preset specific floor (waiting floor) according to the traveling status of the elevator group.</p>
<p id="p0140" num="0140">Upon generation of the new landing call, the car-about-to-leave excluding means 35 verifies whether or not there is any car which has started closing the door to leave the same landing floor as the boarding floor related with the new landing call so as to travel in the same direction as the traveling direction for the new landing call among all the cars I A to 1D.</p>
<p id="p0141" num="0141">Then, if there is any car which meets the above-mentioned conditions, the car-about-to-leave excluding means 35 excludes the car number of the car from the selection of the allocation candidate to be registered on the allocation candidate list.</p>
<p id="p0142" num="0142">The means 36 for changing limit value based on traffic flow prestores information of a traffic flow in the building (or measures the traffic flow in the building as needed to create statistics thereof). The traffic flow is information<!-- EPO <DP n="28"> --> relating to statistics of changes in a flow of the users in the building.</p>
<p id="p0143" num="0143">The means 36 for changing limit value based on traffic flow dynamically changes the limit values (or selects one from a plurality of prestored limit values) for the car excluding means 31 for excluding car based on door-open time period and the means 32 for excluding waiting car based on waiting time period according to changes (tendency and pattern) in the traffic flow in the building.</p>
<p id="p0144" num="0144">The limit values for the car excluding means 31 for excluding car based on door-open time period are the parameters TWO, TINT0, TWMAX, and TINT1 used in Expression (3) described above. The limit value for the means 32 for excluding waiting car based on waiting time period is the limit time Tb.</p>
<p id="p0145" num="0145">For example, if the remote landing-call registration device 11A is provided on the lobby floor and the traffic flow from the lobby floor to the upper floors is heavy during an up-peak time or the like, the means 36 for changing limit value based on traffic flow changes at least one value of TWO, TINT0, TWMAX, and TINT1 to a value larger than that for the traffic flow during a normal time (off-hours).</p>
<p id="p0146" num="0146">As examples of the traffic flow, an up-peak traffic flow, a down-peak traffic flow, and a lunchtime traffic flow are given. The up-peak traffic flow is a traffic flow with a relatively large number of users (larger than the number of users during the normal time) moving from the lobby floor to general floors.</p>
<p id="p0147" num="0147">The down-peak traffic flow is a traffic flow with a relatively large number of users moving from the general floors to the lobby floor. Further, the lunchtime traffic flow is a traffic flow with a relatively large number of users moving from the lobby floor or a restaurant floor to the general floors or moving in the opposite direction.</p>
<p id="p0148" num="0148">The allocation candidate list computing means 37 of the third embodiment computes, for example, the following Expression (6) for the allocation candidate list to extract the allocation candidate from all the cars 1A to 1D. <maths id="math0006" num="Expression (6)"><math display="block"><mi>C</mi><mn>37</mn><mo>=</mo><mfenced open="{" close="}"><mrow><mi>A</mi><mi>L</mi><mi>L</mi><mi>C</mi><mi>A</mi><mi>G</mi><mi>E</mi><mi mathvariant="normal"> </mi><mi>a</mi><mi>n</mi><mi>d</mi><mi mathvariant="normal"> </mi><mi mathvariant="italic">NOT</mi><mfenced><mrow><mi>N</mi><mn>31</mn><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mi>N</mi><mn>32</mn><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mi>N</mi><mn>33</mn><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mi>N</mi><mn>35</mn></mrow></mfenced></mrow></mfenced><mi mathvariant="normal"> </mi><mi>o</mi><mi>r</mi><mi mathvariant="normal"> </mi><mi>C</mi><mn>34</mn></math><img id="ib0006" file="imgb0006.tif" wi="129" he="13" img-content="math" img-format="tif"/></maths>
<ul id="ul0003" list-style="none" compact="compact">
<li>where ALLCAGE: the car numbers of all the cars,</li>
<li>N31: the car number of the car excluded by the car excluding means 31 for<!-- EPO <DP n="29"> --> excluding car based on door-open time period,</li>
<li>N32: the car number of the car excluded by the means 32 for excluding waiting car based on waiting time period,</li>
<li>N33: the car number of the car excluded by the fully-loaded car excluding means 33,</li>
<li>N35: the car number of the car excluded by the car-about-to-leave excluding means 35,</li>
<li>C34: the car number of the car selected by the empty car selecting means 34, and</li>
<li>C37: the car number of the allocation candidate car selected by the allocation candidate list computing means 37.</li>
</ul></p>
<p id="p0149" num="0149">The selection condition relaxing means 38 relaxes conditions of selection of the allocation candidate and selects the allocation candidate again when there is no allocation candidate selected by the allocation candidate list computing means 37. If there is still no allocation candidate even after the conditions are relaxed, the selection condition relaxing means 38 sets all the cars 1A to 1D as the allocation candidates.</p>
<p id="p0150" num="0150">Here, a method of selecting the allocation candidate by the selection condition relaxing means 38 is specifically described. First, a selection method in the case where the landing call for the same boarding floor and the same traveling direction as those of the new landing call is not registered is described. In this case, the selection condition relaxing means 38 changes the limit time Tb for the means 32 for excluding waiting car based on waiting time period to a limit time Tc (Tb&lt;Tc).</p>
<p id="p0151" num="0151">Then, under the above-mentioned condition, the selection condition relaxing means 38 performs the same processing as that performed by the means 32 for excluding waiting car based on waiting time period to determine whether or not the car (N32) excluded by the means 32 for excluding waiting car based on waiting time period is allocable to the new landing call.</p>
<p id="p0152" num="0152">If a car whose predicted car arrival time is about the limit time Tb earlier than the predicted user arrival time is found as a result of the processing described above, the selection condition relaxing means 38 selects the car excluded by the means 32 for excluding waiting car based on waiting time period as the allocation candidate.<!-- EPO <DP n="30"> --></p>
<p id="p0153" num="0153">On the other hand, in the case where there is a registered landing call for the same boarding floor and the same traveling direction as those of the new landing call, the selection condition relaxing means 38 changes the values of TWO, TINT0, TWMAX, and TINT1 for the car excluding means 31 for excluding car based on door-open time period to values larger than the last values thereof.</p>
<p id="p0154" num="0154">Then, under the conditions described above, the selection condition relaxing means 38 performs the same processing as that performed by the car excluding means 31 for excluding car based on door-open time period to determine whether or not the car (N31) excluded by the car excluding means 31 for excluding car based on door-open time period is allocable to the new landing call.</p>
<p id="p0155" num="0155">If the car satisfying the conditions relaxed for the door-open waiting time period or the prediction boarding time interval is found as a result of the determination, the selection condition relaxing means 38 selects the car excluded by the car excluding means 31 for excluding car based on door-open time period as the allocation candidate. The other configuration is the same as that of the first embodiment.</p>
<p id="p0156" num="0156">Next, the operation of the group supervisory control apparatus main body 100 according to the third embodiment is described. Here, as in the first embodiment described above, the operation for selecting the allocation candidate by the group supervisory control apparatus main body 100 is specifically described. <figref idref="f0019">FIG. 19</figref> is a flowchart illustrating the operation of the group supervisory control apparatus main body 100 illustrated in <figref idref="f0018">FIG. 18</figref>.</p>
<p id="p0157" num="0157">First, upon reception of the request to register the new landing call from any one of the remote landing-call registration devices 11A to 11E, the allocation candidate selecting section 130 verifies the current time and changes each of the limit values according to the traffic flow related with the current time (Step S210). Specifically, the allocation candidate selecting section 130 changes each of the values of TW0, TINT0, TINT1, TWMAX, and Tb according to the traffic flow related with the current time.</p>
<p id="p0158" num="0158">Then, the group supervisory control apparatus main body 100 selects an arbitrary one of all the cars 1A to 1D as the car to be evaluated (Step S202). After the selection of the car to be evaluated, the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated meets a condition<!-- EPO <DP n="31"> --> for excluding the fully-loaded car, whether or not the car to be evaluated meets a condition for excluding the car about to leave, and whether or not the car to be evaluated meets a condition for selecting the empty car (Steps S203 to S205).</p>
<p id="p0159" num="0159">Here, the condition for excluding the fully-loaded car, the condition for excluding the car about to leave, and the condition for selecting the empty car for the car to be elevated are the conditions respectively corresponding to the exclusion processing performed by the fully-loaded car excluding means 33, that performed by the car-about-to-leave excluding means 35, and the selection processing performed by the empty car selecting means 34.</p>
<p id="p0160" num="0160">If the car to be evaluated does not meet any of the condition for excluding the fully-loaded car, the condition for excluding the car about to leave, and the condition for selecting the empty car, the group supervisory control apparatus main body 100 calculates the predicted arrival time of the car to be evaluated at the target landing floor based on the operating status of the car to be evaluated (Step S206).</p>
<p id="p0161" num="0161">At the same time, the group supervisory control apparatus main body 100 calculates the predicted arrival time of the user who has performed the new landing call, at the boarding position for the car to be evaluated (Step S207).</p>
<p id="p0162" num="0162">Then, the group supervisory control apparatus main body 100 verifies whether the car to be evaluated has already been allocated to the call for the same landing floor and the same traveling direction as those of the boarding floor and the traveling direction related with the new landing call (Step S208).</p>
<p id="p0163" num="0163">If the car to be evaluated is not allocated to the call for the same landing floor and the same traveling direction as the boarding floor and the traveling direction related with the new landing call (NO in Step S208), the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated meets a condition for excluding an early-arrival car (Step S209). Specifically, the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated arrives at the target landing floor the limit time Tb or more earlier than the user.</p>
<p id="p0164" num="0164">On the other hand, if the car to be evaluated has been allocated to the call for the same landing floor and the same traveling direction as the boarding floor and the traveling direction related with the new landing call (YES in Step S208), the group supervisory control apparatus main body 100 calculates the scheduled<!-- EPO <DP n="32"> --> door-open waiting time period tw of the car to be evaluated at the target landing floor (Step S210).</p>
<p id="p0165" num="0165">At the same time, the group supervisory control apparatus main body 100 calculates the prediction boarding time interval tint between the user who has performed the new landing call operation and the user who has performed the registered landing call operation immediately before the new landing call is made (Step S211).</p>
<p id="p0166" num="0166">Then, the group supervisory control apparatus main body 100 verifies whether or not the car to be evaluated meets the condition for excluding the car based on the door-open waiting time period, based on the calculated scheduled door-open waiting time period tw and prediction boarding time interval tint (Step S212).</p>
<p id="p0167" num="0167">Specifically, the group supervisory control apparatus main body 100 verifies whether or not the calculated scheduled door-open waiting time period tw prediction boarding time interval tint satisfy the conditions of Expression (3).</p>
<p id="p0168" num="0168">If the car to be evaluated meets any one of the condition for excluding the early-arrival car, the condition for excluding the fully-loaded car, the condition for excluding the car about to leave, and the condition for excluding the car based on the door-open waiting time period as a result of the processing (YES in Steps S203, S204, S209, and S212), the group supervisory control apparatus main body 100 excludes the car number of the car to be evaluated from the selection of the allocation candidate to be registered on the allocation candidate list (Step S213).</p>
<p id="p0169" num="0169">On the other hand, if the car to be evaluated meets the condition for selecting the empty car (YES in Step S205) or the car to be evaluated does not meet the condition for excluding the early-arrival car (NO in Step S212), the group supervisory control apparatus main body 100 adds the car number of the car to be evaluated to the allocation candidate list (Step S214).</p>
<p id="p0170" num="0170">Then, after adding the car number of the car to be evaluated to the allocation candidate list or excluding the car number of the car to be evaluated from the selection of the allocation candidate to be registered on the allocation candidate list, the group supervisory control apparatus main body 100 verifies whether or not all the cars 1A to 1D have been evaluated (Step S215).</p>
<p id="p0171" num="0171">If all the cars 1A to 1D have not been evaluated, the group supervisory control apparatus main body 100 changes the car to be evaluated to an unevaluated<!-- EPO <DP n="33"> --> one of the cars (Step S216). Then, the group supervisory control apparatus main body 100 verifies whether or not the predicted arrival time of the thus newly changed car to be evaluated meets the condition for excluding the fully-loaded car (Step S203). Then, the same operation (Steps S203 to S216) is repeated until all the cars 1A to 1D are evaluated.</p>
<p id="p0172" num="0172">Moreover, if all the cars 1A are 1D have been evaluated, the group supervisory control apparatus main body 100 verifies whether or not there is an allocation candidate car on the allocation candidate list (Step S217). If there is an allocation candidate car on the allocation candidate list in this step, the operation for selecting the allocation candidate by the group supervisory control apparatus main body 100 is terminated.</p>
<p id="p0173" num="0173">On the other hand, if there is no allocation candidate car on the allocation candidate list (NO in Step S217), the group supervisory control apparatus main body 100 relaxes the selection conditions and performs processing for re-selecting the allocation candidate (Step S218).</p>
<p id="p0174" num="0174">Then, the group supervisory control apparatus main body 100 verifies whether or not the allocation candidate car is found on the allocation candidate list as a result of the re-selection processing (Step S219). If the allocation candidate car is found on the allocation candidate list in this step, the operation for selecting the allocation candidate by the group supervisory control apparatus main body 100 is terminated.</p>
<p id="p0175" num="0175">On the other hand, if there is no allocation candidate car on the allocation candidate list (NO in Step S219), the group supervisory control apparatus main body 100 sets all the cars 1A to 1D as the allocation candidates, and therefore registers the car numbers of the cars 1A to 1D on the allocation candidate list (Step S220). Then, the operation for selecting the allocation candidate by the group supervisory control apparatus main body 100 is terminated. The subsequent operation is the same as that of the first embodiment.</p>
<p id="p0176" num="0176">In the group supervisory control apparatus for the elevators as described above, the car which is unavailable for the new landing call is excluded from the selection of the allocation candidate by the fully-loaded car excluding means 33. As a result, it is possible to avoid an operation which provides discomfort, that is, it is only when the user who operates any one of the remote landing-call registration devices 11A to 11E arrives at the boarding position for the car that the<!-- EPO <DP n="34"> --> user knows that the allocated car is fully loaded and the user is forced to operate the remote landing-call registration devices 11A to 11E again.</p>
<p id="p0177" num="0177">Moreover, the car which has already completed or is soon to complete the allocated service is selected as the allocation candidate by the empty car selecting means 34. As a result, the travel efficiency of the elevator group can be further improved.</p>
<p id="p0178" num="0178">Further, the car which waits for a long period of time at the boarding floor related with the new landing call is excluded from the selection of the allocation candidate by the car-about-to-leave excluding means 35. Therefore, the travel efficiency of the elevator group can be further improved.</p>
<p id="p0179" num="0179">Moreover, the limit values of the scheduled door-open waiting time period and the prediction boarding time interval are dynamically changed by the means 36 for changing limit value based on traffic flow according to a change in the traffic flow in the building during the up-peak time, the down-peak time, the lunchtime and the like. As a result, the travel of the elevator group according to the change in the traffic flow can be performed. Therefore, the travel efficiency of the elevator group can be further improved.</p>
<p id="p0180" num="0180">Further, even if there is no allocation candidate found by the normal exclusion processing, the selection conditions are relaxed by the selection condition relaxing means 38 to ensure the allocation candidate. As a result, the group supervisory control apparatus main body 100 can be prevented from performing an erroneous operation due to the absence of the allocation candidate.</p>
<p id="p0181" num="0181">Although the same processing as that performed by the car excluding means 31 for excluding car based on door-open time period is performed after the selection condition relaxing means 38 relaxes the selection conditions in the third embodiment, the processing is not limited to the above-mentioned example.</p>
<p id="p0182" num="0182">For example, an instruction of performing the processing again under the relaxed conditions may be transmitted to the car excluding means 31 for excluding car based on door-open time period after the selection condition relaxing means 38 relaxes the selection conditions. Similarly, an instruction of performing the processing again under the relaxed conditions may be transmitted to the means 32 for excluding waiting car based on waiting time period after the selection condition relaxing means 38 relaxes the selection conditions.</p>
<heading id="h0010"><u>Fourth Embodiment</u></heading><!-- EPO <DP n="35"> -->
<p id="p0183" num="0183">In the first embodiment, the travel constant setting section 140 transmits the travel distance information between the corresponding one of the remote landing-call registration devices 11A to 11E, on which the new landing cal operation has been performed, and the boarding positions for all the cars 1A to 1D for the new landing call, and the standard traveling rate information to the allocation candidate selection index calculating section 120.</p>
<p id="p0184" num="0184">On the other hand, in a fourth embodiment, the travel constant setting section 140 transmits information relating to a travel time period of the user in a more detailed fashion to the allocation candidate selection index calculating section 120.</p>
<p id="p0185" num="0185">Moreover, although the remote landing-call registration devices 11A to 11E are located in one area on each landing floor in the building in the first embodiment, the remote landing-call registration devices 11A to 11E are located at a plurality of positions on each landing floor in the building.</p>
<p id="p0186" num="0186">The plurality of positions on each landing floor in the building are, for example, doorways of a plurality of residential rooms, those of a plurality of tenant zones, or those of a plurality of office zones.</p>
<p id="p0187" num="0187">Moreover, an operation portion of each of the remote landing-call registration devices 11A to 11E of the fourth embodiment has a plurality of attribute identification buttons (for example, a wheelchair operation button: not shown) for identifying an attribute of a user regarding whether or not the user is a physically impaired.</p>
<p id="p0188" num="0188">Moreover, when the new landing call operation is performed, a corresponding one of the remote landing-call registration devices 11A to 11E transmits the information relating to the attribute corresponding to the operated attribute identification button together with the request to register the new landing call to the group supervisory control apparatus main body 100.</p>
<p id="p0189" num="0189"><figref idref="f0020">FIG. 20</figref> is a block diagram illustrating the group supervisory control apparatus for the elevators according to the fourth embodiment of the present invention. In <figref idref="f0020">FIG. 20</figref>, the illustration of the allocation candidate selecting section 130, the allocated car determining section 150, the operation command section 160, and the individual car controllers 2A to 2D is omitted. In <figref idref="f0020">FIG. 20</figref>, the travel constant setting section 140 includes: travel distance setting means 41; traveling rate setting means 42; and traveling rate reduction parameter setting means 43.<!-- EPO <DP n="36"> --></p>
<p id="p0190" num="0190">The travel distance setting means 41 stores information of travel distances (walking distances) between the remote landing-call registration devices 11A to 11E located at the plurality of positions in the building and the boarding positions for the cars 1A to 1D on each landing floor as travel distance information.</p>
<p id="p0191" num="0191">Moreover, upon reception of the request to register the new landing call from any one of the remote landing-call registration devices 11A to 11E, the travel distance setting means 41 extracts the travel distance information between the one of the remote landing-call registration devices 11A to 11E, which has issued the registration request, and the boarding positions for all the cars 1A to 1D. Then, the travel distance setting means 41 transmits the extracted travel distance information to (the predicted user arrival time computing means 22 of) the allocation candidate selection index calculating section 120.</p>
<p id="p0192" num="0192">The traveling rate setting means 42 prestores information of a plurality of user traveling rates in association with information of the attributes of the users regarding whether or not the user is physically impaired. The traveling rate for a physically unimpaired person (general user) is, for example, 1.0 m/second, whereas the traveling rate for a physically impaired person is, for example, 0.7 m/second.</p>
<p id="p0193" num="0193">Moreover, upon reception of the attribute identification information from any one of the remote landing-call registration devices 11A to 11E, the traveling rate setting means 42 extracts the traveling rate associated with the attribute of the user.</p>
<p id="p0194" num="0194">The traveling rate reduction parameter setting means 43 prestores the information of the traffic flow in the building (or measures the traffic flow in the building as needed to create statistics thereof). Moreover, upon reception of the request to register the new landing call from any one of the remote landing-call registration devices 11A to 11E, the traveling rate reduction parameter setting means 43 refers to the traffic flow related with the current time on the landing floor, on which the new landing call operation is performed, to set a traveling rate reduction parameter.</p>
<p id="p0195" num="0195">Specifically, the traveling rate reduction parameter setting means 43 sets the traveling rate reduction parameter of less than 1.0 based on the degree of congestion with the users who board and get off the cars on the landing floor on which the new landing call operation is performed, the size of the landing 3, and<!-- EPO <DP n="37"> --> the shape of the landing 3. Then, the traveling rate reduction parameter setting means 43 transmits information of the thus set traveling rate reduction parameter to the traveling rate setting means 42.</p>
<p id="p0196" num="0196">Upon reception of the information of the traveling rate reduction parameter from the traveling rate reduction parameter setting means 43, the traveling rate setting means 42 transmits a value obtained by multiplying the traveling rate of the user by the traveling rate reduction parameter as traveling rate information to (the predicted user arrival time computing means 22 of) the allocation candidate selection index calculating section 120.</p>
<p id="p0197" num="0197">The allocation candidate selection index calculating section 120 calculates the predicted user arrival time based on the travel distance information and the traveling rate information. Specifically, the travel distance, the traveling rate of the user, and the traveling rate reduction parameter, which are set for the travel constant setting section 140, are used in the process of calculating the predicted user arrival time. The other configuration is the same as that of the first or third embodiment.</p>
<p id="p0198" num="0198">Next, the operation of the group supervisory control apparatus main body 100 of the fourth embodiment is described. Here, an operation for setting the travel constant by the group supervisory control apparatus main body 100 is specifically described. <figref idref="f0021">FIG. 21</figref> is a flowchart illustrating the operation of the group supervisory control apparatus main body 100 illustrated in <figref idref="f0020">FIG. 20</figref>.</p>
<p id="p0199" num="0199">First, upon reception of the request to register the landing call from any one of the remote landing-call registration devices 11A to 11E, the group supervisory control apparatus main body 100 sets the travel distance of the user based on the positional relation between one of the remote landing-call registration devices 11A to 11E, which has issued the registration request, and the boarding positions for all the cars on the target landing floor (Step S301).</p>
<p id="p0200" num="0200">Then, the group supervisory control apparatus main body 100 sets the traveling rate reduction parameter from the degree of congestion on the boarding floor based on the traffic flow related with the current time (Step S302). Then, the group supervisory control apparatus main body 100 sets the traveling rate based on the traveling rate associated with the attribute of the user and the traveling rate reduction parameter (Step S303).</p>
<p id="p0201" num="0201">Thereafter, the group supervisory control apparatus main body 100<!-- EPO <DP n="38"> --> calculates the predicted user arrival time based on the thus set travel distance and traveling rate (Step S304). In this manner, the operation for setting the travel constant, which is performed by the group supervisory control apparatus main body 100, is terminated. The other operation is the same as that of the first or third embodiment.</p>
<p id="p0202" num="0202">In the group supervisory control apparatus for the elevators as described above, the travel distances from one of the remote landing-call registration devices located at the plurality of positions on each landing floor in the building, which has issued the request for registration, to the boarding positions for all the cars 1A to 1E are extracted by the travel distance setting means 41.</p>
<p id="p0203" num="0203">With the above-mentioned configuration, the remote landing-call registration devices 11A to 11E can be provided at the plurality of positions on each landing floor in the building. At the same time, the hoistways for the elevators can be provided not in the vicinity of a specific landing but at various locations.</p>
<p id="p0204" num="0204">As a result, the arrangement of the remote landing-call registration devices 11A to 11E and the arrangement of the hoistways for the elevators can be freely designed under the supervision of the group supervisory control apparatus main body 100.</p>
<p id="p0205" num="0205">Moreover, the traveling rate according to the attribute of the user regarding whether or not the user is physically impaired is set by the traveling rate setting means 42. Therefore, an event where the user misses the car or the user arrives at the boarding position for the car earlier than supposed can be avoided.</p>
<p id="p0206" num="0206">Further, the traveling rate according to the degree of congestion in the landing is set by the traveling rate reduction parameter setting means 43. Therefore, an unpleasant event where the user cannot board the allocated car when the landing is crowded can be avoided.</p>
<p id="p0207" num="0207">The travel distance setting means 41 stores the distances between the boarding positions for all the cars 1A to 1D and the positions where the remote landing-call registration devices 11A to 11E are provided as the travel distances in the fourth embodiment.</p>
<p id="p0208" num="0208">In contrast to the example described above, when a part or all of the boarding positions for the cars are provided in a single landing in a concentrated manner, the travel distance setting means 41 may store distances between a<!-- EPO <DP n="39"> --> representative point such as a center of the landing and the remote landing-call registration devices 11A and 11E as the travel distances.</p>
<p id="p0209" num="0209">Moreover, although the traveling rate setting means 42 sets the traveling rate of the user based on the information of the attribute of the user regarding whether or not the user is physically impaired, who has performed the new landing call operation, in the fourth embodiment, the setting of the traveling rate is not limited to the above-mentioned example.</p>
<p id="p0210" num="0210">For example, the traveling rate of the user may be set based on the information of the attribute regarding whether or not the user is accompanied by a pet (dog or the like). Alternatively, an arbitrary traveling rate may be set for each user.</p>
<heading id="h0011"><u>Fifth Embodiment</u></heading>
<p id="p0211" num="0211">In the first embodiment, the allocated car determining section 150 selects the car, which provides the minimum increment in the total waiting time period when the car is allocated to the boarding floor related with the new landing call, from the allocation candidate list to determine the selected car as the allocated car. On the other hand, in the fifth embodiment, the allocated car determining section 150 determines the allocated car from the allocation candidate list based on a different criterion.</p>
<p id="p0212" num="0212"><figref idref="f0022">FIG. 22</figref> is a block diagram illustrating the group supervisory control apparatus for the elevators according to the fifth embodiment of the present invention. In <figref idref="f0022">FIG. 22</figref>, the illustration of the allocation candidate selection index calculating section 120, the travel constant setting section 140, the remote landing-call registration devices 11A to 11E, and the individual car controllers 2A to 2D is omitted.</p>
<p id="p0213" num="0213">In <figref idref="f0022">FIG. 22</figref>, the allocated car determining section 150 includes: allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor; pre-allocated car selecting means 52; pre-allocated car allocation determining means 53; unallocated car selecting means 54; car allocation determining means 55 for determining car allocation based on waiting time period evaluation index; and scheduled stop number limit value relaxing means 56.</p>
<p id="p0214" num="0214">The allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor receives the car number of at<!-- EPO <DP n="40"> --> least one allocation candidate car from the allocation candidate list computing means 37 or the selection condition relaxing means 38.</p>
<p id="p0215" num="0215">Upon reception of the car numbers of a plurality of allocation candidate cars, the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor verifies whether or not there is a car which is scheduled to stop at the boarding floor and the destination floor (exit floor), which are related with the new landing call.</p>
<p id="p0216" num="0216">Then, if there is a car scheduled to stop at the boarding floor and the destination floor, which are related with the new landing call, the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor determines the car as the car allocated to the new landing call.</p>
<p id="p0217" num="0217">Moreover, if there are a plurality of the cars scheduled to stop at the boarding floor and the destination floor, which are related with the new landing call, the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor randomly selects one of the cars or selects the car which is predicted to be the earliest to arrive at the boarding floor related with the new landing call.</p>
<p id="p0218" num="0218">Then, the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor determines the selected car as the allocated car. Further, upon determination of the allocated car, the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor transmits information of the car number of the allocated car to the operation command section 160.</p>
<p id="p0219" num="0219">The pre-allocated car selecting means 52 prestores an initial value of a scheduled stop number limit value Nstop. The initial value of the scheduled stop number limit value Nstop is determined by, for example, the following Expression (7). <maths id="math0007" num="Expression (7)"><math display="block"><mfenced><mrow><mi>N</mi><mi>s</mi><mi>t</mi><mi>o</mi><mi>p</mi><mi> initial value</mi></mrow></mfenced><mo>=</mo><mn>2</mn><mo>×</mo><mfenced><mrow><mi>number of floors present in the traveling direction for the new landing call</mi><mo>,</mo><mi> at which the car can stop</mi></mrow></mfenced><mo>/</mo><mfenced><mi>total number of the cars</mi></mfenced></math><img id="ib0007" file="imgb0007.tif" wi="155" he="26" img-content="math" img-format="tif"/></maths><!-- EPO <DP n="41"> --></p>
<p id="p0220" num="0220">Moreover, the pre-allocated car selecting means 52 performs processing of selecting the allocated car in the case where the allocated car is not determined by the allocation determining means 51 for determining allocation of car with the same boarding floor and destination floor.</p>
<p id="p0221" num="0221">The pre-allocated car selecting means 52 verifies whether or not there is any car which is scheduled to travel in the traveling direction to the boarding floor related with the new landing call, and has the number of scheduled stops in the direction for which the new landing call is registered after the allocation of the new landing call being equal to or less than the scheduled stop number limit value Nstop, among the allocation candidates.</p>
<p id="p0222" num="0222">If there is at least one corresponding car, the pre-allocated car selecting means 52 selects the car from the allocation candidates and transmits information of the car number of the car to the pre-allocated car allocation determining means 53.</p>
<p id="p0223" num="0223">The pre-allocated car allocation determining means 53 determines the car selected by the pre-allocated car selecting means 52 as the allocated car. Here, in the case where the plurality of car numbers of the cars are received from the pre-allocated car selecting means 52, the pre-allocated car allocation determining means 53 determines the car having a minimum absolute value of a difference between the predicted car arrival time at the boarding floor related with the new landing call and the predicted user arrival time of the user who has performed the new landing call as the allocated car.</p>
<p id="p0224" num="0224">Upon determination of the allocated car, the pre-allocated car allocation determining means 53 transmits information of the car number of the allocated car to the operation command section 160.</p>
<p id="p0225" num="0225">Similarly to the pre-allocated car selecting means 52, the unallocated car selecting means 54 prestores the initial value of the scheduled stop number limit value Nstop. The unallocated car selection means 54 also performs the processing of selecting the allocated car in the case where the allocated car is not selected by the pre-allocated car selecting means 52.</p>
<p id="p0226" num="0226">Further, the unallocated car selecting means 54 verifies whether or not there is any car which is not scheduled to travel in the traveling direction to the boarding floor related with the new landing call, and has the number of scheduled stops in the direction for which the new landing call is registered after the<!-- EPO <DP n="42"> --> allocation of the new landing call being equal to or less than the scheduled stop number limit value Nstop, among the allocation candidates.</p>
<p id="p0227" num="0227">Then, if there is at least one corresponding car, the unallocated car selecting means 54 selects the car from the allocation candidates and transmits information of the car number of the car to the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index.</p>
<p id="p0228" num="0228">The car allocation determining means 55 for determining car allocation based on waiting time period evaluation index determines the car selected by the unallocated car selecting means 54 as the allocated car. Here, in the case where the information of the plurality of the car numbers of the cars is received from the unallocated car selecting means 54, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index performs computation processing for the operation schedules of all the cars.</p>
<p id="p0229" num="0229">Specifically, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index computes the predicted car arrival time of each car at the stop floor for each landing call, for each of the cases before and after the allocation of the new landing call.</p>
<p id="p0230" num="0230">Then, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index performs computation expressed by the following Expression (8) based on the predicted car arrival time of each car at the stop floor for each landing call and the predicted user arrival time of the user who is predicted to board each car at the stop floor for each landing call.<maths id="math0008" num="Expression (8)"><math display="block"><mrow><mo>{</mo><mtable columnalign="left"><mtr><mtd><mi mathvariant="italic">WVal</mi><mfenced><mi>k</mi></mfenced><mo>=</mo><mstyle displaystyle="true"><munder><mo>∑</mo><mrow><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>∈</mo><mi mathvariant="italic">HallCall</mi><mfenced><mi>k</mi></mfenced></mrow></munder><mrow><mi mathvariant="italic">Tw</mi><msub><mi>t</mi><mi>k</mi></msub><msup><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mn>2</mn></msup></mrow></mstyle></mtd></mtr><mtr><mtd><mi>w</mi><msub><mi>t</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced><mo>=</mo><mrow><mo>{</mo><mtable><mtr><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>−</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>≥</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced></mrow></mtd></mtr><mtr><mtd><mrow><mi>α</mi><mfenced><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>−</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>&lt;</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced></mrow></mtd></mtr></mtable></mrow></mtd></mtr><mtr><mtd><mi mathvariant="italic">Tw</mi><msub><mi>t</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>=</mo><munder><mi>max</mi><mi>j</mi></munder><mfenced><mrow><mo>|</mo><mrow><mi>w</mi><msub><mi>t</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi><mo>,</mo><mi>j</mi></mrow></mfenced></mrow><mo>|</mo></mrow></mfenced></mtd></mtr></mtable></mrow></math><img id="ib0008" file="imgb0008.tif" wi="150" he="41" img-content="math" img-format="tif"/></maths>
<ul id="ul0004" list-style="none" compact="compact">
<li>where WVal<sub>bef</sub>(k): the waiting time period evaluation index of a car k before the allocation to the new landing call,<!-- EPO <DP n="43"> --></li>
<li>WVal<sub>aft</sub>((k): the waiting time period evaluation index of the car k after the allocation to the new landing call,</li>
<li>CarPT<sub>k</sub>(f, d): the predicted arrival time of the car k traveling in a direction d to a landing floor f,</li>
<li>PSGPT<sub>k</sub>(f, d, j): the predicted user arrival time of the j-th user of the users who are predicted to board the car k traveling in the direction d to the landing floor f, at the boarding position for the car k,</li>
<li>wt<sub>k</sub>(f, d, j): a waiting time period of the user j for the car k,</li>
<li>Twt<sub>k</sub>(f, d): a maximum waiting time period value for the car k traveling in the direction d to the landing floor f.</li>
<li>HallCall(k): a group of registered landing calls for the car k, and</li>
<li>α: a parameter having a standard value of 1.0.</li>
</ul></p>
<p id="p0231" num="0231">In the above-mentioned manner, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index calculates a waiting time period evaluation index WVal(k) for each of the cases before and after the allocation of the car k to the new landing call, that is, WVal<sub>bef</sub>(k) and WVal<sub>aft</sub>(k).</p>
<p id="p0232" num="0232">Then, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index calculates WVal<sub>aft</sub>(k)-WVal<sub>bef</sub>(k), which corresponds to a difference between WVal<sub>aft</sub>(k) and WVal<sub>bef</sub>(k).</p>
<p id="p0233" num="0233">From the result described above, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index determines the car which provides the minimum value of WVal<sub>aft</sub>(k)-WVal<sub>bef</sub>(k) as the allocated car.</p>
<p id="p0234" num="0234">After the determination of the allocated car, the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index transmits the information of the car number of the allocated car to the operation command section 160.</p>
<p id="p0235" num="0235">The scheduled stop number limit value relaxing means 56 increases the scheduled stop number limit value Nstop by one unit in the case where there is no allocated car selected by the unallocated car selecting means 54. Specifically, the scheduled stop number limit value relaxing means 56 sets Nstop = Nstop+1 so as to relax the condition for the scheduled stop number.<!-- EPO <DP n="44"> --></p>
<p id="p0236" num="0236">Then, after the scheduled stop number limit value relaxing means 56 relaxes the condition for the scheduled stop number, the pre-allocated car selecting means 52 and the unallocated car selecting means 54 perform the processing of selecting the allocated car under the relaxed condition.</p>
<p id="p0237" num="0237">The scheduled stop number limit value relaxing means 56 continues relaxing the condition for the scheduled stop number so that the pre-allocated car selecting means 52 and the unallocated car selecting means 54 repeatedly perform the processing of selecting the allocated car until the allocated car is finally determined. The other configuration is the same as that of any one of the first to fourth embodiments.</p>
<p id="p0238" num="0238">Next, the operation of the group supervisory control apparatus main body 100 according to the fifth embodiment is described. Here, the operation for determining the allocated car by the group supervisory control apparatus main body 100 is specifically described. <figref idref="f0023">FIG. 23</figref> is a flowchart illustrating the operation of the group supervisory control apparatus main body 100 illustrated in <figref idref="f0022">FIG. 22</figref>. In <figref idref="f0023">FIG. 23</figref>, the group supervisory control apparatus main body 100 first verifies whether or not there is a car, which is scheduled to stop at the boarding floor and the destination floor (exit floor) related with the new landing call, on the allocation candidate list (Step S401).</p>
<p id="p0239" num="0239">If there is a car which is scheduled to stop at the boarding floor and the destination floor related with the new landing call on the allocation candidate list, the group supervisory control apparatus main body 100 verifies whether or not the number of the corresponding car is plural (Step S402).</p>
<p id="p0240" num="0240">In this step, if the number of the corresponding car is one, the group supervisory control apparatus main body 100 determines the corresponding car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0241" num="0241">On the other hand, if the number of the corresponding car is plural (YES in Step S402), the group supervisory control apparatus main body 100 randomly selects one from the plurality of corresponding cars (Step S404). Then, the group supervisory control apparatus main body 100 determines the selected car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0242" num="0242">If there is no car which is scheduled to stop at the boarding floor and the<!-- EPO <DP n="45"> --> destination floor related with the new landing call on the allocation candidate list (NO in Step S401), the group supervisory control apparatus main body 100 verifies whether or not there is a car which is scheduled to travel based on the traveling direction and the boarding floor, which are related with the new landing call, on the allocation candidate list (Step S405).</p>
<p id="p0243" num="0243">If there is a car which is scheduled to travel based on the traveling direction and the boarding floor, which are related with the new landing call, on the allocation candidate list, the group supervisory control apparatus main body 100 verifies whether or not there is a car which meets the condition for the scheduled stop number limit value Nstop on the allocation candidate list (Step S406).</p>
<p id="p0244" num="0244">If there is a car which meets the condition for the scheduled stop number limit value Nstop on the allocation candidate list (YES in Step S406), the group supervisory control apparatus main body 100 verifies whether or not the number of the corresponding car is plural (Step S407).</p>
<p id="p0245" num="0245">If the number of the corresponding car is one in this step, the group supervisory control apparatus main body 100 determines the corresponding car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0246" num="0246">On the other hand, if the number of the corresponding car is plural (YES in Step S407), the group supervisory control apparatus main body 100 selects the car which provides the minimum absolute value of the difference between the predicted car arrival time and the predicted user arrival time (Step S408). Then, the group supervisory control apparatus main body 100 determines the selected car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0247" num="0247">Further, if there is no car which is scheduled to travel based on the traveling direction and the boarding floor, which are related with the new landing call, on the allocation candidate list (NO in Step S405), the group supervisory control apparatus main body 100 verifies whether or not there is a car which meets the condition for the scheduled stop number limit value Nstop on the allocation candidate list (Step S409).</p>
<p id="p0248" num="0248">If there is a car which meets the condition for the scheduled stop number limit value Nstop on the allocation candidate list (YES in Step S409), the group<!-- EPO <DP n="46"> --> supervisory control apparatus main body 100 verifies whether or not the number of the corresponding car is plural (Step S410).</p>
<p id="p0249" num="0249">If the number of the corresponding car is one in this step, the group supervisory control apparatus main body 100 determines the corresponding car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0250" num="0250">On the other hand, if the number of the corresponding car is plural (YES in Step S410), the group supervisory control apparatus main body 100 performs the computation expressed by the above-mentioned Expression (8) to select the car which provides the minimum waiting time period evaluation index (Step S411). Then, the group supervisory control apparatus main body 100 determines the selected car as the allocated car (Step S403), and then terminates the operation for determining the allocated car.</p>
<p id="p0251" num="0251">If there is no car which meets the condition for the scheduled stop number limit value Nstop on the allocation candidate list (NO in Step S406 or S409), the group supervisory control apparatus main body 100 sets the scheduled stop number limit value Nstop to Nstop+1 (Step S412).</p>
<p id="p0252" num="0252">Then, the group supervisory control apparatus main body 100 verifies whether or not there is a car which is scheduled to travel based on the traveling direction and the boarding floor, which are related with the new landing call, on the allocation candidate list (Step S405), and repeats the same operation until the allocated car is ultimately selected. The other operation is the same as that of the first to fourth embodiments.</p>
<p id="p0253" num="0253">In the group supervisory control apparatus for the elevators as described above, the pre-allocated car selecting means 52 and the unallocated car selecting means 54 use the scheduled stop number limit value to determine the allocated car. As a result, the number of stops made by each of the cars can be reduced to reduce a round-trip time period of each of the cars 1A to 1D. Therefore, the travel efficiency of the elevator group can be improved.</p>
<p id="p0254" num="0254">Moreover, when the plurality of allocation candidates are selected by the unallocated car selecting means 54, the allocated car is determined based on the waiting time period evaluation index in consideration of the travel time of the user by the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index. As a result, the evaluation according to<!-- EPO <DP n="47"> --> the waiting time period after the arrival of the user at the boarding position for the car can be performed. Thus, the allocated car can be determined more appropriately.</p>
<p id="p0255" num="0255">The car which provides the minimum square value (absolute value) of the difference between the predicted car arrival time and the predicted user arrival time is determined as the allocated car by the pre-allocated car allocation determining means 53. As a result, the car and the user can be prevented from waiting at the landing longer than needed. Thus, the travel efficiency of the elevator group can be further improved.</p>
<p id="p0256" num="0256">Although the pre-allocated car selecting means 52 and the unallocated car selecting means 54 select the allocated car based on the prestored scheduled stop number limit value in the fifth embodiment, the selection of the allocated car is not limited thereto. The pre-allocated car selecting means 52 and the unallocated car selecting means 54 may select the allocated car by using the scheduled stop number limit value according to the traffic flow or the boarding floor for which the landing call is made.</p>
<p id="p0257" num="0257">The pre-allocated car allocation determining means 53 determines the car which provides the minimum absolute value of the difference between the predicted car arrival time and the predicted user arrival time as the allocated car in the fifth embodiment.</p>
<p id="p0258" num="0258">In contrast to the example described above, the cases may be classified based on the magnitude relation between the predicted car arrival time CarPT<sub>k</sub>(f, d) of the car traveling in the direction d to the landing floor f and the predicted user arrival time PsgPt<sub>k</sub>(f, d) as expressed by the following Expression (9) so that the pre-allocated car allocation determining means 53 selects the allocated car. In the following Expression (9), β is a parameter having a standard value of 1.0. <maths id="math0009" num="Expression (9)"><math display="block"><mrow><mo>{</mo><mtable columnalign="left"><mtr><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>−</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>≥</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced></mrow></mtd></mtr><mtr><mtd><mrow><mi>β</mi><mfenced><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>−</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced></mrow></mfenced></mrow></mtd><mtd><mrow><mi mathvariant="italic">CarP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced><mo>&lt;</mo><mi mathvariant="italic">PsgP</mi><msub><mi>T</mi><mi>k</mi></msub><mfenced><mrow><mi>f</mi><mo>,</mo><mi>d</mi></mrow></mfenced></mrow></mtd></mtr></mtable></mrow></math><img id="ib0009" file="imgb0009.tif" wi="130" he="21" img-content="math" img-format="tif"/></maths></p>
<p id="p0259" num="0259">Further, although the standard value of α in Expression (8) described above is set to 1.0 for the waiting time period evaluation index car allocation determining section 55 in the fifth embodiment, the value of α may be changed<!-- EPO <DP n="48"> --> according to the type of the floor on which the new landing call is generated, such as the lobby floor or the general floor, or according to the traffic flow during the up-peak time, the down-peak time, the lunchtime or the like.</p>
<p id="p0260" num="0260">For example, on the landing floor such as an entrance floor, which is crowded for boarding the car during the up-peak time, the value of α may be set to about 0.5, which is smaller than the standard value.</p>
<p id="p0261" num="0261">Moreover, although the allocated car is determined based on the difference in waiting time period evaluation index WVal<sub>aft</sub>(k) before the allocation and after the allocation by the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index, the allocated car may be determined based on, for example, an multiobjective evaluation index obtained from the combination of a different index such as an index indicating the degree of congestion in the car, and the waiting time period evaluation index.</p>
<p id="p0262" num="0262">Further, although the sum obtained by the computation for each landing floor and each traveling direction is used as the waiting time period evaluation index in the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index, a square of a difference between the predicted car arrival time and the predicted user arrival time may be computed for each user so that the sum of the squares obtained for each user is used as the waiting time period evaluation index.</p>
<p id="p0263" num="0263">Although the sum of the squares of the differences between the predicted car arrival time and the predicted user arrival time for each landing floor and each traveling direction is used as the waiting time period evaluation index in the car allocation determining means 55 for determining car allocation based on waiting time period evaluation index, the sum of squares of the predicted car arrival times may be used as the waiting time period evaluation index.</p>
<heading id="h0012"><u>Sixth Embodiment</u></heading>
<p id="p0264" num="0264">In the first embodiment, it is the individual car controllers 2A to 2D that mainly perform door opening/closing control for the cars 1A to 1D, respectively. On the other hand, in the sixth embodiment, the group supervisory control apparatus main body 100 generates a door opening/closing command. Based on the door opening/closing command, the individual car controllers 2A to 2D perform the door opening/closing control for the cars 1A to 1D, respectively. Specifically, it is the group supervisory control apparatus main body 100 that<!-- EPO <DP n="49"> --> mainly performs the door opening/closing control for the cars 1A to 1D in the sixth embodiment.</p>
<p id="p0265" num="0265"><figref idref="f0024">FIG. 24</figref> is a block diagram illustrating the group supervisory control apparatus for the elevators according to the sixth embodiment of the present invention. In <figref idref="f0024">FIG. 24</figref>, the illustration of the allocation candidate selecting section 130 and the travel constant setting section 140 is omitted. In <figref idref="f0024">FIG. 24</figref>, the operation command section 160 includes boarding-predicted user list storing means 61 and door opening/closing command means 62.</p>
<p id="p0266" num="0266">Upon generation of the new landing call, the boarding-predicted user list storing means 61 receives the information of the predicted user arrival time of the user who has performed the new landing call operation from the allocation candidate selection index calculating section 120. At the same time, the boarding-predicted user list storing means 61 receives the information of the car number of the allocated car which is determined in response to the new landing call, from the allocated car determining section 150.</p>
<p id="p0267" num="0267">Moreover, the boarding-predicted user list storing means 61 associates the information of the predicted user arrival time received from the allocation candidate selection index calculating section 120 and the information of the car number of the allocated car received from the allocated car determining section 150 with each other to store the associated information as a boarding-predicted user list.</p>
<p id="p0268" num="0268">Further, after the allocated car arrives (provides service) at the boarding floor related with the landing call and then leaves the boarding floor, the boarding-predicted user list storing means 61 deletes the combination of the information of the predicted user arrival time and the information of the car number of the allocated car which are associated with each other from the boarding-predicted user list.</p>
<p id="p0269" num="0269">When any one of the cars 1A to 1D arrives at the boarding floor related with the landing call as a response to the landing call, the door opening/closing command means 62 generates the door opening/closing command based on the boarding-predicted user list which is stored in the boarding-predicted user list storing means 61.</p>
<p id="p0270" num="0270">The door opening/closing command means 62 also transmits the generated door opening/closing command to one of the individual car controllers 2A to 2D,<!-- EPO <DP n="50"> --> which controls the car arriving at the landing floor. Specifically, the door opening/closing command means 62 controls door opening/closing of the car via the individual car controllers 2A to 2D.</p>
<p id="p0271" num="0271">More specifically, the door opening/closing command means 62 performs computation expressed by the following Expression (10) for any one of the cars 1A to 1D, which arrives at the boarding floor related with the landing call, based on the boarding-predicted user list. <maths id="math0010" num="Expression (10)"><math display="block"><mfenced><mrow><mi>last predicted user arrival time on the boarding</mi><mo>−</mo><mi>predicted user list</mi></mrow></mfenced><mo>−</mo><mo>−</mo><mfenced><mi>current time</mi></mfenced></math><img id="ib0010" file="imgb0010.tif" wi="124" he="21" img-content="math" img-format="tif"/></maths></p>
<p id="p0272" num="0272">Specifically, the door opening/closing command means 62 refers to the boarding-predicted user list of the users who are predicted to board the allocated car traveling in a designated direction to the target landing floor to compare the predicted user arrival time of the last user on the boarding-predicted user list and the current time.</p>
<p id="p0273" num="0273">When a value obtained by the result of comparison is equal to or larger than a predetermined time, the door opening/closing command means 62 transmits a door-open continuation command to one of the individual car controllers 2A to 2D, which controls the target car so that the target car keeps the door open until the prediction boarding time of the last user comes.</p>
<p id="p0274" num="0274">At the same time, the door opening/closing command means 62 monitors the difference between the predicted user arrival time of the last user and the current time even while continuously keeping the door of the target car open.</p>
<p id="p0275" num="0275">When the value obtained by the result of comparison expressed by Expression (10) becomes less than the predetermined time, the door opening/closing command means 62 transmits the door-open continuation command to one of the individual car controllers 2A to 2D, which controls the car so that the door remains open for a standard door-open continuation time period of, for example, about 4 seconds, which is set in advance.</p>
<p id="p0276" num="0276">Then, the door opening/closing command means 62 transmits a door-closing start command to the corresponding one of the individual car<!-- EPO <DP n="51"> --> controllers 2A to 2D, which controls the car, immediately after the lapse of the door-open continuation time period.</p>
<p id="p0277" num="0277">Moreover, the door opening/closing command means 62 performs computation expressed by the following Expression (11) for the corresponding one of the cars 1A to 1D, which arrives at the landing floor related with the landing call, based on the boarding-predicted user list. <maths id="math0011" num="Expression (11)"><math display="block"><mfenced><mrow><mi>predicted user arrival time of the first user on the boarding</mi><mo>−</mo><mi>predicted user list</mi></mrow></mfenced><mo>−</mo><mfenced><mi>current time</mi></mfenced></math><img id="ib0011" file="imgb0011.tif" wi="145" he="20" img-content="math" img-format="tif"/></maths></p>
<p id="p0278" num="0278">Specifically, the door opening/closing command means 62 refers to the boarding-predicted user list of the users who are predicted to board the allocated car traveling in the designated direction to the target landing floor to compare the predicted user arrival time of the first user on the boarding-predicted user list and the current time with each other.</p>
<p id="p0279" num="0279">When a value obtained by the result of comparison is equal to or larger than the predetermined time, the door opening/closing command means 62 transmits a door-opening start command to one of the individual car controllers 2A to 2D, which controls the allocated car, so that the opening of the door of the allocated car is completed by (exactly at) the predicted user arrival time of the first user.</p>
<p id="p0280" num="0280">On the other hand, when the value obtained by the result of comparison expressed by Expression (11) is less than the predetermined time, the door opening/closing command means 62 transmits the door opening start command to the corresponding one of the individual car controllers 2A to 2D, which controls the car, immediately after the arrival of the car at the landing floor.</p>
<p id="p0281" num="0281">Therefore, the door opening/closing command means 62 generates the door opening/closing command for the target car based on the predicted user arrival time of the first user or the last user on the boarding-predicted user list. The other configuration is the same as that of any one of the first to fifth embodiments.</p>
<p id="p0282" num="0282">Next, the operation of the group supervisory control apparatus main body 100 according to the sixth embodiment is described. Here, an operation for<!-- EPO <DP n="52"> --> generating the door-open continuation command and the door-closing start command by the group supervisory control apparatus main body 100 is described.</p>
<p id="p0283" num="0283"><figref idref="f0025">FIG. 25</figref> is a flowchart illustrating the operation of the group supervisory control apparatus main body 100 illustrated in <figref idref="f0024">FIG. 24</figref>. In <figref idref="f0025">FIG. 25</figref>, when the new landing call is generated and the allocated car is determined in response to the new landing call, the group supervisory control apparatus main body 100 associates the predicted user arrival time of the user who performs the new landing call operation and the allocated car with each other and stores the result of association in the boarding-predicted user list.</p>
<p id="p0284" num="0284">Then, each time the new landing call is generated and the allocated car is determined in response to the new landing call, the group supervisory control apparatus main body 100 updates the boarding-predicted user list as needed (Step S501).</p>
<p id="p0285" num="0285">Upon arrival of the allocated car at the boarding floor related with the registered landing call, the group supervisory control apparatus main body 100 compares the predicted user arrival time of the last user on the boarding-predicted user list and the current time with each other (Step S502). Then, the group supervisory control apparatus main body 100 verifies whether or not the predicted user arrival time is later by a predetermined time or more than the current time (Step S503).</p>
<p id="p0286" num="0286">If the predicted user arrival time is later by the predetermined time or more than the current time, the group supervisory control apparatus main body 100 generates the door-open continuation command (Step S504) and transmits the door-open continuation command to the corresponding one of the individual car controllers 2A to 2D, which controls the target allocated car.</p>
<p id="p0287" num="0287">In this step, the group supervisory control apparatus main body 100 continuously transmits the door-open continuation command to the corresponding one of the individual car controllers 2A to 2D, which controls the target allocated car, until a time period from the current time to the predicted user arrival time becomes less than the predetermined time.</p>
<p id="p0288" num="0288">On the other hand, when the time period from the current time to the predicted user arrival time becomes less than the predetermined time, the group supervisory control apparatus main body 100 transmits the door-open continuation command to the corresponding one of the individual car controllers 2A to 2D,<!-- EPO <DP n="53"> --> which controls the target allocated car, so that the door of the target allocated car remains open for the door-open continuation time period.</p>
<p id="p0289" num="0289">Then, after the lapse of the door-open continuation time period, the group supervisory control apparatus main body 100 generates the door-closing start command (Step S505) and transmits the door-closing start command to the corresponding one of the individual car controllers 2A to 2D, which controls the target allocated car, so that the door of the target allocated car is closed.</p>
<p id="p0290" num="0290">As a result, the operation for generating the door-open continuation command and the door-closing start command by the group supervisory control apparatus main body 100 is terminated. The other operation is the same as that of any one of the first to fifth embodiments.</p>
<p id="p0291" num="0291">In the group supervisory control apparatus for the elevators as described above, the opening/closing of the door of the car is controlled according to the predicted user arrival time of the user who is predicted to board.</p>
<p id="p0292" num="0292">As a result, the car can start closing the door to leave immediately after the last user boards the car. Therefore, the door-open waiting time period of the car can be reduced to improve the travel efficiency of the elevators. In particular, a travel time of the user from the car boarding to the destination floor can be reduced.</p>
<p id="p0293" num="0293">In the sixth embodiment, the boarding-predicted user list storing means 61 stores the predicted user arrival time of the user who has performed the landing call operation and the car number of the allocated car in association with each other.</p>
<p id="p0294" num="0294">In contrast to the above-mentioned example, the boarding-predicted user list storing means 61 may store only the predicted user arrival time of each of the users who are predicted to be the first and the last to arrive at the boarding position for the target car each time the landing call for each car, each landing floor and each traveling direction is registered.</p>
<p id="p0295" num="0295">In this case, if a new user performs the new landing call operation, which is the same as that of the registered landing call, the stored predicted user arrival times of the first and last users may be updated based on the predicted user arrival time of the new user.</p>
<p id="p0296" num="0296">Moreover, in the sixth embodiment, the door opening/closing command means 62 generates the door-closing start command immediately after the lapse of<!-- EPO <DP n="54"> --> the predicted user arrival time of the user who is predicted to be the last to board. The generation of the door-closing start command is not limited to the above-mentioned example.</p>
<p id="p0297" num="0297">The door opening/closing command means 62 may generate the door-closing start command after lapse of a time period of, for example, about two seconds, which is previously set in consideration of the case where the user misses car.</p>
<p id="p0298" num="0298">Further, in the sixth embodiment, in the case where the predicted car arrival time of the allocated car is earlier than the predicted user arrival time of the user who is predicted to be the first to board, the door opening/closing command means 62 waits for the generation of the door-opening start command until the predicted user arrival time of the user who is predicted to be the first to board comes.</p>
<p id="p0299" num="0299">The generation of the door-opening start command is not limited to the above-mentioned example. The door-opening start command may be generated immediately after the arrival of the allocated car at the target boarding floor.</p>
<p id="p0300" num="0300">Further, in the sixth embodiment, the door opening/closing command means 62 generates the door-closing start command immediately after the predicted user arrival time of the user who is predicted to be the last to board. The generation of the door-closing start command is not limited to the above-mentioned example.</p>
<p id="p0301" num="0301">The door opening/closing command means 62 may use a minimum door-open continuation time period value which is equal to or larger than the value obtained by Expression (10) among a plurality of preset fixed door-open continuation time values to generate the door-closing start command after the lapse of the door-open continuation time period,</p>
<p id="p0302" num="0302">Further, the group supervisory control apparatus main body 100 according to the first to sixth embodiments may be constituted by a computer (not shown) including a processor unit (CPU), a storage section (ROM, RAM, hard disk, or the like), and a signal input/output section.</p>
<p id="p0303" num="0303">The storage section of the computer of the group supervisory control apparatus main body 100 stores programs for realizing the functions of the allocation candidate selection index calculating section 120, the allocation candidate selecting section 130, the travel constant setting section 140, the<!-- EPO <DP n="55"> --> allocated car determining section 150, and the operation command section 160 (functions of each means) therein.</p>
<p id="p0304" num="0304">Moreover, in the first to sixth embodiments, when the landing call operation is performed by the user on any one of the remote landing-call registration devices 11A to 11E, the request to register the landing call is transmitted from the corresponding one of the remote landing-call registration devices 11A to 11E to the group supervisory control apparatus main body 100.</p>
<p id="p0305" num="0305">On the other hand, the remote landing-call registration devices 11A to 11E may have a personal authentication function of reading personal identification information stored on a personal identification medium (for example, IC card, RFID, or the like) to perform personal authentication of the user based on the personal identification information.</p>
<p id="p0306" num="0306">Further, a reader for the above-mentioned personal identification media (for example, IC card, RFID, and the like) may be incorporated as a part of a gate device such as a security gate. Alternatively, the remote landing-call registration devices 11A to 11E may have a biometric personal authentication function of reading biometric information of the user, such as a fingerprint, a voiceprint or a facial image, to perform personal authentication of the user.</p>
<p id="p0307" num="0307">In the above-mentioned cases, the remote landing-call registration devices 11A to 11E may extract information about the landing call which is preset in association with the personal identification information of the personal-authenticated user and then transmit the extracted information to the group supervisory control apparatus main body 100.</p>
<p id="p0308" num="0308">Further, although each of the remote landing-call registration devices 11A to 11E is used as the landing-call registration device in the first to sixth embodiments, the landing-call registration device is not limited to the remote landing-call registration device.</p>
<p id="p0309" num="0309">The landing-call registration device may also be provided in the landing or at a position in proximity to the landing. In this case, the prediction boarding time of the user who has performed the new landing call operation is the new landing call operation time.</p>
<p id="p0310" num="0310">Moreover, although the remote landing-call registration devices 11A to 11E transmit the request to register the landing call including the exit floor for the user (destination floor for the car) to the group supervisory control apparatus main<!-- EPO <DP n="56"> --> body 100 in the first to sixth embodiments, a request to register the traveling direction in place of the exit floor for the user may be transmitted to the group supervisory control apparatus main body 100. In other words, each of the remote landing-call registration devices 11A to 11E may be a landing-call registration device using UP and DOWN buttons.</p>
</description>
<claims id="claims01" lang="en"><!-- EPO <DP n="57"> -->
<claim id="c-en-01-0001" num="0001">
<claim-text>A group supervisory control apparatus for elevators, for supervising a travel of an elevator group including a plurality of cars (1A-ID) to allocate, in response to a request to register a landing call from a landing-call registration device (11A - 11E), one of the plurality of cars (1A - 1D) to a boarding floor and a traveling direction as an allocated car, the boarding floor and the traveling direction being related with the landing call, and then to register the landing call, <b>characterized by</b> the group supervisory control apparatus for elevators comprising:
<claim-text>- an allocation candidate selection index calculating section (120) for calculating, upon generation of a new request to register the landing call, if the landing call for the same boarding floor and the same traveling direction as a boarding floor and a traveling direction related with the new landing call has already been registered, a difference in time between the prediction boarding time of a user who is a last boarding-predicted user among a plurality of users who have performed the registered landing call and the prediction boarding time of a user who has performed the new landing call as a first index; and</claim-text>
<claim-text>- an allocation candidate selecting section (130) for selecting an allocation candidate corresponding to a candidate for the allocated car to be allocated to the new landing call from the plurality of cars, and for excluding the allocated car allocated to the registered landing call from selection of the allocation candidate when the first index calculated by the allocation candidate selection index calculating section is larger than a first allowable value stored in advance.</claim-text></claim-text></claim>
<claim id="c-en-01-0002" num="0002">
<claim-text>The apparatus according to claim 1,<br/>
wherein the allocation candidate selection index calculating section (120) calculates a difference in time between a time at which the user who is a last user to register the landing call among the plurality of users who have performed the registered landing call operates the landing-call registration<!-- EPO <DP n="58"> --> device (11A - 11E) and a time at which the user who has performed the new landing call operates the landing-call registration device as the first index in place of the difference in time between the prediction boarding times of both the users.</claim-text></claim>
<claim id="c-en-01-0003" num="0003">
<claim-text>A group supervisory control apparatus for elevators, for supervising a travel of an elevator group including a plurality of cars (1A-1D) to allocate, in response to a request to register a landing call from a landing-call registration device (11A-11E), one of the plurality of cars (1A-ID) to a boarding floor and a traveling direction as an allocated car, the boarding floor and the traveling direction being related with the landing call, and then to register the landing call, <b>characterized by</b> the group supervisory control apparatus for elevators comprising:
<claim-text>- an allocation candidate selection index calculating section (120) for calculating, upon generation of a new request to register the landing call, if the landing call for the same boarding floor and the same traveling direction as a boarding floor and a traveling direction related with the new landing call has already been registered, a scheduled door-open waiting time period of the allocated car on the boarding floor in a case where the car responds to the new landing call as a second index based on a relation among three times of a predicted arrival time of the allocated car at the boarding floor in response to the registered landing call, a prediction boarding time of a user who has performed the registered landing call for the allocated car, and a prediction boarding time of a user who has performed the new landing call; and</claim-text>
<claim-text>- an allocation candidate selecting section (130) for selecting an allocation candidate corresponding to a candidate for the allocated car to be allocated to the new landing call from the plurality of cars (1A-1D), and for excluding the allocated car allocated to the registered landing call from selection of the allocation candidate when the index calculated by the allocation candidate selection index calculating section (120) is larger than an allowable value stored in advance.</claim-text><!-- EPO <DP n="59"> --></claim-text></claim>
<claim id="c-en-01-0004" num="0004">
<claim-text>The apparatus according to claim 1 or 2,<br/>
wherein upon the generation of the new landing call, the allocation candidate selection index calculating section (120) calculates a scheduled door-open waiting time period of the allocated car on the boarding floor in a case where the car responds to the new landing call as a second index based on a relation among three times of a predicted arrival time of the allocated car at the boarding floor in response to the registered landing call, the prediction boarding time of the user who has performed the registered landing call for the allocated car, and the prediction boarding time of the user who has performed the new landing call; and<br/>
wherein the allocation candidate selecting section (130) excludes the allocated car allocated to the registered landing call from the selection of the allocation candidate in at least one of a case where the first index is larger than the first allowable value and a case where the second index is larger than a second allowable value registered in advance.</claim-text></claim>
<claim id="c-en-01-0005" num="0005">
<claim-text>The apparatus according to claim 4,<br/>
wherein the allocation candidate selecting section (130) changes the second allowable value to a smaller value when the first index calculated by the allocation candidate selection index calculating section (120) is larger than the first allowable value.</claim-text></claim>
<claim id="c-en-01-0006" num="0006">
<claim-text>The apparatus according to claim 4 or 5,<br/>
wherein the allocation candidate selecting section (130) stores at least one set of a plurality of the first allowable values and a plurality of the second allowable values, and can alternatively select one allowable value from the at least one set of the plurality of the first allowable values and the plurality of the second allowable values.</claim-text></claim>
<claim id="c-en-01-0007" num="0007">
<claim-text>The apparatus according to claim 6,<br/>
wherein the allocation candidate selecting section (130) comprises threshold value changing means (36) which prestores information of a traffic flow in a building in which the elevator group is installed; and<br/>
<!-- EPO <DP n="60"> -->wherein the threshold value changing means (36) dynamically changes at least one of the plurality of the first allowable values and the plurality of the second allowable values according to the traffic flow.</claim-text></claim>
<claim id="c-en-01-0008" num="0008">
<claim-text>The apparatus according to any one of claims 1 to 7,<br/>
wherein the allocation candidate selecting section (130) excludes the car from the selection of the allocation candidate when a difference in time between the prediction boarding time of the user who has performed the new landing call and the predicted arrival time of the car at the boarding floor exceeds a limit time stored in advance.</claim-text></claim>
<claim id="c-en-01-0009" num="0009">
<claim-text>The apparatus according to any one of claims 1 to 8,<br/>
further comprising a travel constant setting section (140) which prestores information of travel distances between a position where the landing-call registration device is provided and boarding positions for the plurality of cars (1A - 1 D) on the boarding floor related with the landing-call registration device,<br/>
wherein, upon generation of the request to register the landing call, the allocation candidate selection index calculating section (120) receives the information of the travel distances related with the landing call from the travel constant setting section (140) to use the information of the travel distances in a process of calculating the prediction boarding time of the user who has performed the landing call.</claim-text></claim>
<claim id="c-en-01-0010" num="0010">
<claim-text>The apparatus according to claim 9,<br/>
wherein the travel constant setting section (140) stores information of traveling rates of the plurality of users for each attribute of the plurality of users; and<br/>
wherein, upon the generation of the request to register the new landing call, if information for identifying the attribute is externally input, the allocation candidate selection index calculating section (120) receives the information of the traveling rate related with the attribute from the travel constant setting section (140) to use the information of the traveling rate in a process of calculating the predicted arrival time.<!-- EPO <DP n="61"> --></claim-text></claim>
<claim id="c-en-01-0011" num="0011">
<claim-text>The apparatus according to claim 9 or 10,<br/>
wherein the travel constant setting section (140) prestores information of a plurality of traveling rate reduction parameters corresponding to parameters relating to a traveling rate according to an environment of each of a plurality of landing floors in association with the each of the plurality of landing floors; and<br/>
wherein, upon the generation of the request to register the landing call, the allocation candidate selection index calculating section (120) receives the traveling rate reduction parameter for the boarding floor related with the landing call from the travel constant setting section (140) to use the information of the traveling rate reduction parameter in a process of calculating the predicted arrival time.</claim-text></claim>
<claim id="c-en-01-0012" num="0012">
<claim-text>The apparatus according to any one of claims 1 to 11,<br/>
wherein the allocation candidate selecting section (120) counts a number of users predicted to board or being in each of the plurality of cars (1A - 1D), and excludes the car which is unavailable for the user who has performed the new landing call because of a fully loaded state of the car when the request to register the new landing call is generated, from the selection of the allocation candidate.</claim-text></claim>
<claim id="c-en-01-0013" num="0013">
<claim-text>The apparatus according to any one of claims 1 to 12,<br/>
wherein the allocation candidate selecting section (130) selects, from the plurality of cars (1A - 1D), at least one of the car to which none of the landing call and a car call is allocated and a car from which the landing call and the car call are soon to be deallocated as the allocation candidate.</claim-text></claim>
<claim id="c-en-01-0014" num="0014">
<claim-text>The apparatus according to any one of claims 1 to 13,<br/>
wherein the allocation candidate selecting section (130) comprises selection condition relaxing means (38) for relaxing a selection condition for selecting the allocation candidate from the plurality of cars when the request to register the landing call is generated in a case where all the plurality of cars (1A - 1D) of the elevator group are excluded from the selection of the allocation candidate; and<br/>
wherein the allocation candidate selecting section (130) selects all the plurality<!-- EPO <DP n="62"> --> of cars (1A - 1D) of the elevator group as the allocation candidates in a case where all the plurality of cars (1A - 1D) of the elevator group are excluded from the selection of the allocation candidate even after the selection condition is relaxed by the selection condition relaxing means (38).</claim-text></claim>
<claim id="c-en-01-0015" num="0015">
<claim-text>The apparatus for elevators according to any one of claims 1 to 14,<br/>
wherein upon the generation of the request to register the new landing call, the allocation candidate selecting section (120) excludes the car which starts closing a door to leave the boarding floor related with the new landing call from the selection of the allocation candidate.</claim-text></claim>
<claim id="c-en-01-0016" num="0016">
<claim-text>The apparatus according to any one of claims 1 to 15,<br/>
further comprising:
<claim-text>- pre-allocated car selecting means (52) for selecting the car scheduled to operate to travel based on the traveling direction and the boarding floor, the traveling direction and the boarding floor being related with the new landing call, and having a scheduled stop number corresponding to a number of floors at which the car is scheduled to stop in the traveling direction, the scheduled stop number being equal to or less than a predetermined limit value, from the allocation candidate so that the car is determined as the allocated car; and</claim-text>
<claim-text>- pre-allocated car allocation determining means (53) for determining, in a case where a plurality of the cars are selected by the pre-allocated car selecting means (52), the car providing a minimum absolute value of a difference between a predicted arrival time of each of the plurality of the selected cars at the boarding floor and a prediction boarding time of the user who has performed the new landing call for the each of the plurality of the cars as the allocated car.</claim-text></claim-text></claim>
<claim id="c-en-01-0017" num="0017">
<claim-text>The apparatus according to claim 16,<br/>
further comprising:
<claim-text>- unallocated car selecting means (54) for selecting the car with the scheduled stop number in the traveling direction being equal to or less than the predetermined limit value from the allocation candidate to determine the car<!-- EPO <DP n="63"> --> as the allocated car in a case where the car is not selected from the allocation candidate by the pre-allocated car selecting means (52); and</claim-text>
<claim-text>- waiting time period evaluation index car allocation determining means (55) for supposing, in a case where a plurality of the cars (1A - 1D) are selected by the unallocated car selecting means (54), that the plurality of the cars are allocated to the boarding floor related with the new landing call, and for determining the car providing a minimum sum of square values of differences between the predicted car arrival times and predicted user arrival times at all stop floors at which the car is scheduled to stop for the landing call as the allocated car.</claim-text></claim-text></claim>
<claim id="c-en-01-0018" num="0018">
<claim-text>The apparatus according to claim 16 or 17,<br/>
further comprising:
<claim-text>- boarding-predicted user list storing means (61) for storing information of a car number of the allocated car determined from the allocation candidate and information of the predicted user arrival time of the user predicted to board the allocated car in association with each other as a boarding-predicted user list; and</claim-text>
<claim-text>- door opening/closing command means (62) for calculating a prediction boarding time for the user who is the last to board the car on the each of the plurality of landing floors based on the boarding-predicted user list, and, upon arrival of the car at one of the plurality of landing floors, for causing the car to wait with the door open until the prediction boarding time related with the landing floor comes.</claim-text></claim-text></claim>
<claim id="c-en-01-0019" num="0019">
<claim-text>A group supervisory control apparatus for elevators, for supervising a travel of an elevator group including a plurality of cars (1A-1D) to allocate, in response to a request to register a landing call from a landing-call registration device (11A - 11E), one of the plurality of cars (1A - 1D) to a boarding floor and a traveling direction as an allocated car, the boarding floor and the traveling direction being related with the landing call, and then to register the landing call, <b>characterized by</b> the group supervisory control apparatus for elevators comprising:
<claim-text>- an allocation candidate selection index calculating section (120) for calculating, upon generation of a new request to register the landing call, if<!-- EPO <DP n="64"> --> the landing call for the same boarding floor and the same traveling direction as a boarding floor and a traveling direction related with the new landing call has already been registered, an index for allocating the car to the boarding floor related with the new landing call based on a relation among three times of a predicted arrival time of the allocated car at the boarding floor in response to the registered landing call, a prediction boarding time of a user who has performed the registered landing call for the allocated car, and a prediction boarding time of a user who has performed the new landing call; and</claim-text>
<claim-text>- an allocation candidate selecting section (130) for selecting an allocation candidate corresponding to a candidate for the allocated car to be allocated to the new landing call from the plurality of cars (1A - 1D), and for excluding the allocated car allocated to the registered landing call from selection of the allocation candidate when the index calculated by the allocation candidate selection index calculating section is larger than an allowable value stored in advance,</claim-text>
<claim-text>- wherein the allocation candidate selecting section (130) comprises threshold value changing means (36) which prestore information of a traffic flow in a building in which the elevator group is installed, the threshold value changing means (36) dynamically changing the allowable value according to the traffic flow.</claim-text></claim-text></claim>
</claims>
<claims id="claims02" lang="de"><!-- EPO <DP n="65"> -->
<claim id="c-de-01-0001" num="0001">
<claim-text>Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge zum Überwachen einer Bewegung einer Aufzugsgruppe mit einer Vielzahl von Kabinen (1A - 1D) zum Zuordnen, in Reaktion auf eine Aufforderung, einen Anforderungsruf von einer Anforderungsruf-Registrierungseinrichtung (11A - 11E) zu registrieren, von einer der Vielzahl von Kabinen (1A - 1D) zu einem Einstiegs-Stockwerk und einer Bewegungsrichtung als zugeordnete Kabine, wobei das Einstiegs-Stockwerk und die Bewegungsrichtung mit dem Anforderungsruf zusammenhängen, und dann zum Registrieren des Anforderungsrufs,<br/>
<b><u>dadurch gekennzeichnet</u>,</b><br/>
<b>dass</b> die Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge Folgendes aufweist:
<claim-text>- einen Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) zum Berechnen, und zwar bei Erzeugung einer neuen Aufforderung zum Registrieren des Anforderungsrufs, wenn der Anforderungsruf für dasselbe Einstiegs-Stockwerk und dieselbe Bewegungsrichtung als Einstiegs-Stockwerk und Bewegungsrichtung, die mit dem neuen Anforderungsruf zusammenhängen, schon registriert worden sind, einer Zeitdifferenz zwischen der vorausgesagten Einstiegszeit eines Benutzers, der ein Benutzer ist, für den als Letztes der Einstieg vorausgesagt worden ist, aus der Vielzahl von Benutzern, die den registrierten Anforderungsruf ausgeführt haben und der vorausgesagten Einstiegszeit eines Benutzers, der den neuen Anforderungsruf ausgeführt hat, als einen ersten Index; und</claim-text>
<claim-text>- einen Zuordnungskandidaten-Auswahlbereich (130) zum Auswählen eines Zuordnungskandidaten, der einem Kandidaten für die zugeordnete Kabine, die dem neuen Anforderungsruf zugeordnet werden soll, aus der Vielzahl von Kabinen entspricht, und zum Ausschließen der zugeordneten Kabine, die dem registrierten Anforderungsruf zugeordnet worden ist, von der Auswahl des Zuordnungskandidaten, wenn der erste Index, der mittels des Zuordnungskandidaten-Auswählindex-Berechnungsbereiches<!-- EPO <DP n="66"> --> berechnet worden ist, größer ist als ein erster zulässiger Wert, der im Voraus gespeichert worden ist.</claim-text></claim-text></claim>
<claim id="c-de-01-0002" num="0002">
<claim-text>Vorrichtung nach Anspruch 1,<br/>
wobei der Zuordnungskandidaten-Auswählindex-Berechnungsbereich (120) eine Zeitdifferenz zwischen einer Zeit, bei der der Benutzer, der ein letzter Benutzer zum Registrieren des Anforderungsrufs unter einer Vielzahl von Benutzern ist, die den registrierten Anforderungsruf ausgeführt haben, die Anforderungsruf-Registrierungseinrichtung (11A - 11E) bedient, und einer Zeit, bei der der Benutzer, der den neuen Anforderungsruf ausgeführt hat, die Anforderungsruf-Registrierungseinrichtung bedient, als den ersten Index berechnet, und zwar anstelle der Zeitdifferenz zwischen den vorausgesagten Einstiegszeiten von beiden Benutzern.</claim-text></claim>
<claim id="c-de-01-0003" num="0003">
<claim-text>Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge zum Überwachen einer Bewegung einer Aufzugsgruppe mit einer Vielzahl von Kabinen (1A - 1D) zum Zuordnen, in Reaktion auf eine Aufforderung, einen Anforderungsruf von einer Anforderungsruf-Registrierungseinrichtung (11A - 11E) zu registrieren, von einer der Vielzahl von Kabinen (1A - 1D) zu einem Einstiegs-Stockwerk und einer Bewegungsrichtung als zugeordnete Kabine, wobei das Einstiegs-Stockwerk und die Bewegungsrichtung mit dem Anforderungsruf zusammenhängen, und dann zum Registrieren des Anforderungsrufs,<br/>
<b><u>dadurch gekennzeichnet</u>,</b><br/>
<b>dass</b> die Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge Folgendes aufweist:
<claim-text>- einen Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) zum Berechnen, und zwar bei Erzeugung einer neuen Aufforderung zum Registrieren des Anforderungsrufs, wenn der Anforderungsruf für dasselbe Einstiegs-Stockwerk und dieselbe Bewegungsrichtung als Einstiegs-Stockwerk und Bewegungsrichtung, die mit dem neuen Anforderungsruf zusammenhängen, schon registriert worden sind, einer planmäßigen "Tür-offen"-Wartezeitdauer der zugeordneten Kabine auf dem Einstiegs-Stockwerk, in einem Fall, wenn die Kabine auf den neuen Anforderungsruf reagiert, als einen zweiten Index, und<!-- EPO <DP n="67"> --> zwar basierend auf einem Zusammenhang unter drei Mal einer vorausgesagten Ankunftszeit der zugeordneten Kabine an dem Einstiegs-Stockwerk in Reaktion auf den registrierten Anforderungsruf, einer vorausgesagten Einstiegszeit eines Benutzers, der den registrierten Anforderungsruf für die zugeordnete Kabine ausgeführt hat, und einer vorausgesagten Einstiegszeit eines Benutzers, der den neuen Anforderungsruf ausgeführt hat; und</claim-text>
<claim-text>- einen Zuordnungskandidaten-Auswahlbereich (130) zum Auswählen eines Zuordnungskandidaten, der einem Kandidaten für die zugeordnete Kabine entspricht, die dem neuen Anforderungsruf zugeordnet werden soll, aus der Vielzahl von Kabinen (1A - 1D), und zum Ausschließen der zugeordneten Kabine, die dem registrierten Anforderungsruf zugeordnet worden ist, von der Auswahl des Zuordnungskandidaten, wenn der Index, der mittels des Zuordnungskandidaten-Auswahlindex-Berechnungsbereiches (120) berechnet worden ist, größer ist als ein zulässiger Wert, der im Voraus gespeichert worden ist.</claim-text></claim-text></claim>
<claim id="c-de-01-0004" num="0004">
<claim-text>Vorrichtung nach Anspruch 1 oder 2,<br/>
wobei bei der Erzeugung des neuen Anforderungsrufs, der Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) eine planmäßige "Tür-offen"-Wartezeitdauer der zugeordneten Kabine auf dem Einstiegs-Stockwerk, in einem Fall, wenn die Kabine auf den neuen Anforderungsruf reagiert, als einen zweiten Index berechnet, und zwar basierend auf einem Zusammenhang unter drei Mal einer vorausgesagten Ankunftszeit der zugeordneten Kabine an dem Einstiegs-Stockwerk in Reaktion auf den registrierten Anforderungsruf, der vorausgesagten Einstiegszeit des Benutzers, der den registrierten Anforderungsruf für die zugeordnete Kabine ausgeführt hat, und der vorausgesagten Einstiegs-zeit des Benutzers, der den neuen Anforderungsruf ausgeführt hat; und<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) die zugeordnete Kabine, die dem registrierten Anforderungsruf zugeordnet worden ist, von der Auswahl des Zuordnungskandidaten ausschließt, und zwar zumindest in einem der folgenden Fälle: wenn der erste Index größer ist als der erste zulässige Wert, und wenn der zweite Index größer ist als ein zweiter zulässiger Wert, der im Voraus registriert worden ist.<!-- EPO <DP n="68"> --></claim-text></claim>
<claim id="c-de-01-0005" num="0005">
<claim-text>Vorrichtung nach Anspruch 4,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) den zweiten zulässigen Wert auf einen kleineren Wert abändert, wenn der erste Index, der mittels des Zuordnungskandidaten-Auswahlindex-Berechnungsbereiches (120) berechnet worden ist, größer ist als der erste zulässige Wert.</claim-text></claim>
<claim id="c-de-01-0006" num="0006">
<claim-text>Vorrichtung nach Anspruch 4 oder 5,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) mindestens einen Satz an einer Vielzahl von den ersten zulässigen Werten und einer Vielzahl von den zweiten zulässigen Werten speichert, und alternativ einen zulässigen Wert von dem mindestens einen Satz von der Vielzahl der ersten zulässigen Werte und der Vielzahl der zweiten zulässigen Werte auswählen kann.</claim-text></claim>
<claim id="c-de-01-0007" num="0007">
<claim-text>Vorrichtung nach Anspruch 6,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) eine Grenzwert-Veränderungseinrichtung (36) aufweist, die Informationen über einen Verkehrsfluss in einem Gebäude vorher speichert, in dem die Aufzuggruppe installiert ist; und<br/>
wobei die Grenzwert-Veränderungseinrichtung (36) mindestens einen aus der Vielzahl der ersten zulässigen Werte und der Vielzahl der zweiten zulässigen Werte entsprechend dem Verkehrsfluss dynamisch abändert.</claim-text></claim>
<claim id="c-de-01-0008" num="0008">
<claim-text>Vorrichtung nach einem der Ansprüche 1 bis 7,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) die Kabine von der Auswahl des Zuordnungskandidaten ausschließt, wenn eine Zeitdifferenz zwischen der vorausgesagten Einstiegs-Zeit des Benutzers, der den neuen Anforderungsruf ausgeführt hat, und der vorausgesagten Ankunftszeit der Kabine an dem Einstiegs-Stockwerk eine Grenzzeit überschreitet, die im Voraus gespeichert worden ist.</claim-text></claim>
<claim id="c-de-01-0009" num="0009">
<claim-text>Vorrichtung nach einem der Ansprüche 1 bis 8,<br/>
wobei die Vorrichtung ferner einen Bewegungskonstanten-Vorgabebereich (140) aufweist, der Informationen über Bewegungsdistanzen vorher speichert,<!-- EPO <DP n="69"> --> und zwar zwischen einer Position, wo die Anforderungsruf-Registrierungseinrichtung angeordnet ist, und Einstiegs-Positionen für die Vielzahl von Kabinen (1A - 1D) auf dem Einstiegs-Stockwerk, die mit der Anforderungsruf-Registrierungseinrichtung zusammenhängen,<br/>
wobei, bei der Erzeugung der Aufforderung zum Registrieren des Anforderungsrufs, der Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) die Informationen der Bewegungsdistanzen erhält, die mit dem Anforderungsruf zusammenhängen, und zwar von dem Bewegungskonstanten-Vorgabebereich (140) zum Verwenden der Informationen über die Bewegungsdistanzen in einem Verfahren des Berechnens der vorausgesagten Einstiegszeit des Benutzers, der den Anforderungsruf ausgeführt hat.</claim-text></claim>
<claim id="c-de-01-0010" num="0010">
<claim-text>Vorrichtung nach Anspruch 9,<br/>
wobei der Bewegungskonstanten-Vorgabebereich (140) Informationen über Bewegungsraten der Vielzahl von Benutzern für jede Eigenschaft der Vielzahl von Benutzern speichert; und<br/>
wobei bei der Erzeugung der Aufforderung zum Registrieren des neuen Anforderungsrufs, wenn Informationen zum Identifizieren der Eigenschaft extern eingegeben sind, der Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) die Informationen der Bewegungsrate erhält, die mit der Eigenschaft zusammenhängt, und zwar von dem Bewegungskonstanten-Vorgabebereich (140) zum Verwenden der Informationen der Bewegungsrate in einem Verfahren zum Berechnen der vorausgesagten Ankunftszeit.</claim-text></claim>
<claim id="c-de-01-0011" num="0011">
<claim-text>Vorrichtung nach Anspruch 9 oder 10,<br/>
wobei der Bewegungskonstanten-Vorgabebereich (140) Informationen von einer Vielzahl von Bewegungsraten-Reduzierungsparametern vorher speichert, die Parametern entsprechen, die mit einer Bewegungsrate gemäß einer Umgebung von jedem der Vielzahl von Ankunfts-Stockwerken zusammenhängen, und zwar in Verbindung mit jedem der Vielzahl von Ankunfts-Stockwerken; und wobei, bei der Erzeugung der Aufforderung zum Registrieren des Anforderungsrufs, der Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) die Bewegungsraten-Reduktionsparameter für das Einstiegs-Stockwerk erhält,<!-- EPO <DP n="70"> --> die mit dem Anforderungsruf von dem Bewegungskonstanten-Vorgabebereich (140) zusammenhängen, zum Verwenden der Informationen der Bewegungsraten-Reduzierungsparameter in einem Verfahren zum Berechnen der vorausgesagten Ankunftszeit.</claim-text></claim>
<claim id="c-de-01-0012" num="0012">
<claim-text>Vorrichtung nach einem der Ansprüche 1 bis 11,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) eine Anzahl an Benutzern zählt, die vorausgesagt sind, in die jeweilige der Vielzahl von Kabinen (1A - 1D) einzusteigen oder bereits darin zu sein, und die Kabine von der Auswahl des Zuordnungskandidaten ausschließt, die für den Benutzer nicht verfügbar ist, der den neuen Anforderungsruf ausgeführt hat, aufgrund eines voll beladenen Zustands der Kabine, wenn die Aufforderung zum Registrieren des neuen Anforderungsrufs erzeugt worden ist.</claim-text></claim>
<claim id="c-de-01-0013" num="0013">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 12,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) von der Vielzahl von Kabinen (1A - 1D) mindestens eine der folgenden Kabinen als Zuordnungskandidat auswählt: eine Kabine, der weder der Anforderungsruf noch ein Kabinenruf zugeordnet ist, und eine Kabine, von der der Anforderungsruf und der Kabinenruf als Zuordnungskandidat bald freigegeben werden.</claim-text></claim>
<claim id="c-de-01-0014" num="0014">
<claim-text>Vorrichtung nach einem der Ansprüche 1 bis 13,<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) eine Auswahlbedingung-Lockerungseinrichtung (38) aufweist, und zwar zum Lockern einer Auswahlbedingung zum Auswählen des Zuordnungskandidaten aus der Vielzahl an Kabinen, wenn die Aufforderung zum Registrieren des Anforderungsrufs erzeugt worden ist, in einem Fall, wenn alle von der Vielzahl von Kabinen (1A - 1D) der Aufzugsgruppe von der Auswahl des Zuordnungskandidaten ausgeschlossen sind; und<br/>
wobei der Zuordnungskandidaten-Auswahlbereich (130) alle von der Vielzahl von Kabinen (1A - 1D) der Aufzugsgruppe als Zuordnungskandidaten auswählt, in einem Fall, wenn alle von der Vielzahl von Kabinen (1A - 1D) der Aufzugsgruppe von der Auswahl des Zuordnungskandidaten ausgeschlossen sind, selbst<!-- EPO <DP n="71"> --> nachdem die Auswahlbedingung mittels der Auswahlbedingung-Lockerungseinrichtung (38) gelockert worden ist.</claim-text></claim>
<claim id="c-de-01-0015" num="0015">
<claim-text>Vorrichtung für Aufzüge nach einem der Ansprüche 1 bis 14,<br/>
wobei, bei der Erzeugung der Aufforderung zum Registrieren des neuen Anforderungsrufs, der Zuordnungskandidaten-Auswahlbereich (130) die Kabine von der Auswahl des Zuordnungskandidaten ausschließt, die beginnt, eine Tür zu schließen, um das Einstiegs-Stockwerk zu verlassen, und zwar im Zusammenhang mit dem neuen Anforderungsruf.</claim-text></claim>
<claim id="c-de-01-0016" num="0016">
<claim-text>Vorrichtung nach einem der Ansprüche 1 bis 15,<br/>
wobei die Vorrichtung ferner Folgendes aufweist:
<claim-text>- eine Kabinen-Auswahleinrichtung (52) für im Voraus zugeordnete Kabinen zum Auswählen der Kabine, die für den Einsatz zum Bewegen geplant ist, und zwar basierend auf der Bewegungsrichtung und dem Einstiegs-Stockwerk, wobei die Bewegungsrichtung und das Einstiegs-Stockwerk mit dem neuen Anforderungsruf zusammenhängen, und die eine planmäßige Stopp-Anzahl aufweist, die einer Anzahl an Stockwerken entspricht, bei denen die Kabine in der Bewegungsrichtung planmäßig anhalten soll, wobei die planmäßige Stopp-Anzahl gleich einem oder geringer als ein vorbestimmter Grenzwert ist, und zwar aus dem Zuordnungskandidaten, so dass die Kabine als zugeordnete Kabine bestimmt ist; und</claim-text>
<claim-text>- eine Kabinenzuordnungs-Bestimmungseinrichtung (53) für im Voraus zugeordnete Kabinen zum Bestimmen, in einem Fall, wenn eine Vielzahl der Kabinen mittels der Kabinen-Auswahleinrichtung (52) für im Voraus zugeordnete Kabinen ausgewählt sind, der Kabine als zugeordnete Kabine, die einen minimalen Absolutwert einer Differenz zwischen einer vorausgesagten Ankunftszeit von der jeweiligen der Vielzahl von ausgewählten Kabinen an dem Einstiegs-Stockwerk und einer vorausgesagten Einstiegszeit des Benutzers, der den neuen Anforderungsruf für jede der Vielzahl von Kabinen ausgeführt hat.</claim-text></claim-text></claim>
<claim id="c-de-01-0017" num="0017">
<claim-text>Vorrichtung nach Anspruch 16,<br/>
wobei die Vorrichtung ferner Folgendes aufweist:<!-- EPO <DP n="72"> -->
<claim-text>- eine Kabinen-Auswahleinrichtung (54) für nicht-zugeordnete Kabinen zum Auswählen der Kabine, bei der die planmäßige Stopp-Anzahl in der Bewegungsrichtung gleich dem oder kleiner als der vorbestimmte Grenzwert ist, aus den Zuordnungskandidaten zum Bestimmen der Kabine als zugeordnete Kabine, in einem Fall, wenn die Kabine nicht aus den Zuordnungskandidaten mittels der Kabinen-Auswahleinrichtung (52) für nicht-zugeordnete Kabinen ausgewählt worden ist; und</claim-text>
<claim-text>- eine Wartezeitdauer-Bewertungsindex-Kabinenzuordnungs-Bestimmungseinrichtung (55) zum Annehmen, in einem Fall, wenn eine Vielzahl von Kabinen (1A - 1D) mittels der Kabinen-Auswahleinrichtung (54) für nicht-zugeordnete Kabinen ausgewählt worden ist, dass die Vielzahl von Kabinen dem Einstiegs-Stockwerk zugeordnet worden ist, und zwar in Zusammenhang mit dem neuen Anforderungsruf, und zum Bestimmen der Kabine als zugeordnete Kabine, die eine minimale Summe der Wurzelwerte der Differenzen zwischen den vorausgesagten Kabinen-Ankunftszeiten und den vorausgesagten Benutzer-Ankunftszeiten bei allen Stopp-Stockwerken, bei denen die Kabine für den Anforderungsruf planmäßig anhalten soll.</claim-text></claim-text></claim>
<claim id="c-de-01-0018" num="0018">
<claim-text>Vorrichtung nach Anspruch 16 oder 17,<br/>
wobei die Vorrichtung ferner Folgendes aufweist:
<claim-text>- eine Benutzerlisten-Speichereinrichtung (61) für vorausgesagte Einstiegs-Benutzer zum Speichern von Informationen einer Kabinennummer der zugeordneten Kabine, die mittels des Zuordnungskandidaten bestimmt worden ist, und von Informationen der vorausgesagten Benutzer-Ankunftszeit des Benutzers, der vorausgesagt ist, in die zugeordnete Kabine einzusteigen, und zwar in Verbindung miteinander als Einstiegs-Benutzerliste für vorausgesagte Einstiegs-Benutzer; und</claim-text>
<claim-text>- Tür-Öffnen/Schließen-Befehlseinrichtung (63) zum Berechnen einer vorausgesagten Einstiegszeit für den Benutzer, der der Letzte zum Einsteigen in die Kabine auf dem jeweiligen der Vielzahl von Einstiegs-Stockwerken ist, und zwar basierend auf der Einstiegs-Benutzerliste für vorausgesagte Einstiegs-Benutzer, und bei der Ankunft der Kabine an einem der Vielzahl von Ankunfts-Stockwerken, zum Veranlassen, dass die Kabine mit offenen Türen wartet, bis<!-- EPO <DP n="73"> --> die vorausgesagte Einstiegszeit, die mit dem Ankunfts-Stockwerk zusammenhängt, kommt.</claim-text></claim-text></claim>
<claim id="c-de-01-0019" num="0019">
<claim-text>Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge zum Überwachen einer Bewegung einer Aufzugsgruppe mit einer Vielzahl von Kabinen (1A - 1D) zum Zuordnen, in Reaktion auf eine Aufforderung, einen Anforderungsruf von einer Anforderungsruf-Registrierungseinrichtung (11A - 11E) zu registrieren, von einer der Vielzahl von Kabinen (1A - 1D) zu einem Einstiegs-Stockwerk und einer Bewegungsrichtung als zugeordnete Kabine, wobei das Einstiegs-Stockwerk und die Bewegungsrichtung mit dem Anforderungsruf zusammenhängen, und dann zum Registrieren des Anforderungsrufs,<br/>
<b><u>dadurch gekennzeichnet</u>,</b><br/>
<b>dass</b> die Gruppenüberwachungs-Steuerungsvorrichtung für Aufzüge Folgendes aufweist:
<claim-text>- einen Zuordnungskandidaten-Auswahlindex-Berechnungsbereich (120) zum Berechnen, und zwar bei der Erzeugung einer neuen Aufforderung zum Registrieren des Anforderungsrufs, wenn der Anforderungsruf für dasselbe Einstiegs-Stockwerk und dieselbe Bewegungsrichtung als Einstiegs-Stockwerk und Bewegungsrichtung, die mit dem neuen Anforderungsruf zusammenhängen, schon registriert worden sind, eines Index zum Zuordnen der Kabine zu dem Einstiegs-Stockwerk, das mit dem neuen Anforderungsruf zusammenhängt, basierend auf einem Zusammenhang unter drei Mal einer vorausgesagten Ankunftszeit der zugeordneten Kabine an dem Einstiegs-Stockwerk in Reaktion auf den registrierten Anforderungsruf, einer vorausgesagten Einstiegszeit eines Benutzers, der den registrierten Anforderungsruf für die zugeordnete Kabine ausgeführt hat, und einer vorausgesagten Einstiegszeit eines Benutzers, der den neuen Anforderungsruf ausgeführt hat; und</claim-text>
<claim-text>- einen Zuordnungskandidaten-Auswahlbereich (130) zum Auswählen eines Zuordnungskandidaten, der einem Kandidaten für die zugeordnete Kabine, die dem neuen Anforderungsruf zugeordnet werden soll, aus der Vielzahl von Kabinen (1A - 1D) entspricht, und zum Ausschließen der zugeordneten Kabine, die dem registrierten Anforderungsruf zugeordnet worden ist, von der Auswahl des Zuordnungskandidaten, wenn der Index, der mittels des Zuordnungskandidaten-Auswahlindex-Berechnungsbereiches<!-- EPO <DP n="74"> --> berechnet worden ist, größer ist als ein zulässiger Wert, der im Voraus gespeichert worden ist,</claim-text>
<claim-text>- wobei der Zuordnungskandidaten-Auswahlbereich (130) eine Grenzwert-Veränderungseinrichtung (36) aufweist, die Informationen über einen Verkehrsfluss in einem Gebäude vorher speichert, in dem die Aufzuggruppe installiert ist, wobei die Grenzwert-Veränderungseinrichtung (36) den zulässigen Wert entsprechend dem Verkehrsfluss dynamisch abändert.</claim-text></claim-text></claim>
</claims>
<claims id="claims03" lang="fr"><!-- EPO <DP n="75"> -->
<claim id="c-fr-01-0001" num="0001">
<claim-text>Appareil de commande de supervision de groupe pour ascenseurs, pour superviser un déplacement d'un groupe d'ascenseurs incluant une pluralité de cabines (1A-1D) pour attribuer, en réponse à une demande d'enregistrement d'un appel de palier à partir d'un dispositif d'enregistrement d'appel de palier (11A - 11E), l'une de la pluralité de cabines (1A - 1D) à un étage d'embarquement et une direction de déplacement en tant que cabine attribuée, l'étage d'embarquement et la direction de déplacement étant liés à l'appel de palier, puis pour enregistrer l'appel de palier,<br/>
<b><u>caractérisé par le fait</u> que</b> l'appareil de commande de supervision de groupe pour ascenseurs comprend :
<claim-text>- une section de calcul d'indice de sélection du candidat à l'attribution (120) pour calculer, lors de la génération d'une nouvelle demande d'enregistrement de l'appel de palier, si l'appel de palier pour le même étage d'embarquement et la même direction de déplacement qu'un étage d'embarquement et une direction de déplacement liés au nouvel appel de palier a déjà été enregistré, une différence de temps entre l'heure d'embarquement prévue d'un utilisateur qui est le dernier utilisateur prévu pour l'embarquement parmi une pluralité d'utilisateurs qui ont effectué l'appel de palier enregistré et l'heure d'embarquement prévue d'un utilisateur qui a effectué le nouvel appel de palier en tant que premier indice ; et</claim-text>
<claim-text>- une section de sélection du candidat à l'attribution (130) pour sélectionner un candidat à l'attribution correspondant à un candidat pour la cabine attribuée à attribuer au nouvel appel de palier parmi la pluralité de cabines, et pour exclure la cabine attribuée qui est attribuée à l'appel de palier enregistré de la sélection du candidat à l'attribution lorsque le premier indice calculé par la section de calcul d'indice de sélection du candidat à l'attribution est supérieur à une première valeur admissible stockée à l'avance.</claim-text><!-- EPO <DP n="76"> --></claim-text></claim>
<claim id="c-fr-01-0002" num="0002">
<claim-text>Appareil selon la revendication 1,<br/>
dans lequel la section de calcul d'indice de sélection du candidat à l'attribution (120) calcule une différence de temps entre une heure à laquelle l'utilisateur qui est le dernier utilisateur à enregistrer l'appel de palier parmi la pluralité d'utilisateurs qui ont effectué l'appel de palier enregistré actionne le dispositif d'enregistrement d'appel de palier (11A - 11E) et une heure à laquelle l'utilisateur qui a effectué le nouvel appel de palier actionne le dispositif d'enregistrement d'appel de palier en tant que premier indice à la place de la différence de temps entre les heures d'embarquement prévues des deux utilisateurs.</claim-text></claim>
<claim id="c-fr-01-0003" num="0003">
<claim-text>Appareil de commande de supervision de groupe pour ascenseurs, pour superviser un déplacement d'un groupe d'ascenseurs incluant une pluralité de cabines (1A-1D) pour attribuer, en réponse à une demande d'enregistrement d'un appel de palier à partir d'un dispositif d'enregistrement d'appel de palier (11A-11E), l'une de la pluralité de cabines (1A-1D) à un étage d'embarquement et une direction de déplacement en tant que cabine attribuée, l'étage d'embarquement et la direction de déplacement étant liés à l'appel de palier, puis pour enregistrer l'appel de palier,<br/>
<b><u>caractérisé par le fait</u> que</b> l'appareil de commande de supervision de groupe pour ascenseurs comprend :
<claim-text>- une section de calcul d'indice de sélection du candidat à l'attribution (120) pour calculer, lors de la génération d'une nouvelle demande d'enregistrement de l'appel de palier, si l'appel de palier pour le même étage d'embarquement et la même direction de déplacement qu'un étage d'embarquement et une direction de déplacement liés au nouvel appel de palier a déjà été enregistré, une période d'attente d'ouverture de porte programmée de la cabine attribuée à l'étage d'embarquement dans le cas où la cabine répond au nouvel appel de palier en tant que deuxième indice sur la base d'une relation entre trois temps parmi une heure d'arrivée prévue de la cabine attribuée à l'étage d'embarquement en réponse à l'appel de palier enregistré, une heure d'embarquement prévue d'un utilisateur qui a effectué l'appel de palier enregistré pour la cabine attribuée et une heure d'embarquement prévue d'un utilisateur qui a effectué le nouvel appel de palier ; et</claim-text>
<claim-text>- une section de sélection du candidat à l'attribution (130) pour sélectionner un candidat à l'attribution correspondant à un candidat pour<!-- EPO <DP n="77"> --> la cabine attribuée à attribuer au nouvel appel de palier parmi la pluralité de cabines (1A-1D), et pour exclure la cabine attribuée qui est attribuée à l'appel de palier enregistré de la sélection du candidat à l'attribution lorsque l'indice calculé par la section de calcul d'indice de sélection du candidat à l'attribution (120) est supérieur à une valeur admissible stockée à l'avance.</claim-text></claim-text></claim>
<claim id="c-fr-01-0004" num="0004">
<claim-text>Appareil selon la revendication 1 ou 2,<br/>
dans lequel, lors de la génération du nouvel appel de palier, la section de calcul d'indice de sélection du candidat à l'attribution (120) calcule une période d'attente d'ouverture de porte programmée de la cabine attribuée à l'étage d'embarquement dans le cas où la cabine répond au nouvel appel de palier en tant que deuxième indice sur la base d'une relation entre trois temps parmi une heure d'arrivée prévue de la cabine attribuée à l'étage d'embarquement en réponse à l'appel de palier enregistré, l'heure d'embarquement prévue de l'utilisateur qui a effectué l'appel de palier enregistré pour la cabine attribuée et l'heure d'embarquement prévue de l'utilisateur qui a effectué le nouvel appel de palier ; et<br/>
dans lequel la section de sélection du candidat à l'attribution (130) exclut la cabine attribuée qui est attribuée à l'appel de palier enregistré de la sélection du candidat à l'attribution dans au moins un cas parmi un cas où le premier indice est supérieur à la première valeur admissible et un cas où le deuxième indice est supérieur à une deuxième valeur admissible enregistrée à l'avance.</claim-text></claim>
<claim id="c-fr-01-0005" num="0005">
<claim-text>Appareil selon la revendication 4,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) change la deuxième valeur admissible en une valeur plus petite lorsque le premier indice calculé par la section de calcul d'indice de sélection du candidat à l'attribution (120) est supérieur à la première valeur admissible.</claim-text></claim>
<claim id="c-fr-01-0006" num="0006">
<claim-text>Appareil selon la revendication 4 ou 5,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) stocke au moins un ensemble d'une pluralité des premières valeurs admissibles et d'une pluralité des deuxièmes valeurs admissibles, et peut, en variante, sélectionner une valeur admissible parmi ledit au moins un ensemble de la pluralité des premières valeurs admissibles et de la pluralité des deuxièmes valeurs admissibles.<!-- EPO <DP n="78"> --></claim-text></claim>
<claim id="c-fr-01-0007" num="0007">
<claim-text>Appareil selon la revendication 6,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) comprend un moyen de changement de valeur seuil (36) qui préstocke des informations sur un flux de trafic dans un bâtiment dans lequel le groupe d'ascenseurs est installé ; et<br/>
dans lequel le moyen de changement de valeur seuil (36) change dynamiquement au moins l'une de la pluralité des premières valeurs admissibles et de la pluralité des deuxièmes valeurs admissibles en fonction du flux de trafic.</claim-text></claim>
<claim id="c-fr-01-0008" num="0008">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 7,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) exclut la cabine de la sélection du candidat à l'attribution lorsqu'une différence de temps entre l'heure d'embarquement prévue de l'utilisateur qui a effectué le nouvel appel de palier et l'heure d'arrivée prévue de la cabine à l'étage d'embarquement dépasse un temps limite stocké à l'avance.</claim-text></claim>
<claim id="c-fr-01-0009" num="0009">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 8,<br/>
comprenant en outre une section de réglage de constante de déplacement (140) qui préstocke des informations sur les distances de déplacement entre une position où le dispositif d'enregistrement d'appel de palier est prévu et des positions d'embarquement pour la pluralité de cabines (1A - 1 D) à l'étage d'embarquement lié au dispositif d'enregistrement d'appel de palier, dans lequel, lors de la génération de la demande d'enregistrement de l'appel de palier, la section de calcul d'indice de sélection du candidat à l'attribution (120) reçoit les informations sur les distances de déplacement liées à l'appel de palier de la section de réglage de constante de déplacement (140) pour utiliser les informations sur les distances de déplacement dans un processus de calcul de l'heure d'embarquement prévue de l'utilisateur qui a effectué l'appel de palier.</claim-text></claim>
<claim id="c-fr-01-0010" num="0010">
<claim-text>Appareil selon la revendication 9,<br/>
dans lequel la section de réglage de constante de déplacement (140) stocke des informations sur les vitesses de déplacement de la pluralité d'utilisateurs pour chaque attribut de la pluralité d'utilisateurs ; et dans lequel, lors de la génération de la demande d'enregistrement du nouvel appel de palier, si des informations d'identification de l'attribut sont entrées de façon externe, la<!-- EPO <DP n="79"> --> section de calcul d'indice de sélection du candidat à l'attribution (120) reçoit les informations sur la vitesse de déplacement liées à l'attribut de la section de réglage de constante de déplacement (140) pour utiliser les informations sur la vitesse de déplacement dans un processus de calcul de l'heure d'arrivée prévue.</claim-text></claim>
<claim id="c-fr-01-0011" num="0011">
<claim-text>Appareil selon la revendication 9 ou 10,<br/>
dans lequel la section de réglage de constante de déplacement (140) préstocke des informations sur une pluralité de paramètres de réduction de vitesse de déplacement correspondant à des paramètres liés à une vitesse de déplacement en fonction d'un environnement de chacun d'une pluralité d'étages de palier en association avec chacun de la pluralité d'étages de palier ; et<br/>
dans lequel, lors de la génération de la demande d'enregistrement de l'appel de palier, la section de calcul d'indice de sélection du candidat à l'attribution (120) reçoit le paramètre de réduction de vitesse de déplacement pour l'étage d'embarquement lié à l'appel de palier de la section de réglage de constante de déplacement (140) pour utiliser les informations sur le paramètre de réduction de vitesse de déplacement dans un processus de calcul de l'heure d'arrivée prévue.</claim-text></claim>
<claim id="c-fr-01-0012" num="0012">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 11,<br/>
dans lequel la section de sélection du candidat à l'attribution (120) compte un nombre d'utilisateurs prévus pour embarquer ou se trouver dans chacune de la pluralité de cabines (1A - 1D), et exclut de la sélection du candidat à l'attribution la cabine qui n'est pas disponible pour l'utilisateur qui a effectué le nouvel appel de palier en raison d'un état de pleine charge de la cabine lorsque la demande d'enregistrement du nouvel appel de palier est générée.</claim-text></claim>
<claim id="c-fr-01-0013" num="0013">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 12,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) sélectionne en tant que candidat à l'attribution, parmi la pluralité de cabines (1A - 1D), au moins une cabine parmi une cabine à laquelle ni l'appel de palier ni un appel de cabine n'est attribué et une cabine de laquelle l'appel de palier et l'appel de cabine doivent bientôt être libérés.<!-- EPO <DP n="80"> --></claim-text></claim>
<claim id="c-fr-01-0014" num="0014">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 13,<br/>
dans lequel la section de sélection du candidat à l'attribution (130) comprend un moyen d'assouplissement de condition de sélection (38) pour assouplir une condition de sélection pour sélectionner le candidat à l'attribution parmi la pluralité de cabines lorsque la demande d'enregistrement de l'appel de palier est générée dans le cas où toutes les cabines de la pluralité de cabines (1A - 1D) du groupe d'ascenseurs sont exclues de la sélection du candidat à l'attribution ; et<br/>
dans lequel la section de sélection du candidat à l'attribution (130) sélectionne toutes les cabines de la pluralité de cabines (1A - 1D) du groupe d'ascenseurs en tant que candidats à l'attribution dans le cas où toutes les cabines de la pluralité de cabines (1A - 1D) du groupe d'ascenseurs sont exclues de la sélection du candidat à l'attribution même après que la condition de sélection a été assouplie par le moyen d'assouplissement de condition de sélection (38).</claim-text></claim>
<claim id="c-fr-01-0015" num="0015">
<claim-text>Appareil pour ascenseurs selon l'une quelconque des revendications 1 à 14, dans lequel, lors de la génération de la demande d'enregistrement du nouvel appel de palier, la section de sélection du candidat à l'attribution (120) exclut de la sélection du candidat à l'attribution la cabine qui commence à fermer une porte pour quitter l'étage d'embarquement lié au nouvel appel de palier.</claim-text></claim>
<claim id="c-fr-01-0016" num="0016">
<claim-text>Appareil selon l'une quelconque des revendications 1 à 15,<br/>
comprenant en outre :
<claim-text>- un moyen de sélection de cabine préattribuée (52) pour sélectionner la cabine programmée pour se déplacer sur la base de la direction de déplacement et de l'étage d'embarquement, la direction de déplacement et l'étage d'embarquement étant liés au nouvel appel de palier, et ayant un nombre d'arrêts programmé correspondant à un nombre d'étages auxquels la cabine est programmée pour s'arrêter dans la direction de déplacement, le nombre d'arrêts programmé étant égal ou inférieur à une valeur limite prédéterminée, parmi les candidats à l'attribution, de sorte que la cabine est déterminée en tant que cabine attribuée ; et</claim-text>
<claim-text>- un moyen de détermination d'attribution de cabine préattribuée (53) pour déterminer en tant que cabine attribuée, dans le cas où une pluralité des cabines sont sélectionnées par le moyen de sélection de cabine<!-- EPO <DP n="81"> --> préattribuée (52), la cabine fournissant une valeur absolue minimale d'une différence entre une heure d'arrivée prévue de chacune de la pluralité des cabines sélectionnées à l'étage d'embarquement et une heure d'embarquement prévue de l'utilisateur qui a effectué le nouvel appel de palier pour chacune de la pluralité des cabines.</claim-text></claim-text></claim>
<claim id="c-fr-01-0017" num="0017">
<claim-text>Appareil selon la revendication 16,<br/>
comprenant en outre :
<claim-text>- un moyen de sélection de cabine non attribuée (54) pour sélectionner la cabine dont le nombre d'arrêts programmé dans la direction de déplacement est égal ou inférieur à la valeur limite prédéterminée du candidat à l'attribution pour déterminer la cabine en tant que cabine attribuée dans le cas où la cabine n'est pas sélectionnée parmi les candidats à l'attribution par le moyen de sélection de cabine préattribuée (52) ; et</claim-text>
<claim-text>- un moyen de détermination d'attribution de cabine par l'indice d'évaluation de période d'attente (55) pour supposer, dans le cas où une pluralité des cabines (1A - 1D) sont sélectionnées par le moyen de sélection de cabine non attribuée (54), que la pluralité des cabines sont attribuées à l'étage d'embarquement lié au nouvel appel de palier, et pour déterminer en tant que cabine attribuée la cabine fournissant une somme minimale des carrés des différences entre les heures d'arrivée prévues des cabines et les heures d'arrivée prévues des utilisateurs à tous les étages d'arrêt auxquels la cabine est programmée pour s'arrêter pour l'appel de palier.</claim-text></claim-text></claim>
<claim id="c-fr-01-0018" num="0018">
<claim-text>Appareil selon la revendication 16 ou 17,<br/>
comprenant en outre :
<claim-text>- un moyen de stockage de liste d'utilisateurs prévus pour l'embarquement (61) pour stocker des informations sur un numéro de cabine de la cabine attribuée déterminée parmi les candidats à l'attribution et des informations sur l'heure d'arrivée prévue de l'utilisateur prévu pour embarquer dans la cabine attribuée en association les unes avec les autres sous la forme d'une liste d'utilisateurs prévus pour l'embarquement ; et</claim-text>
<claim-text>- un moyen de commande d'ouverture/fermeture de porte (62) pour calculer un temps d'embarquement prévu pour l'utilisateur qui est le dernier à embarquer dans la cabine à chacun de la pluralité d'étages de<!-- EPO <DP n="82"> --> palier sur la base de la liste d'utilisateurs prévus pour l'embarquement, et, à l'arrivée de la cabine à l'un de la pluralité d'étages de palier, pour faire attendre la cabine avec la porte ouverte jusqu'à ce que l'heure d'embarquement prévue liée à l'étage de palier arrive.</claim-text></claim-text></claim>
<claim id="c-fr-01-0019" num="0019">
<claim-text>Appareil de commande de supervision de groupe pour ascenseurs, pour superviser un déplacement d'un groupe d'ascenseurs incluant une pluralité de cabines (1A-1D) pour attribuer, en réponse à une demande d'enregistrement d'un appel de palier à partir d'un dispositif d'enregistrement d'appel de palier (11A - 11E), l'une de la pluralité de cabines (1A - 1D) à un étage d'embarquement et une direction de déplacement en tant que cabine attribuée, l'étage d'embarquement et la direction de déplacement étant liés à l'appel de palier, puis pour enregistrer l'appel de palier,<br/>
<b><u>caractérisé par le fait</u> que</b> l'appareil de commande de supervision de groupe pour ascenseurs comprend :
<claim-text>- une section de calcul d'indice de sélection du candidat à l'attribution (120) pour calculer, lors de la génération d'une nouvelle demande d'enregistrement de l'appel de palier, si l'appel de palier pour le même étage d'embarquement et la même direction de déplacement qu'un étage d'embarquement et une direction de déplacement liés au nouvel appel de palier a déjà été enregistré, un indice pour attribuer la cabine à l'étage d'embarquement lié au nouvel appel de palier sur la base d'une relation entre trois temps parmi l'heure d'arrivée prévue de la cabine attribuée à l'étage d'embarquement en réponse à l'appel de palier enregistré, une heure d'embarquement prévue d'un utilisateur qui a effectué l'appel de palier enregistré pour la cabine attribuée et une heure d'embarquement prévue d'un utilisateur qui a effectué le nouvel appel de palier ; et</claim-text>
<claim-text>- une section de sélection du candidat à l'attribution (130) pour sélectionner un candidat à l'attribution correspondant à un candidat pour la cabine attribuée à attribuer au nouvel appel de palier parmi la pluralité de cabines (1A - 1D), et pour exclure la cabine attribuée qui est attribuée à l'appel de palier enregistré de la sélection du candidat à l'attribution lorsque l'indice calculé par la section de calcul d'indice de sélection du candidat à l'attribution est supérieur à une valeur admissible stockée à l'avance,</claim-text>
<claim-text>- dans lequel la section de sélection du candidat à l'attribution (130) comprend un moyen de changement de valeur seuil (36) qui préstocke<!-- EPO <DP n="83"> --> des informations sur un flux de trafic dans un bâtiment dans lequel le groupe d'ascenseurs est installé, le moyen de changement de valeur seuil (36) changeant dynamiquement la valeur admissible en fonction du flux de trafic.</claim-text></claim-text></claim>
</claims>
<drawings id="draw" lang="en"><!-- EPO <DP n="84"> -->
<figure id="f0001" num="1"><img id="if0001" file="imgf0001.tif" wi="142" he="182" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="85"> -->
<figure id="f0002" num="2"><img id="if0002" file="imgf0002.tif" wi="164" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="86"> -->
<figure id="f0003" num="3"><img id="if0003" file="imgf0003.tif" wi="157" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="87"> -->
<figure id="f0004" num="4"><img id="if0004" file="imgf0004.tif" wi="135" he="203" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="88"> -->
<figure id="f0005" num="5"><img id="if0005" file="imgf0005.tif" wi="137" he="207" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="89"> -->
<figure id="f0006" num="6"><img id="if0006" file="imgf0006.tif" wi="140" he="203" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="90"> -->
<figure id="f0007" num="7"><img id="if0007" file="imgf0007.tif" wi="133" he="211" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="91"> -->
<figure id="f0008" num="8"><img id="if0008" file="imgf0008.tif" wi="132" he="206" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="92"> -->
<figure id="f0009" num="9"><img id="if0009" file="imgf0009.tif" wi="154" he="219" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="93"> -->
<figure id="f0010" num="10"><img id="if0010" file="imgf0010.tif" wi="160" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="94"> -->
<figure id="f0011" num="11"><img id="if0011" file="imgf0011.tif" wi="152" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="95"> -->
<figure id="f0012" num="12"><img id="if0012" file="imgf0012.tif" wi="150" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="96"> -->
<figure id="f0013" num="13"><img id="if0013" file="imgf0013.tif" wi="139" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="97"> -->
<figure id="f0014" num="14"><img id="if0014" file="imgf0014.tif" wi="66" he="143" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="98"> -->
<figure id="f0015" num="15"><img id="if0015" file="imgf0015.tif" wi="65" he="143" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="99"> -->
<figure id="f0016" num="16"><img id="if0016" file="imgf0016.tif" wi="79" he="152" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="100"> -->
<figure id="f0017" num="17"><img id="if0017" file="imgf0017.tif" wi="119" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="101"> -->
<figure id="f0018" num="18"><img id="if0018" file="imgf0018.tif" wi="159" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="102"> -->
<figure id="f0019" num="19"><img id="if0019" file="imgf0019.tif" wi="151" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="103"> -->
<figure id="f0020" num="20"><img id="if0020" file="imgf0020.tif" wi="146" he="222" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="104"> -->
<figure id="f0021" num="21"><img id="if0021" file="imgf0021.tif" wi="129" he="199" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="105"> -->
<figure id="f0022" num="22"><img id="if0022" file="imgf0022.tif" wi="161" he="222" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="106"> -->
<figure id="f0023" num="23"><img id="if0023" file="imgf0023.tif" wi="152" he="233" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="107"> -->
<figure id="f0024" num="24"><img id="if0024" file="imgf0024.tif" wi="162" he="221" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="108"> -->
<figure id="f0025" num="25"><img id="if0025" file="imgf0025.tif" wi="142" he="229" img-content="drawing" img-format="tif"/></figure>
</drawings>
<ep-reference-list id="ref-list">
<heading id="ref-h0001"><b>REFERENCES CITED IN THE DESCRIPTION</b></heading>
<p id="ref-p0001" num=""><i>This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.</i></p>
<heading id="ref-h0002"><b>Patent documents cited in the description</b></heading>
<p id="ref-p0002" num="">
<ul id="ref-ul0001" list-style="bullet">
<li><patcit id="ref-pcit0001" dnum="JP2005112520A"><document-id><country>JP</country><doc-number>2005112520</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0001">[0004]</crossref></li>
<li><patcit id="ref-pcit0002" dnum="EP0440967A1"><document-id><country>EP</country><doc-number>0440967</doc-number><kind>A1</kind></document-id></patcit><crossref idref="pcit0002">[0005]</crossref></li>
<li><patcit id="ref-pcit0003" dnum="EP1873106A1"><document-id><country>EP</country><doc-number>1873106</doc-number><kind>A1</kind></document-id></patcit><crossref idref="pcit0003">[0006]</crossref></li>
</ul></p>
</ep-reference-list>
</ep-patent-document>
