You are on page 1of 5

* Correspondence author: luxinzhong@zjnu.

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
zhenlin-world@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


AbstractThis paper discusses passenger service in an elevator
system in a high-rise commercial building. Taking energy
consumption and passenger satisfaction as the major factors,
models to help improve the traffic during the up-peak 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, high-rise 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 high-rise
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 elevators total energy consumption is
E
; Elevators
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
978-0-7695-4585-1/11 $26.00 2011 IEEE
DOI 10.1109/IWCDM.2011.33
99
2011 First International Workshop on Complexity and Data Mining
978-0-7695-4585-1/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 1ths 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 UP-PEAK
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 Round-trip Time
During up-peak, 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
round-trip time. Round-trip 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 . Thereforethe 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 caseenergy 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


Similarlythe 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 analysisthe shorter
tr
T is, the better. According to
maximum-minimum theorywe 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 maximum-minimum transport time of
elevators in the former p groups that serve employees from
Floor 2 to Floor N . Up-peak 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=i-1
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
i-1
[k-1])
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 25-floor 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 up-peak 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):1834.
[2] Marja-Liisa Siikonen,Customer service in an elevator system during up-
peak.Transportation Research,1997,31(2):127139.
[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): 277287.
[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): 985-990.
[6] Chiang Tsungche. Design of Modern Elevator Group Control Systems.
IEEE International Conference on Robotics and Automation v2, May
2002. 11-15.
[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, :1078-1083.
[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 ,:2854-2858.
[10] Cortes P, Munuzuri J,Onieval. Design and analysis of a tool for
planning and simulating dynamic vertical transport[J]. Simulation,
2006, 82(4),:255-274.





103 116

You might also like