• Nie Znaleziono Wyników

Methodology for efficient real time OD demand estimation on large scale networks

N/A
N/A
Protected

Academic year: 2021

Share "Methodology for efficient real time OD demand estimation on large scale networks"

Copied!
16
0
0

Pełen tekst

(1)

on large scale networks

2

Tamara Djukic

3

Delft University of Technology

4

Department of Transport and Planning

5

Stevinweg 1, 2628 CN Delft, The Netherlands

6

+31 15 278 1723

7

t.djukic@tudelft.nl

8

(Corresponding author)

9

Hans van Lint

10

Delft University of Technology

11

Department of Transport and Planning

12

Stevinweg 1, 2628 CN Delft, The Netherlands

13

j.w.c.vanLint@tudelft.nl

14

Serge P. Hoogendoorn

15

Delft University of Technology

16

Department of Transport and Planning

17

Stevinweg 1, 2628 CN Delft, The Netherlands

18

s.p.hoogendoorn@tudelft.nl

19

November 15, 2013

20 Word count: 21

Number of words in abstract 174

Number of words in text (including abstract) 5221 Number of figures and tables 8 * 250 = 2000

Total 7395

22

23 24

Submitted to the 93rd Annual Meeting of the Transportation Research Board, 12-16 January 2014, Wash-25

ington D.C. 26

(2)

based on principal component analysis (PCA). In particular, we have shown how we can apply PCA to

3

linearly transform the high dimensional OD matrices into the lower dimensional space without significant

4

loss of accuracy. Next, we have defined a new transformed set of variables (demand principal components)

5

that is used to represent the OD demand in lower dimensional space. These new variables are defined as

6

state variable in a novel reduced state space model for real time estimation of OD demand. In this paper, we

7

review previous work and continue this line of research. Based on the previous results, we demonstrate the

8

quality improvement of OD estimates using this new formulation and a so-called, ’colored’ Kalman filter

9

approach for OD estimation, in which correlated observation noise is accounted. Moreover, we provide

10

a thorough analysis of the model performance and computational efficiency using real data from a large

11

network, and method for obtaining a reduced set of state variables.

(3)

be used for on-line applications such as dynamic traffic management. Much of the work in OD matrix

3

estimation and prediction so far has focused on improving estimation and prediction of OD matrices with

4

more sophisticated and less time consuming algorithms (1), (2), (3) and by including additional data, ranging

5

from traffic counts to automatic identification data (4), (5), (6), or data from Bluetooth devices (7), to name

6

a few. Lately, decomposition of network into smaller subareas has been proposed by (8), (9) to deal with

7

high dimensional OD estimation problem. A convenient way of understanding the complexity of the OD

8

estimation problem and proposed solution is to illustrate both methodologies in the generic way.

9

In general terms, all dynamic OD demand estimation and prediction methods aim to find the most

10

probable OD matrix Xk, given previous estimates Xk−n, n = 1, 2, ..., historical OD matrices Xprior, the 11

available (sensor) data Y and all the other assumptions H related to for example the assignment method

12

and/or the assumed temporal evolution of the OD patterns. The common methodology with inputs and

13

outputs into an OD matrix estimation and prediction is illustrated in Figure 1. This generic methodology

14

can be used for off-line and on-line applications. The most widely used sensor data are link traffic counts

15

y that would be available for the entire analysis period (all the departure intervals) or at the end of each

16

interval k. For off-line application, the entire set of link traffic counts for the analysis period would be used

17

to simultaneously estimate OD matrices for all time intervals. For on-line application, at the end of each

18

interval k, only the counts corresponding up to kthtime interval would be used to sequentially estimate OD

19

matrix for current time interval. Finally, for the on line application, predictions of OD matrices are generated

20

for intervals k+ 1, k + 2, ....k + T .

OD demand estimation (and prediction)

Traffic link countsfic link counts OD deman Assignment matrix

Estimated (and predicted) OD demand Historical OD demand Off-line or On-line

FIGURE 1 Overview of common OD estimation (and prediction) methodology

21

The OD estimation problem is computationally intensive of the complexity of the estimation and

22

prediction methods and the fact that time dependent OD matrices for real-life transport networks typically

23

constitute high dimensional data structures. One of the problems with high-dimensional datasets is that, in

24

many cases, not all the measured variables are ”important” for understanding the underlying phenomena of

25

interest. In other words, these high-dimensional data may consist of multiple, indirect measurements of an

26

underlying source. Therefore, one possible solution approach to solve this ”curse of dimensionality” is to

27

map the high dimensional OD matrices into a space of lower dimensionality, such that most of the structural

28

information about the demand is preserved.

29

Figure 2illustrates the efficient methodology for on-line OD demand estimation and prediction.

30

This method, first apples the Principal Component Analysis (10) or PCA, to any data set of historical OD

31

flows or generated from detailed demand microsimulation system. This historical OD dataset can be

rep-32

resented, without loss of generality, as a linear combination of a set of only a few orthonormal vectors

33

(eigenvectors) and principal demand components. We extract off-line these eigenvectors that capture the

(4)

OD demand estimation (and prediction) Off-line

Traffic link countsfic link counts

p Assignment matrix prediction) prediction) Estimated (and predicted) OD demand Historical OD demand PCA approximation OD deman Reduced OD demand OD demand OD Off-line Trafficfic link Off-line Off-On-line

FIGURE 2 Overview of proposed OD estimation (and prediction) methodology

trip-making patterns and their spatial and temporal variations, whereas the principal demand components

1

capture the contribution of each eigenvector to the realization of a particular OD flow. These principal

2

demand components are used as state variables instead of the OD flows themselves. For the on-line

applica-3

tion, at the end of each interval k, the traffic counts corresponding up to kthtime interval would be used to

4

sequentially update principal demand components for current time interval. Finally, the estimated principal

5

demand components are used to obtain the estimates of OD matrix.

6

Reducing the problem dimensionality through PCA replaces the usual approach of using prior OD

7

matrices by structural information obtained either from data or from a detailed demand microsimulation

8

system. The importance and originality of this approach lie in the possibility to capture the most important

9

structural information without loss of accuracy and considerably decreasing the model dimensionality and

10

computational complexity.

11

The paper is organized as follows. In the first part of the paper, we summarize the idea of

dimen-12

sionality reduction and approximation of OD demand based on PCA. In the second part of the paper, we

13

present the state space formulation of the OD estimation model with principal demand components as the

14

state variables. Next, we analytically explore the properties of the colored noise Kalman filter to solve the

15

proposed OD estimation method with time-correlated measurements. In the third part of paper, we

demon-16

strate the performance of the proposed OD estimation model on a large-scale network (Vitoria, Spain). The

17

paper closes with a discussion on further application perspectives of the OD demand estimation model and

18

further research directions.

19

REDEFINING THE STATE VARIABLES FOR OD ESTIMATION

20

The idea of dimensionality reduction

21

Since OD matrices are high dimensional multivariate data structures, the specification and estimation of OD

22

matrices is both methodologically and computationally cumbersome for real time applications. There are

23

three factors that increase the computational effort: the size of the state vector, the complexity of model

24

components (e.g. assignment matrix, covariance matrices, etc.), and the number of measurements to be

25

processed. For example, the Kalman filter algorithm is commonly used method to estimate and predict the

26

OD matrices (11), (12), (13). Since the computational complexity of the Kalman filter is typically in the

27

order of O(n3

ij), where in the simplest case nij is the total number of the OD pairs in the network, this can 28

(5)

represent a potential computational bottleneck. In addition, each traveler takes a certain time to complete

1

his/her trip in large scale networks, and the resulting travel time can be very long depending on trip length

2

between OD pairs and prevailing traffic conditions (i.e. congestion level in the network). The effect of time

3

lag indicates that the traffic flow at the current observation time interval can include OD flows departing

4

from previous time interval, leading to an enormous computational strain. For example, if we assume that

5

the number of lagged time intervals is s, the size of the state vector increase for at least (s ∗ nij), and 6

manipulation of vectors and corresponding covariances becomes cumbersome. Lately, approximation of

7

OD flows to handle the lagged OD flows has been proposed by (14).The approximation is based on the

8

conjecture that much of the information about an OD flow is likely to be provided the first time it is counted.

9

If this were true, OD flows corresponding to prior departure intervals could be held constant at their prior

10

estimated values and only the flows for the current departure interval need to be estimated. Alternatively, a

11

polynomial trend model proposed by (3) can offer a compact representation of lagged demands. However,

12

the polynomial trend model is still very computationally intensive for large scale networks.

13

Clearly, reducing the dimensionality of the state vector, is a way to improve computational

effi-14

ciency. For example, let us assume that OD flows have been estimated for several previous days or months.

15

These flows subsume in them various kinds of information, about trip making patterns and their spatial and

16

temporal variations. Therefor, the key idea in our approach is to reduce the dimensionality of the OD matrix,

17

in such way that the structural and temporal patterns are preserved. With this approach the computational

18

cost can be speeded up dramatically, without significant lost of accuracy. One commonly used method of

di-19

mensionality reduction is a linear transformation technique known as Principal Component Analysis (PCA).

20

PCA has found application in traffic and transportation science before, for example for the dimensionality

21

reduction in calibration of travel demand from traffic counts (15).

22

In the remainder of this section, we will explain how we derived series of OD matrices and how we

23

organized these data in appropriate form for PCA method. Finally, we define the new set of state variables

24

for OD estimation.

25

The dimensionality reduction based on PCA

26

In the previous section, we have discussed the problems that can arise in attempts to estimate and predict

27

OD matrices in high dimensional spaces, and the potential improvements which can be achieved by first

28

transforming data into a space of lower dimensionality. In this section we demonstrate the remarkable fact

29

that any OD matrix has a concise representation when expressed in terms of an orthonormal basis of(nij×1) 30

vectors ei, i= 1, 2, ..., nijthat can be derived using PCA. 31

Our goal is to map vectors of the OD demand X ∈ ℜnij onto the new vector in an n

m-dimensional 32

space, where nm < nij. To illustrate dimensionality reduction based on PCA we follow the same rational 33

as in (10).

34

Let X be the data matrix set defined such that one dimension in data represents the dimension in

35

which we are seeking to find structure (e.g. columns of the matrix Xj), and the other dimension represents 36

the dimension in which realizations of this structure are stored (e.g. rows of the matrix Xi). For example, 37

suppose that we have used a microsimulation-based demand model to generate a large sample of OD demand

38

observations r (e.g. observations can represent a daily OD demand, or OD demand per departure time

inter-39

val) in a network, each being a realization of the nij-dimensional OD demand vector xr= (x1, x2, ..., xnij). 40

Thus, we have a(r × nij) OD demand matrix X, where each row i, i = 1, 2, ..., r contains the vector of OD 41

flows per time (e.g. for whole day, per departure time interval) and column j, j = 1, 2, ..., nij denotes the 42

realizations of the nij-th OD pair over time, in the following form: 43

(6)

X=      x1(1) · · · xnij(1) x1(2) · · · xnij(2) .. . . .. ... x1(r) · · · xnij(r)      1

Once we generate the matrix X, we apply off-line the PCA algorithm to extract the eigenvectors

2

ei, i = 1, 2, ..., nij and eigenvalues λi, i= 1, 2, ..., nij. In practice, the PCA algorithm proceeds by first 3

computing the mean of the vectors xrand then subtracting this mean. The new centered data set is computed 4 as 5 X = X − ¯X ¯ X = 1 r r X i=1 Xi (1)

Then the covariance matrix S of the set of vectors xrgiven byP r

(xr− ¯x)(xr− ¯x)T is calculated

and its eigenvectors and eigenvalues are found, i.e.

siei= λiei (2)

where ei for i = 1, 2, ..., nij are the eigenvectors and λi for i = 1, 2, ..., nij are the eigenvalues of the 6

covariance matrix S.

7

Since the covariance matrix of X is real and symmetric, its eigenvectors e1, e2, ..., enij can be 8

chosen as an orthonormal basis. Therefore, any vector x, or actually(x − ¯x), can be represented, without

9

loss of generality, as a linear combination of a set of nij orthonormal vectors ei 10 x− ¯x= c1e1+ c2e2+ ... + cnijenij = nij X i=1 ciei (3)

where the vectors eisatisfy the orthonormality relation

eTiej = δij (4)

in which δij is the Kronecker delta symbol. Explicit expressions for the coefficients ciin (3) can be found

by using (4) to give

ci= eTi(x − ¯x) (5)

which can be regarded as a simple rotation of the coordinate system from original x’s to a new set of

coordi-11

nates given by c’s. Through sorting the eigenvectors in decreased order by the size of the eigenvalue, we can

12

retain the first nm, where nm¡ nij, eigenvectors which captures the maximum data variance. However, since 13

the covariance matrix of observed OD demand in general can be very large, it is inconvenient to evaluate

14

and store it explicitly. To avoid this we can use efficient algorithms, which find the nmlargest eigenvectors 15

of the covariance matrix such as the orthogonal iteration and power method (16). A intuitive explanation

16

of (5) is that the eigenvectors are used as weights on each of the original variables to compute the principal

17

demand components.

18

Once the nmlargest eigenvectors e1, e2, ..., enmare found, a new low dimensional representation of

the OD demand can be expressed as follows

(ˆx− ¯x) =

nm

X

i=1

(7)

where ˆX is the approximated OD demand constructed using the first nm eigenvectors. The

representa-tion of ( ˆX − ¯X) on the orthonormal basis e1, e2, ..., enm is thus given by principal demand components

c1, c2, ..., cnm. Thus, we define a new set of variables, principal demand components ci that capture the

contribution of each eigenvector ei to the particular observations of OD demand. In turn, the eigenvectors

ei capture the common behavior of travelers over the all OD pairs. The eigenvectors then define the fixed

structure of our OD matrices, which we then update on-line from traffic counts. Thus, the explicit expression for the approximated OD demand ¯X in lower dimensional space can be found by using equation (6) to give

ˆ x= nm X i=1 ciei+ ¯x (7)

In the next section we formulate a state space OD estimation model, where the eigenvectors ei define the 1

fixed structure of our OD matrices and prinicpal demand components are updated on-line from traffic counts.

2

A REDUCED STATE SPACE OD ESTIMATION MODEL FORMULATION

3

In this section we demonstrate how the approximated OD demand presented in previous section can be

4

viewed and defined as a state-space based formulation.

5

Following the idea presented in previous section, we define our state to be a(nm× 1) vector of 6

principal demand components, ck, where nmrepresent the reduced number of variables in state vector. The 7

principal demand components represent the approximated OD demand, where each principal demand

com-8

ponent ci, for i= 1, 2, ..., nmcaptures the contribution of each eigenvector eito the particular observations 9

of OD demand. Therefore, the OD demand state in the network at time k is uniquely described by the vector

10

of the principal demand components ck in nm-dimensional space, where nm< nij. 11

The state space model formulation consists of the process and observation equations. Clearly, we

12

have to specify the process equation that captures the temporal evolution of the state, and observation

equa-13

tion that uses whatever new information (i.e. observation) is available to estimate the state.

14

The process equation is based on the autoregressive process on the principal demand components, which provides preliminary estimate of the OD flow. We define the process equation as follows:

ck = k−1

X

p=k−q′

φpkcp+ ωk (8)

where φpk, a(nm× nm) is the process matrix that represents the effects of previous states cp on current 15

state ck, q′ is a degree of the autoregressive process and ωk is a vector of a random variables capturing the 16

unobserved deviations in process. The process noise vector ωk depicts some known Gaussian noise term 17

defined with following assumptions:

18

• mean E[ωk] = 0; 19

• variance E[ω2

k] = θkδk, where θk is a nm× nmvariance covariance matrix, with eigenvalues on 20

the diagonal stored in decreasing order, and the δkis the Kronecker symbol. 21

The state-space model formulation furthermore uses an observation equations. We define the obser-vation equation as a linear relationship between the state variables (principal demand components) and the observations (traffic counts):

yk = k

X

p=k−p′

Apkxp+ υk (9)

where yk ∈ ℜnl denotes a vector of link traffic counts for time interval k, and A p

k is a(nl× nij) matrix, 22

known as assignment matrix, mapping OD flows departing during intervals p to link traffic counts observed

(8)

during interval k. Further, p′ is the maximum number of time intervals needed to travel between any OD

1

pair, and υkis a vector of random variables capturing the observations error on detectors during interval k. 2

Following the lower dimensional representation of OD demand by principal demand components

3

and substituting (6) in (9), we can reformulate the observation equation (9) as:

4 yk = k X p=k−p′ Apk(cpep+ ¯xp) + υk = k X p=k−p′ Hkpcp+ ¯yp+ υk (10) where Hkp = k P p=k−p′

Apkepis a(nl× nm) matrix called observation matrix, mapping the principal demand 5

components during intervals p to traffic counts observed during interval k. Note that the observation matrix

6

Hkpin equation (10) is not the same as the assignment matrix Apkgiven in (9). Finally, the matrix Hkpis used

7

for the linearization of the model; it equals the transform of the assignment matrix Apk to the orthonormal

8

basis matrix of eigenvectors ep. The observation noise υkdepicts some known Gaussian noise term defined 9

with following assumptions:

10

• mean E[υk] = 0; 11

• variance E[υ2

k] = Rkδkm, where Rk is a(nl× nl) variance covariance matrix, and the δkmis the 12

Kronecker symbol.

13

In conclusion, we might mention that this model uses following input variables: process transition

14

matrix φpk, process error covariance matrix θk, observation error covariance matrix Rk, and assignment 15

matrix Apk. These input data are usually derived from, for example, existing historical data on OD demand

16

and observations. In transport modeling for the real time applications, it is considered that data would be

17

available over multiple days, and hence, we would be able to calibrate model inputs. We revisit this issue

18

later in case study section.

19

SOLUTION APPROACH: ESTIMATION AND PREDICTION

20

It is convenient to start the presentation of the solution approach with reference to the idea of variables

21

reduction in state vector and state-space model given in previous section. Then, we provide a solution

22

approach when correlated observation noise is accounted due to reduction of variables in state vector.

23

Temporal correlation between observations introduced by dimensionality reduction

24

Equations (8) and (10) constitute a discrete time liner Kalman Filter. The solution approach of such a

25

system of equations may seem fairly standard at first glance. However, since there are practical points

26

which are not entirely obvious, we illustrate them here before presenting a solution algorithm. Reducing

27

the state variables introduces additional uncertainty in the process, and this noise increases as the reduced

28

number of state variables increases. In order to explain the potential reasons of the temporal correlation

29

between observations introduced by the dimensionality reduction of the state vector, we analytically derive

30

the observation noise correlation. Here, we omit the effect of lagged time intervals p in observation equation

31

(10) for the sake of simplicity.

32

The given observation equation (10) for reduced number of state variables nmover time interval k 33

can be expressed as

(9)

yk = Ak nm X i=1 ci,kei,k+ Ak nij X i=nm+1 ci,kei,k+ υk yk = Ak nm X i=1 ci,kei,k+ ξk ξk = Ak nij X i=nm+1 ci,kei,k+ υk (11)

where, ξkrepresent the observation noise that consists of additional noise introduced by dropped state vari-1

ables from nm+ 1 till nij at time interval k. 2

Further, observation equation (10) for reduced number of state variables nmfor the next time inter-3

val k+ 1 can be expressed as

4 yk+1= Ak+1 nm X i=1 ci,k+1ei,k+1+ Ak+1 nij X i=nm+1 ci,k+1ei,k+1+ υk+1 yk+1= Ak+1 nm X i=1 ci,k+1ei,k+1+ ξk+1 ξk+1= Ak+1 nij X i=nm+1 (ci,k+ ωk)ei,k+1+ υk+1 ξk+1= Ak+1 nij X i=nm+1 ci,kei,k+1+ Ak+1 nij X i=nm+1 ωkei,k+1+ υk+1 (12)

where, ξk+1represent the observation noise at time interval k+1 that consists of additional noise introduced 5

by omitted state variables from nm+ 1 till nij in previous time interval k. Therefor, ξk and ξk+1represent 6

the temporal correlated observation noise. It is well known that this condition destroys the assumption of

7

independency between process and observation noise that underlies the standard Kalman filer. The objective

8

of this section is to find an effective method to deal with this kind of correlation.

9

Colored noise Kalman filter solution algorithm

10

When the observation errors are temporally correlated, as we show in previous subsection, the time

differ-11

encing approach, which was first introduced in 1968 by Bryson and Henrikson (17) is commonly applied

12

as a way to model correlated observation noise in state-space model representation. The core idea behind

13

this filter is the elimination of the time-correlated observation noise terms ξk using a pseudo-observation 14

equation zk whose error is white and is given by 15

zk = yk+1− Ψyk

= (Hk+1Φk− ΨkHk+!)ck+ Hkωk+ υk

= Hk∗ck+ νk∗ (13)

where correlation matrix Ψ is equivalent to the process transition matrix Φk for time correlated errors,

and υk is a observation noise vector assumed to be uncorrelated with the process noise vector ωk, and

Hk∗= Hkφk− ψkHk. The new observation noise is given as

(10)

with mean E[νk∗] = 0 and covariance matrix R∗k.

1

Further, the decorellation technique from [11] is applied on process equation (11) to eliminate the

2

correlation that now exists between the new observation noise νk∗ (14) and the process noise ωk. A new 3

process equation can be written as

4

ck = φk−1ck−1+ ωk−1+ Jk−1(zk−1− Hk−1∗ ck−1− νk−1∗ )

= φ∗k−1ck−1+ Jk−1zk−1+ ωk−1∗ (15)

where the new state process matrix is expressed as φ∗k = φk−1− Jk−1Hk−1∗ . Now, the new process noise

error is defined as

ωk−1∗ = ωk−1− Jk−1νk−1∗ (16)

with mean E[ω∗k] = 0 and covariance matrix θ∗k. 5

At this time, for the given problem we have a state space model depicted by equations (13) and

6

(15) which satisfy the assumptions of standard Kalman filter. Clearly, the new process noise wk∗and

obser-7

vation noise νk∗ are independent, zero-mean, Gaussian noise processes of covariance matricesΘ∗k and R∗k

8

respectively. Algorithm 1 summarizes the colored Kalman Filter equations as a solution of such a system:

9

Algorithm 1 The colored Kalman Filter Initialization:

ˆ

c0|0= E[c0|0] and P0|0= E[c0|0− E[c0|0]T]

In case no additional information is available, P0|0 is usually initialized as a matrix with a large diagonal entries, reflecting the fact that we are highly uncertain about our initial estimate of ˆc0|0.

For k= 1, 2, . . . do:

Compute the Kalman Gain:

Kk = Pk|kHk∗T(Hk∗Pk|kHk∗T + R∗k)−1 (17)

Correct mean and covariance:

ck−1|k= ck−1|k−1+ Kk(zk∗− Hk∗ck−1|k−1) (18) Pk−1|k= (I − KkHk∗)Pk−1|k−1(I − KkHk∗) T + KkRk∗K T k (19)

Update mean and variance of state variables:

ck|k = φ∗kck−1|k+ Jkzk (20)

Pk|k= φ∗kPk−1|kφ∗Tk + θ∗k (21)

End

Note that the time differencing solution algorithm uses a 1 time interval latency in the observation

10

updating because the observation in time interval k has to be used to update the state vector in previous time

11

interval, k− 1. Therefor, following the Kalman filter terminology, ck−1|k denotes correction of the state

12

variable for time interval k−1, using the information from link traffic counts for interval k, and Pk−1|kdepict 13

updated state error covariance matrix. The Kalman filter gain in equation (17) evaluates the importance of

14

the new information obtained from link traffic counts at time interval k and it can be interpreted as the

15

weight given to the latest information. The equations (18) and (19) reflect the our corrected knowledge on

16

the system state at time interval k− 1 with obtaining the link traffic counts for interval k. In the update

17

step, the our knowledge on evolution of state and observations is used to update prior correction. Therefore,

(11)

the equations (20) and (21) reflect the our estimate (best knowledge) on the system state ck|kand Pk|kerror

1

covariance matrix at time interval k including the information on link traffic counts for time interval k.

2

Finally, the result of the colored Kalman filter, the estimated a posterior state vector ck|k, is used to

3

estimate the OD demand by applying equation (7). For a more detailed derivation of colored noise Kalman

4

Filter, and derivation of covariance matricesΘ∗, R∗and M∗we refer to (18) and (19).

5

CASE STUDY

6

In this section we will first describe the input data used by method, e.g. historical OD demand generation

7

and state variables reduction procedure. We consider two assessment scenarios in terms of number of

8

variables in state vector (i.e. with reduction of state variables and without reduction). These scenarios will

9

be discussed in more detail below. Numerical experiments are performed on large-scale network, (Vitoria,

10

Basque Country, Spain) with real data to evaluate the performance of the proposed model and solution

11

algorithm.

12

Network topology

13

Prior to method evaluation, we define a Vitoria network that consists of 57 centroids, 3249 OD pairs with

14

a 600km road network, 2800 intersections and 389 detectors presented with black dots in Figure 3. This

15

network is available in the mesoscopic version of the Aimsun (20) traffic simulation model for reproducing

16

the traffic propagation over the network. The true OD demand is available for this network, which allows

17

analyst to assess the performance of proposed model. The true assignment matrix and traffic counts on

18

detectors are derived from assignment of true OD matrix in Aimsun for evening period from 19:00 to 20:00

19

reflecting the congested state at the network. The simulation period is divided in 15 minutes time intervals

20

with additional warm-up time interval, T = 5. The link flows resulting from the assignment of the true

21

OD demand are used to obtain the traffic count data per observation time interval. The trips between some

22

of the OD pairs are not completed within one time interval due to congestion on network or the distance

23

between OD pairs. In this way a vehicle entering the network in a particular departure time interval needs

24

more than one time interval to reach a traffic detector where the departure time interval and detection time

25

are different. In our study network, the maximum travel time between OD pairs observed on network takes

26

four time intervals, which leads to very sparse assignment matrices, and the number of lagged time intervals

27

p′= 4.

FIGURE 3 The Vitoria network, Basque Country, Spain

(12)

Simulating historical daily OD demand

1

A major problem with all method assessments is obtaining meaningful evaluations of the algorithms results

2

and performance, because the true sources of data are not available for comparison when working with

3

real data. One solution is to use simulated OD demand data, where underlying sources and phenomena are

4

known. To generate a simulated OD demand per departure time interval dataset for our case study requires

5

us to define an arbitrary model for OD demand generation, which represents a common spatial and temporal

6

behavior of travelers.

7

Here, we perform the Logit model in sequence in order to introduce the correlation in OD demand

8

data. First, we defined the set of traveler’s decisions before making a trip, including decisions to make a

9

trip or not, destination choice and departure time choice. Then, for each of these decisions we have defined

10

the set of alternatives available to travelers. The activity and traveling intentions of traveler trare presented 11

in the Figure 4. The main principle of this model is that a large number of simulations are performed for

12

varying model inputs, reflecting the variability’s in the travelers behavior and consequently in OD demand

13

based on Monte Carlo simulations.

FIGURE 4 The set of decisions and alternatives for traveler

14

The total number of trips per origin from available true OD matrix is assumed as an initial number of

15

travelers per origin in simulations. Subsequently, we generate 10000 observations, each being a realization

16

of the 3249-dimensional OD demand vector, where the total number of travelers per origin is equal to

17

true OD matrix while their distribution over destinations is varied. Each generated OD demand vector per

18

departure time interval is stored in OD demand matrix where each row represents one observation of OD

19

demand, as we defined in the definition of state variables section.

20

The state vector reduction

21

To examine the effect of reducing the number of principal demand components in state vector, we applied

22

the PCA on the OD demand data matrix Xkover k= 5 departure time intervals. Once we perform the PCA, 23

we obtain the set of eigenvectors ei,k for i = 1, 2, ..., 3249 and eigenvalues λi,k for i = 1, 2, ..., 3249 per 24

time interval k.

25

We have seen in previous sections that we can use eigenvalues to explore the data reduction

poten-26

tial, for instance by considering the total (cumulative) percentage of total variation explained (e.g. 95%),

27

Figure 5. We can observe that the 90% of the variance of the data is captured by first 50 eigenvectors out

28

of 3249. This result indicates that we can reduce the state vector by more then 90% and still capture the

29

temporal and spatial variance in data.

(13)

1st0 10th 20th 30th 40th 50th 10 20 30 40 50 60 70 80 90

Variance captured by eigenvectors

Va ri a n ce Exp la in e d (% ) 0% 10% 20% 30% 40% 50% 60% 70% 80% 90%

FIGURE 5 Cumulative percentage of total variation explained by eigenvalues for time interval k2

We have performed the PCA on OD demand data set per time interval, such that in every time

1

interval we can identify potential number of variables in state vector that describe the 95% of variance in

2

data set. In Table1, we show the number of state variables nmthat describe the 95% of variance in data set 3

per departure time interval.

TABLE 1 The number of state variables that capture 95% of variance per time interval k Departure time interval 1 2 3 4 5

The number of state variables 40 61 37 39 41

4

It clearly appears from Table1that we have obtained different values of variables in state vector over

5

time intervals. Therefore, we define the number of state variables as m= max(nmk), for k = 1, 2, ..., T , 6

since omitting the principal demand components with highest captured variance in OD demand will lead

7

to non effective dimensionality reduction of the state vector. In the next subsection we will compare the

8

performance of the colored Kalman filter for reduced variables in state vector (for m = 61) and no reduced

9

variables in state vector.

10

Method performance

11

We have performed the experiments for a Vitoria network, Spain, given in Figure 3, for following two

12

scenarios:

13

• Case 1: in this experiment run, we omit the state variables (principal demand components) from

14

the state vector. Since the principal demand components in the state vector are arranged in decreasing order

15

of an eigenvalues, we remove the principal demand components that capture the lowest variance and keep

16

first m = 61 state variables;

17

• Case 2: in this experiment run we keep all state variables (principal demand components) in the

18

state vector, such that m = nij = 3249. 19

(14)

TABLE 2 Error in the solution given by the number of state variables in state vector Time interval Case 2: No reduction of stat.var. Case 1: Reduction of stat.var

RMSE t1 6.803 14.674 RMSE t2 0.537 9.774 RMSE t3 0.493 10.026 RMSE t4 0.493 9.296 RMSE t5 0.527 9.553 MAE t1 3.039 8.186 MAE t2 0.288 4.330 MAE t3 0.243 4.501 MAE t4 0.233 4.268 MAE t5 0.278 4.409

In Table2, we represent: (1) the root mean square error (RMSE) per departure time interval and (2) mean absolute error (MAE) per departure time interval, that is

RM SE= v u u t 1 n n X i=1 (¯xi− xi) (22) M AE= 1 n n X i=1 |¯xi− xi| (23)

forx¯kestimated OD demand per time interval depending on the number of the variables in state vector, n. 1

It appears clearly from Table 2that reducing the variables in state vector yield overestimation of

2

OD demand. However, we can observe that reducing the dimensionality of the state vector by more then

3

90%, the colored Kalman filter produces a reasonable reduction in accuracy. In real time applications it

4

is always a question of trade-off between the computational efficiency and result’s accuracy. Therefore, it

5

is of interest to examine the optimal number of variables in a state vector, such that the lower bound is

6

define as a minimum number of variables that capture the 95% of the variance in data set, while the upper

7

bound is given by the computation time preferences. In addition, the larger errors relate to the observability

8

problem introduced by state variables reduction. Under conditions of non - observability, the effect of the

9

initial estimates do not disappear with time and therefore it is critical to obtain accurate results or initial

10

values. Therefore, the state identifiablity must be taken into account in the optimal number of state variables

11

computation to achieve the Kalman filter convergence.

12

Note that initial idea in our work is to solve the computational complexity of the OD estimation

13

problem for real time applications. Therefore, in Table3we show the run time of colored Kalman filter for

14

each scenario (e.g. no reduction of state variables in state vector and reduced number of state variables) on

15

Vitoria network.

16

TABLE 3 CPU time computations in seconds

Time interval 1 2 3 4 5 Total

Case 1 0.21 0.32 0.18 0.12 0.11 0.94 Case 2 5.89 12.34 9.74 8.37 5.92 42.26

Table3reports that significant CPU computation time reduction can be achieved by the reduction of

17

state variables. These times have been obtained by running MATLAB on Dell with Intel Xeon, Quad Core

18

processor, 8GB (1600mHz) memory.

(15)

CONCLUSIONS

1

From the results presented in this contribution we can conclude that PCA can be used to linearly transform

2

high dimensional OD matrices into the lower dimensional space without significant loss of estimation

ac-3

curacy. We have proposed a new OD estimation method that uses the eigenvectors and principal demand

4

components as state variables instead of OD flows. These variables can be used to construct a state space

5

model that can be solved with recursive solution approaches such as the Kalman filter.

6

The proposed state space model, however, appears to be sensitive to the reduction of the

dimen-7

sionality due to the induced temporal measurement correlation. We have explored and derived an analytical

8

solution for the so-called colored noise Kalman filter algorithm that accounts for temporal correlated

mea-9

surement noise to avoid this limitation.

10

In this paper we show that reduction of state variables in proposed OD estimation model for

large-11

scale networks will lead to computational efficiency with an acceptable degradation in result’s accuracy.

12

An improvement of the algorithm presented in this paper can be seen in two directions: (1) definition of

13

the optimal number of principal demand components in state vector such that the computational efficiency,

14

results accuracy and state observability are satisfied, (2) adaptation of the model when additional data (i.e.

15

speeds, density, travel times from different technological sources) can be considered to improve the quality

16

of the estimated OD demand.

17

ACKNOWLEDGMENT

18

This research is partly funded by the ITS Edulab, a collaboration between TUDelft and Rijkswaterstaat.

19

Also,this research is supported and partly funded by the EU COST Action TU0903 MULTITUDE

Meth-20

ods and tools for supporting the Use caLibration and validaTIon of Traffic simUlation moDEls project in

21

collaboration with Delft University of Technology and KTH University.

22

REFERENCES

23

[1] Bierlaire, M. and F. Crittin. An Efficient Algorithm for Real-Time Estimation and Prediction of

Dy-24

namic OD Tables. OPERATIONS RESEARCH, Vol. 52, No. 1, 2004, pp. 116–127.

25

[2] Kattan, L. and B. Abdulhai. Noniterative Approach to Dynamic Traffic Origin-Destination Estimation

26

with Parallel Evolutionary Algorithms. Transportation Research Record: Journal of the Transportation

27

Research Board, Vol. 1964, No. -1, 2006, pp. 201–210, 10.3141/1964-22.

28

[3] Zhou, X. and H. S. Mahmassani. A structural state space model for real-time traffic origin-destination

29

demand estimation and prediction in a day-to-day learning framework. Transportation Research Part

30

B: Methodological, Vol. 41, No. 8, 2007, pp. 823–840, doi: DOI: 10.1016/j.trb.2007.02.004.

31

[4] Antoniou, C., M. Ben-Akiva, and H. Koutsopoulos. Incorporating Automated Vehicle Identification

32

Data into Origin-Destination Estimation. Transportation Research Record: Journal of the

Transporta-33

tion Research Board, Vol. 1882, No. -1, 2004, pp. 37–44, 10.3141/1882-05.

34

[5] Asakura, Y., E. Hato, and M. Kashiwadani. Origin-destination matrices estimation model using

auto-35

matic vehicle identification data and its application to the Han-Shin expressway network.

Transporta-36

tion, Vol. 27, No. 4, 2000, pp. 419–438, 10.1023/A:1005239823771.

37

[6] Dixon, M. P. and L. R. Rilett. Population Origin–Destination Estimation Using Automatic Vehicle

38

Identification and Volume Data. Journal of Transportation Engineering, Vol. 131, No. 2, 2005, pp.

39

75–82.

(16)

[7] Barcelo, J., L. Montero, L. Marquos, and C. Carmona. Travel Time Forecasting and Dynamic

Origin-1

Destination Estimation for Freeways Based on Bluetooth Traffic Monitoring. Transportation Research

2

Record: Journal of the Transportation Research Board, Vol. 2175, No. -1, 2010, pp. 19–27.

3

[8] Frederix, V. F., R. and C. Tampre. A hierarchical approach for dynamic origin-destination matrix

4

estimation on large-scale congested networks. Proceedings of the IEEE-ITSC 2011 conference, Vol.

5

Washington DC, USA., 2011.

6

[9] Lou, Y. and Y. Yin. A decomposition scheme for estimating dynamic origindestination flows on

7

actuation-controlled signalized arterials. Transportation Research Part C: Emerging Technologies,

8

Vol. 18, No. 5, 2010, pp. 643–655.

9

[10] Jolliffe, I. T. Principal Component Analysis. Springer, 2002.

10

[11] Antoniou, C., M. Ben-Akiva, and H. N. Koutsopoulos. Dynamic traffic demand prediction using

con-11

ventional and emerging data sources. Intelligent Transport Systems, IEE Proceedings, Vol. 153, No. 1,

12

2006, pp. 97–104.

13

[12] Ashok, K., M. E. Ben-Akiva, and T. Massachusetts Institute of. Dynamic origin-destination matrix

14

estimation and prediction for real-time traffic management systems. Transportation and traffic theory.,

15

1993.

16

[13] Barcelo, J. e. a. A Kalman-filter approach for dynamic OD estimation in corridors based on bluetooth

17

and Wi-Fi data collection. 12th World Conference on Transportation Research WCTR, 2010.

18

[14] Ashok, K. and M. E. Ben-Akiva. Alternative Approaches for Real-Time Estimation and Prediction of

19

Time-Dependent Origin-Destination Flows. TRANSPORTATION SCIENCE, Vol. 34, No. 1, 2000, pp.

20

21–36.

21

[15] Flotterod, G. and M. Bierlaire. Improved estimation of travel demand from traffic counts by a new

22

linearization of the network loading map. Proceedings of the European Transport Conference (ETC),

23

Netherlands, 2009.

24

[16] Golub, G. and C. van Van Loan. Matrix Computations (Johns Hopkins Studies in Mathematical

Sci-25

ences)(3rd Edition). The Johns Hopkins University Press, 1996.

26

[17] Bryson, A. E. and L. J. Henrikson. Estimation Using Sampled Data Containing Sequentially Correlated

27

Noise. J. Spacecr. Rockets, Vol. 56, No. pp.662 - 665, 1968.

28

[18] Bryson, A. E. Applied Linear Optimal Control. Cambridge University Press, Cambridge, UK, 2002,

29

p. pp. 310312.

30

[19] Djukic, T., G. Flotterod, H. van Lint, and S. Hoogendoorn, Efficient real time OD matrix estimation

31

based on Principal Component Analysis. In Proceedings of the IEEE Intelligent Transportation

Sys-32

tems Conference. IEEE, 2012, Vol. 2, pp. 115–121.

33

[20] Systems, T. T. S. Aimsun 7 Dynamic Simulator Users Manual. TSS, Barcelona, Spain, 2013.

Cytaty

Powiązane dokumenty

krajowego ustawodawstwa poza granicami kraju, oraz wyko­ nywania opieki i obrony interesów obywateli zagranicą, w dal­ szym zaś rzędzie związane z tem zagadnienia procedury przy

13 H. Stała Komisja Śledcza indagowała Kamieńskiego na temat zeznań Józefa Klatta w Poznaniu, iż Pozorski polecił go Kamieńskiemu, aby go „używał w

Прежде чем обзавестись шапкой-ушан- кой, она была обладательницей велосипеда — а мотивная связ- ка велосипед + шапка-ушанка в

The demands on MMIT have shifted over the years from being a tool to auto- mate preventive maintenance management, such as task scheduling, plant invento- ry and stock control or

In the example-based image search scenario, also retrieval models are required to estimate the relevance of an image to the query image based on the match between the visual

Zapobieganie zanieczyszczeniom powietrza odbywa się poprzez dotrzymywanie wyma- ganych prawem poziomów dopuszczalnych zanieczyszczeń w środowisku. Jakość powie- trza wpływa

Other causes of vitamin D deficiency in elderly people include: impaired response to the stimulating effect of parathormone (PTH), a deficiency of androgens and

Sección de Filología Medieval, Instituto de Filología Clásica oraz Facultad de Filosofía y Letras działające w ramach Universidad de Buenos Aires (UBA), pod patronatem wielu