CN1010670B - The elevator portfolio management system - Google Patents
The elevator portfolio management systemInfo
- Publication number
- CN1010670B CN1010670B CN85108014A CN85108014A CN1010670B CN 1010670 B CN1010670 B CN 1010670B CN 85108014 A CN85108014 A CN 85108014A CN 85108014 A CN85108014 A CN 85108014A CN 1010670 B CN1010670 B CN 1010670B
- Authority
- CN
- China
- Prior art keywords
- railway carriage
- floor
- mentioned
- time
- load
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired
Links
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65B—MACHINES, APPARATUS OR DEVICES FOR, OR METHODS OF, PACKAGING ARTICLES OR MATERIALS; UNPACKING
- B65B15/00—Attaching articles to cards, sheets, strings, webs, or other carriers
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65D—CONTAINERS FOR STORAGE OR TRANSPORT OF ARTICLES OR MATERIALS, e.g. BAGS, BARRELS, BOTTLES, BOXES, CANS, CARTONS, CRATES, DRUMS, JARS, TANKS, HOPPERS, FORWARDING CONTAINERS; ACCESSORIES, CLOSURES, OR FITTINGS THEREFOR; PACKAGING ELEMENTS; PACKAGES
- B65D71/00—Bundles of articles held together by packaging elements for convenience of storage or transport, e.g. portable segregating carrier for plural receptacles such as beer cans or pop bottles; Bales of material
- B65D71/50—Bundles of articles held together by packaging elements for convenience of storage or transport, e.g. portable segregating carrier for plural receptacles such as beer cans or pop bottles; Bales of material comprising a plurality of articles held together only partially by packaging elements formed otherwise than by folding a blank
- B65D71/504—Bundles of articles held together by packaging elements for convenience of storage or transport, e.g. portable segregating carrier for plural receptacles such as beer cans or pop bottles; Bales of material comprising a plurality of articles held together only partially by packaging elements formed otherwise than by folding a blank the element being formed from a flexible sheet provided with slits or apertures intended to be stretched over the articles and adapt to the shape of the article
Landscapes
- Engineering & Computer Science (AREA)
- Mechanical Engineering (AREA)
- Elevator Control (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
In elevator with the target button that is installed on corridor, according to an estimation equation and with regard to each calling of each the target button, each railway carriage is distributed to each catchword, so that select in the estimation of best railway carriage, the present invention is to each calling of based target call button, wait time and the riding time in railway carriage all as the estimation key element, and after the passenger enters railway carriage, according to the degree of crowding of railway carriage.The present invention finishes corridor is called out the railway carriage distribution estimation that responds, so the degree of crowding in the railway carriage has just relaxed by to weighting service time.
Description
The present invention relates to the improvement of elevator portfolio management system, any one in wherein many elevator railway carriages (be called for short down railway carriage) all called out the railway carriage of calling out cooresponding destination with corridor and responded and be its service.
Usually, elevator is structure and operation like this, promptly by pressing the button of going upstairs or go downstairs that is loaded on corridor, the corridor call record is got off, then according to this corridor call distribution railway carriage.
When railway carriage arrived, the passenger entered in the case, record object floor in case, and the target call that is write down is responded, and finishes up to a series of service operations.
The someone proposes some suggestions now, and the control panel of wherein being furnished with the target button is contained in each floor road, therefore presses corresponding button, and destination just obtains record in corridor.Because arrive before each floor (hereinafter being referred to as " initial floor ") of having imported calling at railway carriage, destination is known, thereby has improved the usefulness of portfolio management.For example Japan " open practical new case communique " 53-40843 number (the Official Gazettes of Japanese Utinity Model Application Publication No.53-40843) and " openly speciallyying permit communique " 54-14382 number (Japanese Patent Application Publication No.54-14382) have introduced such system.
These apply for proposing: when selecting railway carriage, also will consider service completion time, so that the service that provides in response to the railway carriage of the record button that is pressed in the corridor and indicates is best, and the destination of response railway carriage will be indicated in corridor.
In the aforesaid existing elevator portfolio management system, considered service completion time, but the degree of crowding of railway carriage is not taken in as the distribution estimation factor that comprises the time of taking a lift, this just goes wrong, and causes to enter the service time (taking a lift the time) that railway carriage begins from the passenger and always can not shorten; Also have a problem to be, people's the sense of feeling bad is increased because railway carriage is crowded.
The objective of the invention is and will address the above problem, for this reason, must provide a kind of elevator portfolio management system, it can relax the crowded of railway carriage, thereby reduces the sense of feeling bad of crowded generation.
According to the elevator portfolio management system that the present invention makes, be furnished with following array apparatus: by the response time to each railway carriage, and the railway carriage response record is selected the device of railway carriage in the estimation of later service time of the target call of corridor; According to the degree of crowding of above-mentioned each railway carriage, to the device of weighting service time; And the device that sends service order to selected above-mentioned each railway carriage of railway carriage selecting arrangement.
In the present invention, according to the response time and the service time of railway carriage, each railway carriage being distributed estimation, wherein, is from railway carriage response beginning service time, is weighted according to its crowded program; Select thereby finish railway carriage, realize above-mentioned purpose of the present invention.
Fig. 1 is a block scheme, and an embodiment of the elevator portfolio management system of making according to the present invention is shown;
Fig. 2 is a block scheme, and expression is according to railway carriage control setup and combination managing device in the elevator portfolio management system of the present invention's making;
Fig. 3 is a planar view, and expression is contained in the corridor the target button in the second layer corridor, and it is used for this elevator portfolio management system;
Fig. 4 is a scheme drawing, and expression is recorded in the floor of the target call record in the target control panel, and this panel is contained in each floor, and they are used for this elevator portfolio management system;
Fig. 5 is a scheme drawing, and expression is the situation of the target button that has write down in each floor road of each railway carriage assign group, and it is used to this elevator portfolio management system;
Fig. 6 (a) is a scheme drawing, is used for the call record of declare record destination, and these callings are that the corridor in this elevator portfolio management system is called out; Fig. 6 (b) is a scheme drawing, is used for illustrating the state of each railway carriage in this eleva-tor bank assembly system; Fig. 6 (c) is a scheme drawing, is used for illustrating in this elevator portfolio management system, and stable condition is really called out in response in to railway carriage distribution floor;
Fig. 7 and 8 is a diagram of circuit, and expression is by the process of this elevator portfolio management system executive routine separately;
Fig. 9 is a scheme drawing, is used for explanation, for all directions, press segmented mode, and the situation of the service time of usefulness each floor of budget of the present invention;
Figure 10 and Figure 11 are diagram of circuits, separately the expression with the cooresponding situation of Fig. 9 under treatment step, wherein, according to the degree of crowding of railway carriage, by the riding time weighting is come the calculation services time.
Introduce embodiments of the invention referring now to accompanying drawing.
Fig. 1 is a block scheme, the configuration of expression one embodiment of the present of invention.Among the figure, number 1 expression service order device, number 2 expressions can respond railway carriage estimating device and railway carriage selecting arrangement.
Can respond railway carriage estimating device and railway carriage selecting arrangement 2, to ticket call, the distribution of each ground estimation railway carriage so that select, distribute railway carriage, and is delivered to service order device 1 to selection result.
According to the output that can respond railway carriage estimating device and railway carriage selecting arrangement 2, service order device 1 is delivered to elevator railway carriage 6B to response instruction.
On the other hand, corridor is called out control panel and is installed on every floor road, is used for writing down corridor and calls out, and when any one the target call button 6A on being arranged in this panel is pressed, just has a signal to deliver to target call recording device 5.And when target call button 6A was pressed, a calling was just write down in this target call recording device 5, and eliminated this record in railway carriage response back.
The output of target call recording device 5 is delivered to response wait time and service time prediction device 4, weighting device 3 and can be responded the railway carriage estimating device and railway carriage selecting arrangement 2.
Response wait time and service time prediction device 4, prediction is also calculated railway carriage and is arrived the used time (response wait time) till that floor of target call of having write down; Prediction and calculating passenger enter railway carriage arrives destination to railway carriage time (equaling riding time service time).Then, device 4 is delivered to these results and can be responded railway carriage estimating device and railway carriage selecting arrangement 2, or weighting device 3.
Below with reference to Fig. 2, introduce railway carriage control setup 10 and combination managing device 11.Introduce railway carriage control setup 10 earlier.This railway carriage control setup 10 is made of microcomputer.In Fig. 2, only illustrate and a cooresponding railway carriage control setup 10 of railway carriage.
Railway carriage control setup 10 in the configuration with before patent application, for example Japan's " openly speciallyying permit communique " 51-53354 number (the official Gazette of Japanese Patent Applocation Laying-open No.51-53354) narrated similar.It is made of central processing unit (calling " CPU " in the following text) 10A, memory device 10B, transmission equipment 10C and conversion equipment 10D.Wherein, (call (" RAM ") in the following text forms 10B by the random access memory of read-only memory (ROM) that comprises stored programme and fixed value data (calling " ROM " in the following text) and temporary transient storage such as result of calculation one class data.
Transmission equipment 10C exchanges the data between the transmission equipment 11C in it and the combination managing device 11.In addition, it and elevator railway carriage 6B(of conversion equipment 10D exchange comprises drive control apparatus) between data.
Introduce the configuration of combination managing device 11 below.This combination managing device 11 also is made of microcomputer, and is similar with railway carriage control setup 10, and it is made of CPU11A, storage equipment 11B, transmission equipment 11C and conversion equipment 11E; Wherein, 11E is connected with corridor the target button 6A.
Corridor the target button 6A and each floor dispose accordingly, like this, do not draw among the target button 6A1(figure) be contained in the ground floor corridor, the target button 6A2 is contained in second layer corridor.
Among transmission equipment 10C and the 11C each is carried out serial transmission, transmits 1 information at every turn.
Fig. 3 represents the corridor the target button 6A2 in the second layer corridor.Among the figure, symbol # 1～#3 represents the corridor door of railway carriage 1～3 respectively; Symbol 1B, 3B and 4B～8B represent respectively and first floor, third story layer and the cooresponding target call of the 4th to the 8th floor (the target call button of second floor is a N/R, because this corridor is at second floor).
Fig. 4 represents target call record floor table H, the H table be provided in the corresponding target control panel of each floor corridor in.Equipment floor i(=1,2 ...) expression is equipped with each floor of control panel, destination j is illustrated in the destination of the control panel in the respective storey i, for example, Hij=" 1 " expression, the target button that appointment will be arrived the j floor is recorded in the corridor of i floor.
Fig. 5 represent to be assigned to each floor road record each railway carriage state of the target button.Distribution state w1～w3 corresponds respectively to railway carriage 1～3, does not draw among the distribution state wk(figure) corresponding to railway carriage K.Each distribution state w1～w3 is similar to Fig. 4, for example w1ij=" 1 " expression, and that railway carriage 1 is distributed to is initial, and (promptly be pressed at the corresponding button of i layer and write down) is the calling of j floor at i floor and target.
The data of table H and table w1～w3 are stored in as DS Data Set in the RAM of combination managing device 11.
Fig. 6 (a), 6(b) and 6(c) expression call out the state write down and the operation conditions of railway carriage.From Fig. 6 (a) as can be seen, four target call are recorded in the corridor of four floors (promptly having only the target call of four corridors to be recorded in the total system), and this is indicated as table H.These callings result from the first, the 5th, the 6th and the 8th floor respectively, and the intended target floor is respectively the 7th, first, the 8th and the 4th floor.
The running state of Fig. 6 (b) expression railway carriage.Now, railway carriage 1 descends at the 4th floor, and has a railway carriage that will arrive the record of first floor to call out (just having a calling to result from the railway carriage 1).Equally, railway carriage 2 also descending, and railway carriage 3 rises at the 4th floor at the third story layer.
Moreover corridor is called out w1～w3 that (being the calling that each corridor produces) distributes to each railway carriage by this way, makes:
1. shown in Fig. 6 (c), railway carriage 1 is distributed to the calling shown in the table w1, promptly sends and target is the calling of the 8th floor at layer 6;
2. shown in the table w2 of Fig. 6 (c), railway carriage 2 is distributed at first floor and is sent and target is the calling of the 7th floor;
3. shown in the table w3 of Fig. 6 (c), railway carriage 3 distributes to respectively at the 5th floor and the 8th floor sends and target is respectively the calling of first floor and the 4th floor.
When destination j was corresponding with corridor i, each railway carriage was delivered in these callings that distributed.When to the corridor call that distributes, each railway carriage writes down corresponding railway carriage target call, or is positioned at each calling of sending that floor of target call.
Supposition indicates corridor the target button of the 6th floor to be pressed in the ground floor corridor now, shown in dashed circle among Fig. 6 (a); Because railway carriage 2 distributed to first floor, therefore, as described in the prior art, railway carriage 2 must be gone out the response of first floor, like this, because response time lacks, so the wait time in corridor is also lacked.Yet, when all situations considered at that time, because railway carriage 2 has been distributed to will be from the calling of first floor to the, seven floors, if above-mentioned target is the 6th floor and the corridor that has just write down that is recorded in first floor calls out and also distributes to railway carriage 1, so will must be at this railway carriage borough chief time waiting to the people that the 7th floor goes.Specifically, the people that arrive the 7th floor must wait at the 6th floor, just can be removed the 7th floor until attending back (promptly walking out this railway carriage) to the people of the 6th floor.Therefore, the time that he not only stays in this railway carriage will prolong (long service time), also takies railway carriage.
On the other hand, railway carriage 1 has been distributed to the corridor calling that will arrive the 8th floor at the 6th floor.Therefore, apparent, in any case railway carriage 1 will stop at the 6th floor, also distribute to railway carriage 1 if go the corridor that has just write down of the 6th floor to call out, this just loses time hardly.
In this case, railway carriage 1 is given in the corridor call distribution of aforementioned firm record, and does not distribute to railway carriage 2, and this obviously is that actv. improves, and generally speaking can improve service quality, and this is by the comprehensive estimate that comprises service time is realized.
Because passenger's their destination before climbing up foregoing railway carriage is known, distribute the estimation factor of time to take in so the riding time in railway carriage also can be used as railway carriage, and service quality also can improve.But from further rising to passenger's service quality, no matter whether railway carriage is crowded, all use identical estimation criterion, that is inappropriate.Therefore should to the riding time weighting, thereby can consider the patient degree of crowding of passenger in each railway carriage in the lump as the estimation factor together with used service time according to the degree of crowding of railway carriage.
Therefore, introduce concrete grammar below.Fig. 7 and 8 some programs of expression, they are stored in the ROM of the storage equipment 11B in the combination managing device 11.In Fig. 7, step S1 finishes the i to the initial floor scanning of sending the corridor calling
oPreset, step S2 carries out the j to the scanning of corridor call targets floor
oPreset.
Then, step S3 is updated to first floor to initial floor scanning, enters i
o+ 1, and step S4 is updated to first floor to destination scanning, enters j
o+ 1.
At step S5, determine whether that handle will be from i
oThe target that floor sends is j
oFloor (is Hi
oj
o) the corridor call record in H table (being shown in Fig. 6's (a)).If this corridor is called out and is recorded, then program enters step S6, there, determine whether to distribute at once a railway carriage to give i
oFloor (in other words, originates in i if any one in the railway carriage 1～3 is assigned at once
oFloor will arrive j
oThe words of the calling of floor).At step S6, call out Hi if determine corridor
oj
oStill be not assigned to a certain railway carriage, then subprogram WARI(is shown in Fig. 8) in step S7 operation, carry out corridor at step S7 and call out Hi
oj
o(promptly originate in i
oThe predetermined j that arrives of floor
oThe corridor calling of floor) distribution.
After subprogram WARI carries out, determine at step S8 whether the scanning of corridor call targets floor is finished, determine at step S9 whether the scanning of corridor being called out initial floor finishes, and this must carry out, control flows is to just arriving outlet.
In the step S7 of Fig. 7 runtime subroutine WARI, control flows shown in Figure 8 to, select to have distributed corridor to call out Hi
oj
o(promptly originate in i
oThe predetermined j that arrives of floor
oThe corridor calling of floor) that railway carriage.
With reference to Fig. 8,, distribute and the removing temporal data in order to store railway carriage at step S11 as presetting before the scanning.Thereafter, maximum value (promptly as the initial value of comparative figure, it is used for and the railway carriage estimated value that calculates is made comparisons, and has minimum estimated value so that determine which railway carriage) is stored in the assorted calculation value estimation of temporary transient storage result's memory device E
oIn.
For railway carriage is scanned, the scanning car case number (CN) is all preset, and upgrades the scanning car case number (CN) one by one at step S12, and subsequently, control flows is carried out data pre-processing together to entering step S13 and S14, so that the data handing that step S15 carries out.
Railway carriage K
oExamination is distributed to will be from i
oFloor is to j
oUnder the situation that the corridor of floor is called out, with regard to all corridors of all railway carriages were called out (Hij), step S13 calculated the time of advent (RKij) of expection.In a word, arrive the time of run of floor separately along direction separately from its present position, can calculate their time of advent at last, method of calculating and prior art similar by predicting each railway carriage.So it is introduced in detail and has omitted.Call out for each corridor, though can calculate the time of advent of expection, but suppose here, under the identical situation of railway carriage service direction (promptly with respect to sending the floor that corridor is called out, any one direction in rising and the descent direction), the corridor that sends from same floor is called out, and be identical the time of advent.
Distribute railway carriage K in examination
oGiving will be from i
oFloor is to j
oUnder the situation of the calling of floor, with regard to all target call (Hij) of all railway carriages, the step S14 calculation services time (SKij).This describes in detail with reference to Fig. 9～11.
Call out Hi for corridor
oj
o, step S15 calculates the distribution estimated value of each railway carriage.
Distribute railway carriage K in examination
oSituation under, this computing comprehensive estimate is called out from all corridors of each corridor and (is comprised and distribute to K
oThe calling of railway carriage) wait time, and the passenger enters the service time behind the railway carriage.
Usually, call out Hij(promptly as calculating, originate in the corridor calling that the i floor will arrive the j floor at step S13 for corridor), RKij represents that railway carriage K arrives the Expected Arrival Time of the initial floor i of corridor calling; Tij represent from the i floor will (continuous time) have pass by since the call record of j floor time; SKij represents after the K railway carriage response corridor calling Hij, by predicting from the i floor to resulting service time of the time of advent of j floor.Distribute each unit WKij of floor to multiply each other among numerical value (RKij+Tij+SKij) and Fig. 5, promptly originate in the corridor calling that the i floor will arrive the j floor when railway carriage K distributes to corridor calling Hij() time, this value is for " 1 ", and when not distributing to it, this value is " 0 ".
That is to say EK
oBe to estimate like this, (corridor that has distributed is called out, may be owing to redistribute i in all corridors callings of wherein writing down, distributing
oFloor is to j
oThe calling of floor and make waiting time and service time lengthening) according to
∑ k ∑ i ∑ j(RKij+Tij+SKij) * WKij, be added to will be from the i floor to the calling of j floor service estimated value (RK
oi
oj
o+ Ti
oj
o+ SK
oi
oj
o) get on.
Though there is not to introduce in detail the method for calculating Tij, the method for calling out this time T of calculating ij according to rise and fall, the method used with common combination managing device system is identical.In addition, because before railway carriage arrives, it is known that destination is recorded in the i floor, therefore, by using corridor starter gear of the present invention, the not only service of initial floor, and according to the service of the destination that is recorded in initial floor, all can give call distribution in the calculating of railway carriage as the key element use of determining.
Then, in step S16, the resulting estimated value EK of determining step S15.Whether less than resulting optimum estimation value EK so far
oIf the former is less than the latter, then in step S17, car case number (CN) K
oBe stored in memory device K, optimum estimation value EK
oBe stored in E
oIn.
When the scanning of judging all railway carriages among the step S18 had finished already, just the best railway carriage K that obtains so far is appointed as the railway carriage that is assigned with at step S19, therefore a series of computings finish.
Should be noted that when a corridor write down a plurality of target call, the passenger may take advantage of that railway carriage that arrives at first.The destination of each railway carriage is all shown, can overcome this shortcoming, described as Japan's " open practical new case communique " 53-40843 number.
Below with reference to Fig. 9～11, introduce the calculation services time (SKij) in detail and according to the method for riding time (the step S14 of Fig. 8 is illustrated) of railway carriage degree of crowding weighting.
Fig. 9 is a scheme drawing, expresses the program of each floor prediction and calculation service time process.As can be seen from this figure, need obtain with the mode of segmentation each process along all directions.As an example, when railway carriage carries the passenger and rises, 1. first handler is that floor from railway carriage 6B place is to top layer, 2. next handler is from top to bottom, 3. last handler is the floor from bottom to this railway carriage place, these programs are carried out continuously, thereby predict service time.This is common processing method.
The handler of Fig. 9 1. in, the prediction railway carriage is narrated with reference to Figure 10 in the step of the load of each floor (just along ascent direction, railway carriage is with respect to the current position of top layer).
In Figure 10, step S21 presets railway carriage scanning, so that scan each railway carriage.Then, step S22 upgrades one to the railway carriage that just is being scanned.Thereafter, be scanning railway carriage K, the processing of program in 1. is performed.Yet if determine in step S23, the railway carriage that just is being scanned withdraws from this program so in carrying descends, and control flow moves on to the program that railway carriage descent direction railway carriage load is predicted in shown in Figure 10 being used for.
In step S23, when definite railway carriage K is not during at descent direction, then control flow moves on to step S24, and S24 is at supposition railway carriage K
oExamination is distributed to from i
oFloor is initial, to j
oHandle under the calling prerequisite of floor.Therefore be K at the scanning car case number (CN)
oSituation under, its tested distributing to from i
oFloor is initial to j
oThe calling of floor.In step S25, as the pretreatment of floor scanning, LO is preset the existing load of railway carriage, and LN is preset " O ", and the scanning floor is preset railway carriage present position floor.Preloading LO is used to refer to the existing load of railway carriage each floor (hereinafter being referred to as " preceding floor ") that how much will persist in above the railway carriage present position, and as shown in Figure 9, when 3. 2. the railway carriage state change to and when 1. changing to 2., this value always is zero from handler.In addition, in the preceding floor situation of getting on or off the bus, the load LN that gets on the bus of preceding floor is used to refer to the remaining load of getting on the bus according to the passenger.
The floor that next step S26 more is scanned the first month of the lunar year is i ← i+1, get on the bus load value L1 and the get off load value LG of step S27 preliminary evaluation on scanning i floor.More particularly, estimate LI: if go the target call number of loft to distribute to the railway carriage K that is in the i floor, then from the i floor in so a kind of mode
WKij will multiply each other with predetermined value (for example 5%).LG tries to achieve in the following manner: for target call that will be from railway carriage position floor to the i floor, the railway carriage position is initial floor ix, and the destination that is assigned with railway carriage K is the i floor, then
WKixi will multiply each other with predetermined value KL.Method of calculating is not limited to above-described; The detector that detects the patronage of waiting for can be loaded in each corridor rightly, so that distribute the load value of each target call according to its output, perhaps adopts learning manipulation, might predict load value from past value.
In step S28, the component of getting off of LO and LN reduces, and more particularly, makes LO reduce to be to finish under such hypothesis, promptly use from the present position floor of railway carriage go top layer (
CKix) railway carriage calls is removed existing load value and is obtained LO component (rectangular distribution), and at top layer, all passengers get off; And LO is recorded in the domination of at least one railway carriage calling of i floor (CKi=" 1 ").Here, CKi represents whether the railway carriage K that is in the i floor existed any railway carriage that has write down to call out at that time.It is certain that LN has been reduced the component LG(that is calculated at step S27, and when LN＜LG, LN is changed to " 0 ").
In step S29, the component LI that obtains at step S27 adds up later in the processing that reduces of step S28.In step S30, the LO+LN value of calculating in step S29 is set as the railway carriage load LUKi that predicts at the i floor.This load must obtain on all directions as shown in Figure 9, and 1. it becomes the value LUKi of ascent direction under the situation in program.
Step S31 judges whether the scanning floor has been updated to loft.When satisfying decision condition, step S24 set to railway carriage K
oExamination distribute and to be disengaged (step S32); In step S33, judge whether all railway carriages all were scanned, so control flow finishes.
2. and execution 3. and above-mentioned similar therefore program repeats no more among Fig. 9.Situation when in addition, its computing also descends with railway carriage is similar.Do not have at railway carriage then to finish load estimation under the situation of whereabouts according to Figure 10.
Be described referring now to Figure 11.
This illustrates the calculation procedure of the service time of each target call, and service time, load was weighted according to railway carriage.In this case, 2. and 3. (similar with Figure 10 situation) has only among Fig. 9 program situation 1. to need explanation, and program, and the situation that railway carriage is in the service that descends needn't explain because the service time under these three kinds of situations similarly method calculate.
Enter after the program shown in Figure 11, in step S41, preset scanning railway carriage (K ← 0), and at next step S42 to its renewal (K ← K+1).Thereafter, the processing of program in 1. that relates among Fig. 9 of scanning railway carriage K is performed.In step S43, if determine railway carriage along the descent direction service, then this program withdraws from, and is calculated, handled service time by another program (not drawing among the figure).
In step S43, when being judged to be "No", that is to say, judge railway carriage K just along the ascent direction service, then control flow moves to step S44, makes pretreatment for floor is scanned in step S44, railway carriage position floor stops floor S as the scanning of setting floor and is preset, " 0 " as being predisposed service time among the scratchpad memory x, and x is used for the accumulating value of service time of storage computation, preset and railway carriage position floor begins layer j as the scanning of destination.
After this, in step S45～S51, in the following manner each is set floor i the service time of each destination j and estimated that promptly each floor is scanned to railway carriage present position floor from the j floor with being reversed.At this, step S45 upgrades destination j, and step S46 presets setting floor i becomes j, so that set floor with respect to destination j reverse scan.Step S47 is new settings floor more oppositely, and step S48 calculates from setting the service time of floor i to the j floor, and promptly in this service time, the passenger who enters railway carriage from the i floor arrives the j floor.At this, from the service time of i floor to the (i+1) floor, again by the accumulating value x (i.e. service time from (i+1) floor to the j floor) of resulting service time till being added to for the last time again.The evaluation method of service time is: promptly according to the load (LUKi) of railway carriage at the i floor, to riding time (RK, i+1 J-RKij) the use functional value f(LUKi) weighting from i floor to the (i+1) floor.Here, as an example, f(LUKi) provide by following formula:
f（LUKi）＝LUKi/β+α
In the formula, α and β are constants, for example, and α=1/2, β=50%(railway carriage load).
In step S49, only distribute to from the i floor and will be to the calling of j floor the time, just the accumulating value x of service time be set at SKij service time when railway carriage.Step S50 judges the scanning result of setting floor, and step S51 judges the end of scan of destination, and step S52 judges the end of scan to railway carriage.
As mentioned above, according to the present invention, after the passenger enters railway carriage,,, carry out the railway carriage Distribution Calculation of calling out in response to corridor by to weighting service time according to the degree of crowding of railway carriage.Therefore can relax the railway carriage degree of crowding, reduce the passenger and enter the sense of feeling bad behind the railway carriage.
Term in the accompanying drawing
Fig. 1:
1 service order device
2 can respond railway carriage estimating device and railway carriage selecting arrangement
3 weighting devices
4 response wait times and service time prediction device
5 specify the catchword indicating device
The 6A corridor is wailed the appointment of control panel and is wailed button
6B elevator railway carriage
Fig. 2:
The 10B memory storage
The 10C transmitting device
The 10D transfer device
The 11B memory storage
The 11C transmitting device
The 11E transfer device
6A specifies and wails button
6B elevator railway carriage (comprising actuating device)
Fig. 4:
(1) initial floor
(2) corridor is specified the indication floor
(3) designated floor
Fig. 5:
(1) initial floor
(2) distribute floor
(3) designated floor
Fig. 7:
(1) inlet
(2) preset the initial floor of scanning
(3) preset the scanning designated floor
(4) upgrade the initial floor of scanning
(5) upgrade the scanning designated floor
(6) indication of the catchword from the i floor to the j floor?
Is not (7) any railway carriage assigned with yet?
(8) railway carriage is distributed to catchword from the i floor to the j floor
Does (9) designated floor scanning finish?
Does (10) initial floor scanning finish?
(11) outlet
Fig. 8:
(1) inlet
(2) presetting before the scanning of car case number (CN)
(3) remove memory allocated
(4) determine to be in the estimated value storage E ← maximum value of maximum value
(5) maximum value
(6) preset the scanning car case number (CN).
(7) upgrade the scanning car case number (CN).
(8) distribute railway carriage K to give from the i floor under the situation of the catchword of j floor in examination, all appointments of all railway carriages are wailed, calculate the time of advent of expection.
(9) distribute railway carriage K to give under the situation of catchword in examination, the calculation services time is wailed in all appointments of all railway carriages from the i floor to room, j building.
(10) to distributing to catchword, calculate the estimated value of railway carriage K from the i floor to the j floor.
(11) is estimated value less than the former?
(12) upgrade distribution railway carriage and renewal estimated value.
Does (13) scanning of car case number (CN) finish?
(14) railway carriage is distributed to catchword from the i floor to the j floor.
(15) outlet
Figure 10:
(1) inlet
(2) preset the scanning railway carriage
(3) upgrade the scanning railway carriage
Does (4) railway carriage K carry passenger's decline?
(5) the railway carriage K that tentatively distributes examination to distribute
(6) presetting before floor scanning
(7) determine initial load
(8) the existing load of railway carriage
(9) remove preceding floor load
(10) scanning load
(11) railway carriage position
(12) upgrade the scanning floor
(13) calculate at the load value of getting on the bus (LI) of i floor and the load value of getting off (LG)
(14) loft
(15) ix=railway carriage position
(16) reduce the get on the bus component of getting off of load (LN) of preloading (LO) and preceding floor at the i floor
(17) component of getting on the bus of i floor is increased in the load of getting on the bus of preceding floor
(18) determine in of the railway carriage load of i floor along ascent direction
Does (19) the scanning floor upgrade and finishes?
(20) examination of removing railway carriage K distributes
Does (21) renewal to railway carriage scanning finish?
(22) outlet
Figure 11:
(1) presetting before floor scanning
(2) determine the scanning stop layer of initial floor
(3) railway carriage position
(4) remove the temporary transient storage of service time
(5) scanning of determining designated floor begins floor
(6) upgrading the scanning floor specifies
(7) preset initial floor scanning
(8) upgrade initial floor scanning
(9) calculating is temporarily stored to the service time of j floor from the i floor
(10) definite service time from the i floor to the j floor
(11) initial floor scanning renewal is finished?
(12) designated floor scanning renewal is finished?
Claims (5)
1, in a kind of portfolio management system of elevator, wherein, the device that record object is called out is contained in each floor road, and in a plurality of railway carriage any one automatically distributed to target call by the target call device,
A kind of elevator portfolio management system comprises:
(a) computer device of response wait time, with regard to each described railway carriage, it is used for calculating the railway carriage response and is equipped with and is used for the wait time spent before the corridor of recording device of controlled target call record;
(b) service time computer device, with regard to each described railway carriage, it is used for the calculation services time, is during this period of time to arrive the time of the destination that is write down from railway carriage response beginning up to its;
(c) a kind of device, it above-mentioned wait time computer device and above-mentioned service time computer device the basis of result of calculation on reception information, and carry out the distribution estimation of each described railway carriage, so that select best railway carriage;
(d) send the device of service order to the selected railway carriage of selecting arrangement, whereby above-mentioned railway carriage assign group target call;
It is characterized in that:
(e) weighting device, it is used for receiving the result of calculation of above-mentioned service time of computer device, then according to the degree of crowding of railway carriage, to aforementioned calculation weighting as a result, and weighted results is sent to described selecting arrangement,
Above-mentioned weighting device, when above-mentioned railway carriage arrived the destination that is recorded, the load of preliminary evaluation railway carriage was then according to the load of above-mentioned railway carriage, to the result of calculation weighting of above-mentioned service time of computer device.
According to the elevator portfolio management system of claim 1, it is characterized in that 2, when the prediction load of railway carriage was heavier, above-mentioned weighting device was used bigger weighted value, when above-mentioned load was light, it used less weighted value.
3, according to the elevator portfolio management system of claim 1, it is characterized in that, above-mentioned weighting device, according to the load of getting on or off the bus at preceding floor of present load of railway carriage and expectation, the prediction railway carriage is in the load of feeling the pulse with the finger-tip mark floor.
According to the elevator portfolio management system of claim 3, it is characterized in that 4, above-mentioned weighting device utilizes in the expectation of the destination of the distributing to railway carriage load of getting on or off the bus, and calculates weighted value.
According to the elevator portfolio management system of claim 1, it is characterized in that 5, above-mentioned weighting device is used for to every section weighting service time, these sections comprise: first terminal floor from the present position floor of railway carriage to the railway carriage service direction; Rightabout second terminal floor from above-mentioned first terminal floor to the railway carriage service direction, and present position floor from second terminal floor to above-mentioned railway carriage.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP256919/84 | 1984-12-05 | ||
| JP256919/1984 | 1984-12-05 | ||
| JP59256919A JPS61136883A (en) | 1984-12-05 | 1984-12-05 | Group controller for elevator |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN85108014A CN85108014A (en) | 1986-05-10 |
| CN1010670B true CN1010670B (en) | 1990-12-05 |
Family
ID=17299197
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN85108014A Expired CN1010670B (en) | 1984-12-05 | 1985-11-02 | The elevator portfolio management system |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JPS61136883A (en) |
| CN (1) | CN1010670B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5892190A (en) * | 1988-01-29 | 1999-04-06 | Hitachi, Ltd. | Method and system of controlling elevators and method and apparatus of inputting requests to the control system |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2607597B2 (en) * | 1988-03-02 | 1997-05-07 | 株式会社日立製作所 | Elevator group management control method |
| JPH075237B2 (en) * | 1988-06-15 | 1995-01-25 | 株式会社日立製作所 | Elevator control equipment |
| JP4888117B2 (en) * | 2005-04-21 | 2012-02-29 | 三菱電機株式会社 | Elevator group management control device |
| CN101546188B (en) * | 2008-03-25 | 2011-02-09 | 上海宝信软件股份有限公司 | Intelligent building energy-saving system based on security system |
| CN108408514B (en) * | 2018-03-14 | 2020-04-21 | 南京理工大学 | Multi-connected machine group control type elevator dispatching method |
| JP7031770B1 (en) * | 2021-03-18 | 2022-03-08 | 三菱電機株式会社 | Group management device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS541978B2 (en) * | 1973-10-08 | 1979-01-31 | ||
| JPS59190171A (en) * | 1983-04-13 | 1984-10-27 | 三菱電機株式会社 | Register for calling of elevator |
-
1984
- 1984-12-05 JP JP59256919A patent/JPS61136883A/en active Granted
-
1985
- 1985-11-02 CN CN85108014A patent/CN1010670B/en not_active Expired
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5892190A (en) * | 1988-01-29 | 1999-04-06 | Hitachi, Ltd. | Method and system of controlling elevators and method and apparatus of inputting requests to the control system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN85108014A (en) | 1986-05-10 |
| JPS61136883A (en) | 1986-06-24 |
| JPH0553712B2 (en) | 1993-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1220614C (en) | Targeted call control for lifts | |
| CN1071698C (en) | Group management control method for elevator | |
| CN101054140A (en) | Lift group management control method and system | |
| CN1097798C (en) | Resource allocation | |
| CN1127442C (en) | Elavator management control apparatus | |
| CN1047997C (en) | Elevator grouping management control method | |
| CN1192962C (en) | Elevator system and its cabin distributing and controlling method | |
| CN1231409C (en) | Optimum managing method for elevator group | |
| CN1030248C (en) | Elevator controlling apparatus | |
| CN1288519C (en) | Robotic system control | |
| CN1197966A (en) | Method and apparatus for optimizing works distribution | |
| CN1898141A (en) | Elevator group management controller | |
| CN1837004A (en) | Elevator group supervisory control system | |
| CN1292529A (en) | Method of partition block for managing computational environment, system and program product | |
| CN1230267A (en) | Scheduling system and scheduling method for reentrant line processes | |
| CN1020577C (en) | Rescuing apparatus in elevators | |
| CN1013760B (en) | Customer participatory elevator control system | |
| CN1325360A (en) | Elevator group controller | |
| CN1838077A (en) | Schedulability determination method and real-time system | |
| CN1829341A (en) | Session processing system, server, communication terminal, session processing method and program | |
| CN1010670B (en) | The elevator portfolio management system | |
| CN1929424A (en) | Method of evaluating channel bandwidth utilization ratio, wireless communication system | |
| CN1552037A (en) | Systems and methods for scheduling reoccuring deliveries and pickups | |
| CN1705610A (en) | Method and elevator scheduler for scheduling plurality of cars of elevator system in building | |
| CN101054141A (en) | Lift group management control method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C13 | Decision | ||
| GR02 | Examined patent application | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C19 | Lapse of patent right due to non-payment of the annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |