This action might not be possible to undo. Are you sure you want to continue?
cn
Optimization Model for Elevator System
Jixian Meng
College of Mathematics, Physics and Information Engineering
Zhejiang Normal University
Zhejiang, Jinhua, P.R.China
Mengle8630219@126.com
Zhenlin Li
College of Mathematics, Physics and Information Engineering
Zhejiang Normal University
Zhejiang, Jinhua, P.R.China
zhenlinworld@163.com
Junlong Lu
College of Mathematics, Physics and Information Engineering
Zhejiang Normal University
Zhejiang, Jinhua, P.R.China
lujunlong_5916020@yahoo.com.cn
Xinzhong Lu*
College of Mathematics, Physics and Information Engineering
Zhejiang Normal University
Zhejiang, Jinhua, P.R.China
luxinzhong@zjnu.cn
Abstract—This paper discusses passenger service in an elevator
system in a highrise commercial building. Taking energy
consumption and passenger satisfaction as the major factors,
models to help improve the traffic during the uppeak is derived
by using planning theory and computer simulation. A number of
examples of quantitative analysis are made in this paper.
(Abstract)
Index system; Run scheme,;Optimization model.(key words)
I. INTRODUCTION
With the development of society, highrise buildings with
intellectual faculties appeared and lifts as vertical transport
tools have been widely used in our life. From the perspective
of service quality, people always hope the elevator waiting
time and total time can be as short as possible. From
perspectives of transmission capacity and energy consumption,
we hope the transmission capacity can be much more
satisfactory and the number of stop time be reduced. In this
paper, we will create the corresponding optimization model to
solve the problem of elevator operation. At the same time we
need to make the following assumptions:
(1) Every people must take elevators to reach the
destination floor.
(2) The probability that one person travels to one floor is
equal and independent.
(3) In any case, the elevator will not be overloaded.
(4) Time cost by every passenger steps inside or outside an
elevator car is a constant, and time cost by an elevator opens or
closes the door is a constant.
(5) During the vertical transport progress, we will not take
other random interferences into account.
(6)In any case, the elevator will not be overloaded.
(7) Time cost by every passenger steps inside or outside an
elevator car is a constant, and time cost by an elevator opens or
closes the door is a constant.
II. COMPARISON OF DIFFERENT TRANSPORT SCHEMES
Usually, a group of elevators are installed in a highrise
commercial building and there are mainly three transport
schemes: random, odd and even floors, partitions running
transport schemes. In order to easily derive the formula,
we make the following provisions: Floor layers is denoted as
N ; The maximum elevator capacity is denoted by C ; The
total number of persons in the building is denoted by U , and
The number of passengers on each floor is denoted by
j
U ; The
energy consumption of every time the elevator stops is denoted
by e, the elevator’s total energy consumption is
E
; Elevator’s
speed is uniform, denoted as v; The time of elevator through
every floor is a constant, denoted as
1
t , and the time of
passenger go in and out to elevators also is a constant, denoted
as
2
t . Using the principle of proportionality to compare the
three operation modes in two elevator.
A. Random Transport Scheme
This scheme allows every elevator to stop at any floor.
The average operating cycle of two elevators is
1 2
(2 ) mt mt + ,
and the population served is 2C .The number of waiting
passengers is
j
mU .
e
S is time of stops˄ 2
e
S m = ˅, we can
get˖
1 2
2 2
e
j tr
S e mt mt c
mU T E
+
= =
(1)
that is :
2011 First International Workshop on Complexity and Data Mining
9780769545851/11 $26.00 © 2011 IEEE
DOI 10.1109/IWCDM.2011.33
99
2011 First International Workshop on Complexity and Data Mining
9780769545851/11 $26.00 © 2011 IEEE
DOI 10.1109/IWCDM.2011.33
112
( )
2
1 2
2
2
2
j
tr
e j
m U t t
T
C
S mU e
E
C
¦ +
=
¦
¦
´
¦
=
¦
¹
(2)
B. Odd and Even Floors Transport Scheme
This scheme requires one of two elevators serves
employees in the odd floors and the other serves those in the
even floors and Floor 1.
1) If m is an even, transport circle of elevators serve
employees in the even floors is
( )
1 2
2 / 2 mt mt + , and in the
odd floors is ( ) ( )
1 2
2 1 / 2 m t mt × ÷ + .
We have:
2
1
2
2 2
2
j tr
t m
mt m e
C
mU T E
+
= =
(3)
that is :
( )
2
1 2
2
4
4
4
j
tr
j
m U t t
T
C
m U e
E
C
¦ +
=
¦
¦
´
¦
=
¦
¹
(4)
2) If m is an odd, transport circle of elevators serve
employees in the odd floors is
1 2
(2 ( 1) ( 1) 2) m t m t × ÷ + ÷ , and
in the even floors
1 2
(2 ( 1) 2) mt m t + + .
We have:
( )
( )
1 2 2
4
4
1
4
j
tr
j
mU mt mt t
T
C
m m U e
E
C
+ + ¦
=
¦
¦
´
+
¦
=
¦
¹
(5)
C. Partitions Running Transport Scheme
The Limits of Partitions is ( 1) (0 1) m u u + < < . An
elevator run the 1th’s floor to the ( 1) ' m th s u + floor. And
another elevator run the ( 2) ' m th s u + floor to the ( 1) ' m th s +
floor. We can get:
2 2
1 2
1
1
(2 )
j
tr
j
m U t t
T
C
m mU e
E
C
u
u u
¦ +
=
¦
¦
´
(
¦ (
=
¦
¹
(6)
such that:
2 2
1 2
1
1
2
1 2
2
2
(2 )
(1 ) (2 (1 ) )
(1 ) (1 )
j
tr
j
j
tr
j
m U t t
T
C
m mU e
E
C
m U t t
T
C
m mU e
E
C
u
u u
u u
u u
¦ +
=
¦
¦
¦
(
(
= ¦
¦
´
÷ ÷ ÷
¦
=
¦
¦
÷ ÷ ( ¦
(
=
¦
¹
(7)
So we have˖
1 2
1 2
max( , )
tr tr tr
T T T
E E E
= ¦
´
= +
¹
(8)
When
*
u u = ,
*
1 2 tr tr tr tr
T T T T = = = ,
1 tr
T is a monotone increasing
function of u , and
2 tr
T is a monotone decreasing function of
u .
* *
1 1 2
* *
2 2 2
,
,
tr tr tr tr
tr
tr tr tr tr
T T T T when
T
T T T T when
u u
u u
¦ > > >
¦
=
´
> > <
¦
¹
(9)
So the optimized running time and the energy consumption of
the elevator stops are:
{ }
* 2 *
1 2
* * * *
(1 ) (2 (1 ) )
[ ] [(1 ) ](1 )
j
tr
j
m U t t
T
C
m m mU e
E
C
u u
u u u u
¦ ÷ ÷ ÷
=
¦
¦
´
+ ÷ ÷
¦
=
¦
¹
(10)
D. Comparison
Because
* 2 2
1 2 1 1 2
2 2 ( ) (4 2 )
2
t
t t t t t u + > + > + ˈwe have
2 2 * 2 2
1 2 1 2 1 2
(2 ) (4 ) ( ) (2 )
2 4
j j j
m U t t m U t t m U t t
C C C
u + + +
> >
and
2 * * * *
{[ ] [(1 ) ](1 )}
2 4
j j j
mU e m U e m m mU e
C C C
ì u u u u + ÷ ÷
> >
So,
Random odd and even Parrtition runnning
Random odd and even Parrtition runnning
T T T
E E E
> > ¦
¦
´
> >
¦
¹
(11)
III. ELEVATOR TRANSPORT SCHEMES DURING UPPEAK
The efficiency of elevator service will increase by
dividing elevators into several groups. Divide all the floors
into two or more groups. Each group is consist of adjacent
floors(Figure1). Elevators of different group will serve
employees in different floors. We design a satisfactory
partitions running transport scheme ˈso that the energy
consumption can be reduced and employees in this commercial
building can enjoy a comfortable elevator service.
F i g u r e 1 .
100 113
Composed by L elevators serve the building. N floors can
be divided into m regions, and An elevator services a region.
The first group elevators serve, 2 F ,ĂĂ
1
Fn ;
The second group elevators serve,
1
1 Fn + ,ĂĂ
2
Fn ;
The ith group elevators serve,
1
1
i
Fn
÷
+ ,ĂĂ
i
Fn ;
Themth group elevators serve,
1
1
m
Fn
÷
+ ,ĂĂFN;
Where
1
n ˈ
2
n ˈ
ˈ
i
n ˈ
ˈ
1 m
n
÷
, and
N should meet:
1 2 1
1
i m
n n n n N
÷
< < < < < .
The aim of dynamic partition is to find the optimum values
of n˄
1
n ˈ
ˈ
1 m
n
÷
˅.
A. Elevator Roundtrip Time
During uppeak, passengers arrive randomly at an entrance
floor and travel to upper floors. The time an elevator spends
traveling up and back down to the entrance floor is called the
roundtrip time. Roundtrip time includes:
1. Transport time between floors:
( ) 2
i v
E H t ˈwhere
v
h
t
v
= ;
2. Time cost by an elevator opens or closes the door:
( ) ( )
1
i s
E S t + ;
3. Time cost by a passenger steps inside or outside an
elevator car: 2
p
Ct .
B. Derivation of ( )
i
E S
If a passenger works in the floor severed by the ith group
elevators, the probability that he travels to floor j is
1
1
ij
i i
P
n n
÷
=
÷
(12)
As for C passengers, the probability that more than one
will travel to floor j is
1
1
1 1
C
i i
P
n n
÷
 
= ÷ ÷

÷
\ .
(13)
So we can get,
( ) ( )
1
1
1
1 1
C
i i i
i i
E S n n
n n
÷
÷
(
 
( = ÷ ÷ ÷

÷
(
\ .
¸ ¸
(14)
C. Derivation of ( )
i
E H
The probability that a passenger gets out of an elevator
before floor
1 i
k n
÷
+
is
1
1
i
k n
i i
k
P
n n
÷
+
÷
=
÷
(15)
And the probability all the passengers get out of an
elevator before floor
1 i
k n
÷
+ is
1
1
'
i
C
k n
i i
k
P
n n
÷
+
÷
 
=

÷
\ .
(16)
So we have
( )
1
1
1
1 1
1
i i
C C
n n
i i
k
i i i i
k k
E H k n
n n n n
÷
÷
÷
=
÷ ÷
(
    ÷
( = ÷ +
 
÷ ÷
(
\ . \ .
¸ ¸
¿
(17)
From the above analysis the transport circles:
( ) ( ) ( )
( )
C
1
1
1 1 1
1
1
2 1 2
1
=2
1
1 1 1 2
i i
i i v i s p
C C
n n
v i
k i i i i
C
s i i p
i i
T E H t E S t Ct
k k
t k n
n n n n
t n n Ct
n n
÷
÷
÷
= ÷ ÷
÷
÷
= + + +
¦ ¹ (
    ÷ ¦ ¦
( ÷ +
´ `  
÷ ÷
(
\ . \ . ¦ ¦
¸ ¸ ¹
¦ ¹ (
 
¦ ¦
( + ÷ ÷ ÷ + +
´ ` 
÷
(
\ . ¦ ¦
¸ ¸ ¹
¿
(18)
D. Elevator Transport Time
If
i
f
is the quantity of elevators in group i ˈso the
interval
i
T
*
is˖
C i
iG
i
T
T
f
=
(19)
That is, at least one passenger gets out of the elevator
every
iG
T s. The total number of employees is U ˈand there
are
j
U employees work in floor j . Thereforeˈthe number of
employees work in floor
1
1
i
n
÷
+ to floor
i
n is
1
1
i
i
n
j
j n
U
÷
= +
¿
ˈ
and
1
1
i
i
n
j
j n
U C
÷
= +
¿
times are needed to serve these employees. So
the overall transport time of elevators in group
i
n is˖
C 1
1
i
i
n
j
j n
i
i
i
U
T
T
C f
÷
= +
=
¿
7
(20)
E. The Construction of an Optimization Model
In the caseˈenergy consumption is measured by the
total transport distance
e
H and time of stops
e
S . Formula is as
follows˖
( )
1
1
1
i
i
n
j
m
j n
e i
i
U
H E H
C
÷
= +
=
 


=


\ .
¿
¿
(21)
( )
1
1
1
i
i
n
j
m
j n
e i
i
U
S E S
C
÷
= +
=
 


=


\ .
¿
¿
(22)
101 114
Similarlyˈthe satisfaction of passengers is measured by he
total transport time
tr
T and average consumption time
aa
T .
Formulas are as follows˖
{ }
1 2
max , , ,
tr T mT
T T T T =
7
and
1
1
1
i
i
n
j
m
j n
i
i i
tr
aa
U
T
C f
T
T
U U
÷
= +
=
 




\ .
= ~
¿
¿
&
(23)
Though analysisˈthe shorter
tr
T is, the better. According to
maximumminimum theoryˈwe are aimed to find a scheme
that can make the service time among all the elevators be
shortest˖
{ }
1 2
, , ,
tr m
MinT Min Max T T T =
7 7 7
We can get an optimization model˖
Objective function:
C 1
1
1
i
i
n
j
j n
i
i m
i
U
T
Min Max
C f
÷
= +
s s
¿
(24)
Constraints:
1 1
1
1 2
1
1 ,
0, 2, ,
, ,
m
i i
m
i i
m L
n n N
n n i m
f f f L
m f n are none negative integers
÷
÷
s s ¦
¦
< <
¦
¦
÷ > =
´
¦
+ + =
¦
¦
¹
IV. ALGORITHM DESIGN
If m and
i
f
are determined, we design an algorithm to
calculate
i
n to minimize the elevator transport time.
Dynamic programming is used to determine the partition floor.
( ) ,
h
F i j is the total transport time of elevators in group
h , which serve employees from Floor i to Floor j .
Define
( )
p
M N the maximumminimum transport time of
elevators in the former p groups that serve employees from
Floor 2 to Floor N . Uppeak time passes when all the
employees are sent to the destination floors, so the time cost is
( ) { } ( )
1 1
1, , 0,1, 2, , 1
i i i
Max F n n i m
+ +
+ = ÷ .
Following is the algorithm process:
Step1: The first group of elevators serves Floor 2 to N ,
and the transport time is marked by
( )
1
2, F N , that is :
( ) ( ) { } ( )
1 1 0 1
1, 2, M N Min Max F n N F N = + =
N Y
Y
N
N
Y
N
i<=6?
Initialization: F
k
[i][j],
k=1,2,…,6; i=2,3,…,N;
j=i,i+1, …, N
M
1
(k)=F
1
[2][k],
k=2,3,…,N; mark[1][k]=k
i=1
i=i+1
Y
N
Output M
6
[N]
i=7; j=N
i=i1
i>0?
Output:mark[i][ j];
j=mark[i][j]1
END
Y
j=1
j=j+1
j<=N?
Mi[j]=Ğ
mark[i][j]=0
k=1
k=k+1
k<=j?
temp=max(F
i
[k][
j],M
i1
[k1])
temp<M
i
[j]?
mark[i][j]=k
M
i
[j]=min(M
i
[j],
temp)
Figrue2. The flow chart of dynamic programming algorithm
Step2: The first and the second groups of elevators serve
Floor
1
1 n + to N . The transport time of the first group is
marked by
1 1
(2, ) F n , and the transport time of the second
group is marked by
2 1
( 1, ) F n N + . So the overall transport
time is
1 1 2 1
{ (2, ), ( 1, )} Max F n F n N + .
We are aimed to select a suitable value of
1
n to minimize
the overall transport time in the commercial building.
Because
1 1
(2, ) F n equals to
1 1
( ) M n , so
1
2 2 1 1 1
( ) { ( 1, ), ( )}
n
M N Min Max F n N M n = + .
Using the method 1 m ÷ times, we can get:
1
1 1 1
( ) { ( 1), ( )}
m
m m m m m
n
M N Min Max F n M n
÷
÷ ÷ ÷
= +
By using C ++ programming language, we can get the
best grouping scheme.
V. EXAMPLE CALCULATION
There is a 25floor commercial buildings with about 220
260 employees in each floor. The population distribution is
shown in Table1.
102 115
The following we will give the elevator running scheme
based on optimization models and dynamic programming
algorithm.
Table 1 uneven population distribution at populated floors
Floor
no.
Population Floor
no.
Population Floor
no.
Population
1 220 10 252 19 238
2 254 11 244 20 241
3 223 12 228 21 235
4 243 13 260 22 252
5 234 14 247 23 221
6 225 15 236 24 237
7 229 16 256 25 256
8 237 17 238
9 239 18 255
By programming, transport time during uppeak varies with
alternation of the partitions, as shown in Table 2.
VI. CONCLUSION
Our model has universality and representativeness. The
models for the mean ride time can be extended to cover also
outgoing and inter floor traffic situations for a single elevator.
The approach with collective control principle can be used in
other case such as bus scheduling problems.
ACKNOWLEDGMENT
This work was supported by Innovation Project of Optimization and
Control of Network Systems of Zhejiang Normal University.
This work was supported by ZSDZZZZXK03.
REFERENCES
[1] Cho Y C, Park T H, Chang H C. Computer aided design for elevator
systems. Elevatori,2001,30(July/August):18㨪34.
[2] MarjaLiisa Siikonen,Customer service in an elevator system during up
peak.Transportation Research,1997,31(2):127㨪139.
[3] C.B Kim, K.A Seong, H.L Kwang, J.Q Kim. Design and
Implementation of a Fuzzy Elevator Group Control System. Systems
and Humans, 1998,17(3): 277㨪287.
[4] Barney G C, Dos Santos S M. Elevator traffic analysis: Design and
control. London:Peter Peregrinus,1985.
[5] Chang Bun Kim, A Fuzzy Approach to Elevator Group Control System.
IEEE Trans on System, Man and Cybernetics, 1995,(6): 985990.
[6] Chiang Tsungche. Design of Modern Elevator Group Control Systems.
IEEE International Conference on Robotics and Automation v2, May
2002. 1115.
[7] Sun J,Zhao Q C,Luh P B. Estimation of optimal elevator scheduling
performance. Proceedings of the IEEE International Conference on
Robotics and Automation, 2006, :10781083.
[8] Bo Xiong, Peter B Lush, Shi Chung Chang. Croup Elevator Scheduling
with Advanced Traffic Information for Normal Operations and
Coordinated Emergency Evacuation. Proceedings of the IEEE
International Conference on Robotics and Automation, 2005(4),:1419
1424.
[9] Yong Y,Ye Q T.Dynamically Dispatching Method Aiming to Reduce the
Servicing Time in The EGCS. Proc of the 5th World Congress on
Intelligent Control and Automation, 2004 ,:28542858.
[10] Cortes P, Munuzuri J,Onieval. Design and analysis of a tool for
planning and simulating dynamic vertical transport[J]. Simulation,
2006, 82(4),:255274.
103 116
We design a satisfactory partitions running transport scheme so that the energy consumption can be reduced and employees in this commercial building can enjoy a comfortable elevator service. Partitions Running Transport Scheme The Limits of Partitions is (T m 1) (0 T 1) . °Ttr ° ® °E ° ¯ m 2U j 2t1 t 2 2C S e mU j e 2C (2) So we have Ttr max(Ttr1 . We can get: T 2 m 2U j (2t1 t2 ) °Ttr1 ° C (6) ® ªT m º T mU j e ° « » ° E1 C ¯ such that: T 2 m 2U j (2t1 t2 ) °Ttr1 C ° ° ªT m º T mU j e « » ° E1 ° C ® (1 T ) m 2U j (2t1 (1 T )t2 ) ° Ttr 2 ° C ° ª (1 T ) m º (1 T ) mU j e ° « » ° E2 C ¯ When T T* . We have: t m 2mt1 m 2 e C 2 2 (3) mU j 2 Ttr E that is : m 2U j 4t1 t 2 °Ttr ° 4C (4) ® 2 m U je ° °E 4C ¯ 2) If m is an odd. Divide all the floors into two or more groups. Ttr1 Ttr 2 Ttr* Ttr . Each group is consist of adjacent floors(Figure1). Comparison Because 2t1 t2 ! 2t1 t2 ! (T * ) 2 (4t1 2 2t2 ) we have m2U j (2t1 t2 ) 2C and ! m 2U j (4t1 t2 ) 4C ! ! (T * ) 2 m2U j (2t1 t2 ) C O mU j e 2C So. Ttr1 is a monotone increasing function of T . and Ttr 2 is a monotone decreasing function of T. (7) F ig u re 1 . Ttr1 ! Ttr ! Ttr 2 when T ! T * ° ® * * °Ttr 2 . ! m2U j e 4C {[T *m]T * [(1 T * )m](1 T * )}mU j e C TRandom ! Todd and even ! TParrtition runnning ° ® ° ERandom ! Eodd and even ! EParrtition runnning ¯ (11) III. An elevator run the 1th’s floor to the (T m 1) th ' s floor. ELEVATOR TRANSPORT SCHEMES DURING UPPEAK The efficiency of elevator service will increase by dividing elevators into several groups. Elevators of different group will serve employees in different floors. Odd and Even Floors Transport Scheme This scheme requires one of two elevators serves employees in the odd floors and the other serves those in the even floors and Floor 1. We have: mU j 4 mt1 mt2 t 2 °Ttr ° 4C (5) ® m m 1 U je ° °E 4C ¯ C. 113 100 . and in the even floors (2mt1 (m 1)t2 2) . Ttr 2 ) ® ¯E E1 E2 (8) B. And another elevator run the (T m 2) th ' s floor to the ( m 1) th ' s floor. and in the odd floors is 2 u m 1 t1 mt2 / 2 . transport circle of elevators serve employees in the even floors is 2 mt1 mt 2 / 2 . 1) If m is an even. transport circle of elevators serve employees in the odd floors is (2 u (m 1)t1 (m 1)t2 2) . Ttr * Ttr1 . Ttr 2 ! Ttr ! Ttr 2 when T T ¯ (9) So the optimized running time and the energy consumption of the elevator stops are: °Ttr ° ® ° °E ¯ (1 T * ) m 2U j (2t1 (1 T * )t2 ) C (10) [(1 T * ) m ](1 T * )` mU j e C ^[T * m ]T * D.
Elevator Transport Time If f is the quantity of elevators in group i interval Ti is i tv h . Derivation of Ei ( S ) If a passenger works in the floor severed by the ith group elevators. N floors can be divided into m regions. The Construction of an Optimization Model C ª § 1 · º «1 ¨1 ¸ » « © ni ni 1 ¹ » ¬ ¼ Ei S ni ni 1 (14) In the case energy consumption is measured by the total transport distance H e and time of stops Se . The ith group elevators serve. Ei H Where n 1 n2 ni n m 1 . Fnm 1 1 . the probability that he travels to floor j is Pij 1 ni ni (12) 1 That is. The aim of dynamic partition is to find the optimum values of n n 1 nm 1 . Transport time between floors: 2 Ei H t v where ª§ k · k «¨ ¸ «© ni ni 1 ¹ ¬ 1 (17) C ni ni 1 ª§ k · ° =2tv ® ¦ k «¨ ¸ « ° k 1 ¬© ni ni 1 ¹ ¯ ª § ° ts ® ni ni 1 «1 ¨1 « © ni ° ¬ ¯ C ½ § k 1 · º ° ¨ ¸ » ni 1 ¾ ni ni 1 ¹ » © ° ¼ ¿ C 1 · º ½ ° ¸ » 1¾ 2Ct p ni 1 ¹ » ° ¼ ¿ (18) D. The first group elevators serve. the probability that more than one will travel to floor j is P § · 1 1 ¨1 ¸ ni ni 1 ¹ © C the overall transport time of elevators in group n i is j ni ¦ 1 ni Uj 1 (13) Ti C Ti C fi (20) So we can get.Composed by L elevators serve the building. The time an elevator spends traveling up and back down to the entrance floor is called the roundtrip time. Formula is as follows § m ¨ ¦ ¨ Ei H ¨ i 1 ¨ © j C. at least one passenger gets out of the elevator every TiG s. FN . Time cost by an elevator opens or closes the door: so the Ei S 1 ts . Fn1 . TiG Ti C fi (19) 3. The second group elevators serve. and N should meet: 1 n1 n 2 ni nm 1 N . Derivation of Ei ( H ) The probability that a passenger gets out of an elevator k ni 1 is before floor k (15) Pk ni 1 ni ni 1 And the probability all the passengers get out of an elevator before floor k ni 1 is ¦ He · Uj ¸ ni 1 1 ¸ ¸ C ¸ ¹ ni (21) Se § ¨ ¦ ¨ Ei S ¨ i 1 ¨ © m j ni ¦ ni · Uj ¸ 1 ¸ ¸ C ¸ ¹ 1 (22) 114 101 . Time cost by a passenger steps inside or outside an elevator car: 2 Ct p . Fni 1 P 'k ni 1 § k · ¨ ¸ © ni ni 1 ¹ C (16) Fn2 . So we have C § k 1 · º ¨ ¸ » ni ¦ k 1 © ni ni 1 ¹ » ¼ From the above analysis the transport circles: Ti C 2 Ei H tv Ei S 1 ts 2Ct p ni ni C 1 The mth group elevators serve. v 2. Elevator Roundtrip Time During uppeak. The total number of employees is U and there are U j employees work in floor j . Fn1 1. Fni . A. E. passengers arrive randomly at an entrance floor and travel to upper floors. F2 . 1. and An elevator services a region. B. So 1 As for C passengers. Roundtrip time includes: 1. Therefore the number of employees work in floor ni 1 1 to floor n i is and j ni ¦ 1 ni Uj 1 j ni ¦U 1 ni j C times are needed to serve these employees.
Because F1 (2. .…. The transport time of the first group is marked by F1 (2. n1 ) equals to M1(n1) . i 0. The flow chart of dynamic programming algorithm Step2: The first and the second groups of elevators serve Floor n1 1 to N . Fh i.Mi1[k1]) MinTtr Min Max ^T1 . we can get the best grouping scheme.Similarly the satisfaction of passengers is measured by he total transport time Ttr and average consumption time Taa . 115 102 . n1 ) .i+1.3. k=1. N ).3. EXAMPLE CALCULATION M1 N Min Max^ F1 n0 1. temp) ALGORITHM DESIGN Figrue2. 2. TmT ` and § ni · Uj ¸ m ¨ ¦ Ti ¸ j n 1 ¦ ¨ i 1C f ¸ ¨ i 1 i ¨ ¸ © ¹  Ttr (23) Taa U U Though analysis the shorter Ttr is. Constraints: 1 d m d L ° °1 n1 . V. i=2. T2T . n1 elevators in the former p groups that serve employees from Floor 2 to Floor N . N ` F1 2.N. ni are none . The population distribution is shown in Table1. N )} . So the overall transport time is Max{F1 (2. and the transport time of the second group is marked by F2 ( n1 1. the maximumminimum transport time of i M 2 (N ) Min Max{F2 ( n1 1. nm 1 N ° ®ni ni 1 ! 0. ni 1 ` .2. i j=mark[i][j]1 Mi[j]=min(Mi[j]. k=2. the better. .N. Dynamic programming is used to determine the partition floor. i 2. T2 .6. m °f f fm L °1 2 °m. j=i. so the time cost is Max ^ Fi 1 ni 1. we design an algorithm to calculate n i to minimize the elevator transport time. m 1 . N k=k+1 k=1 M1(k)=F1[2][k]. Following is the algorithm process: Step1: The first group of elevators serves Floor 2 to N . that is : Using the method m 1 times. …. .…. M 1 (n1 )} . N There is a 25floor commercial buildings with about 220260 employees in each floor. Uppeak time passes when all the employees are sent to the destination floors. F2 ( n1 1. so If m and f are determined.negative integers ¯ IV. Tm ` We can get an optimization model Objective function: Min Max 1d i d m j ni ¦ 1 ni Uj 1 C T iC fi (24) i=i1 Y i>0? N END Output:mark[i][ j]. N ) . Formulas are as follows Ttr max ^T1 . mark[1][k]=k Mi[j]= mark[i][j]=0 k<=j? i=1 N Y j<=N? N Y i=i+1 j=j+1 Y i<=6? N Output M6 [N] temp<Mi[j]? i=7. j=N N Y mark[i][j]=k j=1 temp=max(Fi[k][ j]. We are aimed to select a suitable value of n 1 to minimize the overall transport time in the commercial building. and the transport time is marked by F1 2. which serve employees from Floor Define M p N to Floor j . fi . . M m 1 (nm 1 )} nm 1 By using C ++ programming language. n1 ).1. According to maximumminimum theory we are aimed to find a scheme that can make the service time among all the elevators be shortest Initialization: Fk[i][j]. N . j is the total transport time of elevators in group h .…. we can get: M m ( N ) Min Max{Fm (nm 1 1).
A Fuzzy Approach to Elevator Group Control System. The models for the mean ride time can be extended to cover also outgoing and inter floor traffic situations for a single elevator. Croup Elevator Scheduling with Advanced Traffic Information for Normal Operations and Coordinated Emergency Evacuation. 116 103 . 1 220 10 252 19 238 2 254 11 244 20 241 3 223 12 228 21 235 4 243 13 260 22 252 5 234 14 247 23 221 6 225 15 236 24 237 7 229 16 256 25 256 8 237 17 238 9 239 18 255 [3] By programming.Dynamically Dispatching Method Aiming to Reduce the Servicing Time in The EGCS.1985. IEEE Trans on System. The approach with collective control principle can be used in other case such as bus scheduling problems. [6] Chiang Tsungche. H. transport time during uppeak varies with alternation of the partitions. May 2002.2001. Chang H C. J. Simulation.30(July/August):18 34. Elevator traffic analysis: Design and control. 2006. C. [5] Chang Bun Kim. Shi Chung Chang.L Kwang. Park T H.:28542858. Peter B Lush. Proceedings of the IEEE International Conference on Robotics and Automation. [9] Yong Y. Man and Cybernetics. Design and Implementation of a Fuzzy Elevator Group Control System.17(3): 277 287. 82(4). as shown in Table 2. Estimation of optimal elevator scheduling performance.Zhao Q C. Design and analysis of a tool for planning and simulating dynamic vertical transport[J].:14191424.Customer service in an elevator system during uppeak.Ye Q T. :10781083. Elevatori.Q Kim.A Seong. Systems and Humans.31(2):127 139. Table 1 uneven population distribution at populated floors Floor Population Floor Population Floor Population no. VI.1997. 1995. Design of Modern Elevator Group Control Systems. [4] Barney G C. [10] Cortes P.Luh P B. London:Peter Peregrinus. Computer aided design for elevator systems. 2006.:255274. MarjaLiisa Siikonen. [7] Sun J.Onieval.(6): 985990.Transportation Research. Dos Santos S M. no. 2004 . IEEE International Conference on Robotics and Automation v2. no. REFERENCES [1] [2] Cho Y C. This work was supported by ZSDZZZZXK03. Munuzuri J. 1998. K. ACKNOWLEDGMENT This work was supported by Innovation Project of Optimization and Control of Network Systems of Zhejiang Normal University. 1115. CONCLUSION Our model has universality and representativeness. Proc of the 5th World Congress on Intelligent Control and Automation. 2005(4). [8] Bo Xiong.The following we will give the elevator running scheme based on optimization models and dynamic programming algorithm. Proceedings of the IEEE International Conference on Robotics and Automation.B Kim.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.