Document 13494448

advertisement

Urban OR 2000: Quiz 1 Solutions

11/10/2000

Problem 1 a) λ

0,1

1 taxi waiting

λ

0,0

½ λ

λ

1,0

1 passenger waiting

π

0,1

= π

0,0

π

1

2

π

0,0

0,1

+

= π

1,0

π

0,0

+ π

1,0

= 1

∴ π

0,1

= 2

5 ;

π

0,0

= 2

5 ;

π

1,0

= 1

5 b)

Prepared by JTH

The chance that a passenger arriving at the taxi stand actually leaves it in a cab is:

π

0,1

+ 1

2

π

0,0

= 3

5 c)

The chance that a taxi stops is:

π

0,0

+ π

1,0

= 3

5

This is the same as b) because λ

T

= λ

P

which implies that taxis and customers reach the stand at the same rate. Because, over the long run, the number of cabs that leave with customers is the same as the number of customers who leave in cabs, the FRACTION of arrivals that leave happily must be the same for taxis and customers. d)

To find the average waiting time for passengers who leave by taxi, determine the expected waiting time for passengers and divide by the chance that an arriving passenger leaves by taxi:

( ) π

π

0,1

0,1

+

+ π

1

λ

π

1,0

1,0

=

� 1 � 1

� λ

3

� 5

=

1

3 λ

5

e)

For two passengers in a row to leave by taxi and have zero waits, we must be in state (0,1) when the first passenger arrives. Then, another taxi must arrive before the next passenger, in which case the taxi will wait for the passenger and the passenger’s wait will be zero. The chance of the first of these events is 2/5; the conditional probability of the second given the first is 1/2 (because lambda is the same for taxis and passengers) :

π

0,1

λ

λ

+ λ

=

2

5

1

2

=

1

5

Urban OR 2000: Quiz 1 Solutions

11/10/2000

Problem 2: a)

Prepared by JTH b)

1 o

B o

A

1

Note: Within triangle f

X , Y

( x , y

)

= 2

For one facility at A:

[ ]

=

[ ]

+

[ ]

=

2 1

3 3

= 1

III

½

II I o

B ½ o

A

Demands in I use facility A, demands in II and III use B.

We have:

E

[ ]

=

[ ]

⋅ E

[

D I

]

+ P

[ ]

⋅ E

[

D II

]

+ P

[ ]

⋅ E

[

D III

]

[ ]

= ⋅

=

1

1

+

+

5

=

7

+

1

2

1

2

+

1

2

+

1

4

⋅ + ⋅

c)

1 o

B

Note: D x

1

(the distance from B to demand along x axis) is not independent of D

(the distance along y axis), therefore, we cannot simply add σ 2

D x and σ 2

D y y to find the total variance. Instead, we must derive σ

[ ]

=

[ ]

+

[ ]

=

1

3

+

1

3

=

2

3

[ ]

=

1 1 − x

� � ( x + y

) 2 f

X , Y

( )

0 0 x , y dxdy =

1

2 and

σ 2

D

=

9

18

2

3

2

=

1

18

2

D

from the first principle.

d)

VI

½

V

¼ o

VI

B

III

II

¼ ½

I o

A

Demands in I and II use A, demands in III, IV, V, and VI use B.

Note: only demands in II and III are affected by the presence of the barrier.

Region Probability E[D] (to closest facility)

I

II

III

IV

¼

1

16

1

16

1

8

1

2

1

2

1

8

( )

+

+

+ 1 1

( )

( )

+ 1

8

= 1

4

( )

+

+

=

( )

( )

1

2

=

=

2

3

2

3

V ¼

VI ¼ 1

2

1

4

+

+

1

4

+

( )

1

8

+

= 51

8

( )

= 5

6

Multiplying out: E

[ ]

=

29

48

Alternatively, we could have estimated that the extra distance caused by the barrier is equal to 1/48 and, therefore,

[ ]

=

7

12

+

1

=

29

48 48

Download