matts: university of delft, 2018
TRANSCRIPT
![Page 1: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/1.jpg)
MATTS: University of Delft, 2018
Dynamical queueing, dynamical route choice,
responsive traffic control and control systems
which maximise network throughput
Michael J. Smith, Takamasa Iryo, Richard
Mounce, Marco Rinaldi, and Francesco Viti
Universities:
York, Kobe, Aberdeen, Luxembourg
![Page 2: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/2.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECK
Dynamical queueing
![Page 3: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/3.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 4: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/4.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 5: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/5.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 6: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/6.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 7: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/7.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 8: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/8.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 9: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/9.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
Dynamical queueing
![Page 10: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/10.jpg)
Route 1
ORIGINDESTINATION
O DB
Route 2
BOTTLENECKQUEUE
(STATIONARY)
Dynamical queueing
![Page 11: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/11.jpg)
SMALL Network
OriginDestination
Stage 1 S
Signal: (g1, g2)
Stage 2
bottleneck delay b2
bottleneck delay b1
X2 = route 2 flow
X1
Sat flow s2=2
Sat flow s1=1
![Page 12: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/12.jpg)
SMALL Network is not unrealistic
Destination
![Page 13: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/13.jpg)
SMALL Network is not unrealistic
Destination
![Page 14: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/14.jpg)
SMALL Network is not unrealistic
Destination
1
![Page 15: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/15.jpg)
SMALL Network is not unrealistic
Destination
1
![Page 16: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/16.jpg)
SMALL Network is not unrealistic
Destination
1
2
![Page 17: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/17.jpg)
SMALL Network is not unrealistic
Destination
1
2
![Page 18: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/18.jpg)
SMALL Network is not unrealistic
Destination
1
23
![Page 19: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/19.jpg)
Summary
The talk considers:
- A spatial queueing model (representing the space taken up by queues)
- Traffic signal control and route choice.
- Throughput maximising control when demand exceeds capacity
- P0 control and pricing results for the City of York.
![Page 20: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/20.jpg)
Summary
The talk considers:
- A spatial queueing model (representing the space taken up by queues)
DONE
- Traffic signal control and route choice.
- Throughput maximising control when demand exceeds capacity
- P0 control and pricing results for the City of York.
![Page 21: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/21.jpg)
AIM
TO REDUCE CONGESTION /
POLLUTION IN CITIES
![Page 22: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/22.jpg)
AIM
TO REDUCE CONGESTION /
POLLUTION IN CITIES
IN PART AUTOMATICALLY
![Page 23: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/23.jpg)
Modelling Signal Control and Route
Choice: Allsop, Dickson, Gartner, Akcelik, Maher, Van Vliet,
Van Vuren, Smith, Van Zuylen, Meneguzzer, Gentile,
Noekel, Taale, Cantarella, Mounce, Watling, Ke Han,
Himpe, Viti, Schlaich, Haupt, Tampere, Huang, Rinaldi,
●
●
●
Previous Work
![Page 24: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/24.jpg)
Traffic Control and Route Choice
Traffic Control Route Choice
![Page 25: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/25.jpg)
NETWORK WITH ROUTE AND
GREEN-TIME CHOICES
ORIGIN DESTINATION
Stage 1 S
Signal: (g1, g2)Stage 2
b2 = bottleneck delay
bottleneck delay b1
![Page 26: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/26.jpg)
NETWORK WITH ROUTE AND
GREEN-TIME CHOICES
ORIGIN DESTINATION
Stage 1 SRoute 1
Signal: (g1, g2)Stage 2
Route 2, cost C2
cost C1
b2 = bottleneck delay
bottleneck delay b1
![Page 27: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/27.jpg)
Control and Route-flow VariablesControls:
Green-time vector g:
g1+g2 = 1.
Route-flows:
Route-flow vector X;
X1+X2 = given steady demand T.
![Page 28: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/28.jpg)
SMALL Network
ORIGINDestination
Stage 1 S
Signal: (g1, g2)
Stage 2
bottleneck delay b2
bottleneck delay b1
X2 = route 2 flow
X1
Sat flow s2=2 (v/s)
Sat flow s1=1 (v/s)
![Page 29: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/29.jpg)
P0: Choose greens so b is “normal” to S.
• ,
0 X1 s1
2s
X2
S
DESTINATIONSIGNAL
ORIGIN
P0
X1 + X2 = T
(X1, X2)
(b1, b2)
s2
s1
s2 = 2
X2
![Page 30: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/30.jpg)
P0: Choose greens so b is “normal” to S.
• ,
0 X1 s
s2 = 2
X2 S(X1, X2)
(b1, b2)
s1b1 = s2b2
![Page 31: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/31.jpg)
Demand
MAX/2 MAX
Standard
P0
OPT
STANDARD POLICIES HALVE THE
CAPACITY OF THIS NETWORK
Average
journey
time
![Page 32: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/32.jpg)
NETWORK WITH ROUTE AND
GREEN-TIME CHOICES
ORIGIN DESTINATION
Stage 1 S
Signal: (g1, g2)Stage 2
b2 = bottleneck delay
bottleneck delay b1
![Page 33: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/33.jpg)
Equilibrium flow and P0 green-time
EXACT P0 Control Policy:
green-time g satisfies s1b1 = s2b2
EXACT route-choice equilibrium:
route-flow X satisfies C1+b1 = C2+b2
What if these conditions do not hold?
![Page 34: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/34.jpg)
ROUTE AND GREEN-TIME SWAPS
ORIGIN DESTINATION
Stage 1 SRoute 1
Route 2SIGNALStage 2
![Page 35: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/35.jpg)
ROUTE AND GREEN-TIME SWAPS
ORIGIN DESTINATION
Stage 1 SRoute 1
Route 2SIGNALStage 2
Travel cost along route 1 = C1+b1
Travel cost along route 2 = C2+b2
![Page 36: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/36.jpg)
ROUTE AND GREEN-TIME SWAPS
ORIGIN DESTINATION
Stage 1 SRoute 1
Route 2SIGNALStage 2
Travel cost along route 1 = C1+b1
Travel cost along route 2 = C2+b2
![Page 37: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/37.jpg)
ROUTE AND GREEN-TIME SWAPS
ORIGIN DESTINATION
Stage 1 SRoute 1
Route 2SIGNALStage 2
Pressure on stage 1 = s1b1
Pressure on stage 2 = s2b2
![Page 38: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/38.jpg)
ROUTE AND GREEN-TIME SWAPS
ORIGIN DESTINATION
Stage 1 SRoute 1
Route 2SIGNALStage 2
s1b1 - s2b2
controls green arrow
[C1+b1] – [C2+b2]
controls black arrow
![Page 39: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/39.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
![Page 40: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/40.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
●
![Page 41: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/41.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
●
●
![Page 42: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/42.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
●
●
●
![Page 43: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/43.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
●
●
●
●
![Page 44: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/44.jpg)
*** HOPE: Stability ***V(X,g) = 4
V(X,g) = 2
V(X,g) = 1
V(X,g) = 3
EQUILIBRIUM:
V(X,g) = minimum
●
●
●
●
●
![Page 45: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/45.jpg)
HOPE: WITH P0 MANY DYNAMICAL
MODELS HAVE STABILITY!!!
EQUILIBRIUM:
V(X,g) = minimum
●
●
●
●
●
![Page 46: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/46.jpg)
Other policies?
STABLE WITH STANDARD POLICIES ???
![Page 47: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/47.jpg)
Other policies?
STABLE WITH STANDARD POLICIES ???
NO!
![Page 48: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/48.jpg)
CONTROL WHICH
MAXIMISES
THROUGHPUT
Even when demand
exceeds capacity
![Page 49: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/49.jpg)
ORIGIN
DESTINATION
SIGNAL
ss
G
1-G
![Page 50: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/50.jpg)
ORIGIN
DESTINATION
SIGNAL
ss
MAXIMUM FLOW = s/2
G
1-G
![Page 51: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/51.jpg)
00 s/2 D
1
1/2
G
![Page 52: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/52.jpg)
00 s/2 D
1
1/2
G
![Page 53: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/53.jpg)
00 s/2 D
1
1/2
G
![Page 54: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/54.jpg)
00 s/2 D
1
1/2
G
OK
![Page 55: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/55.jpg)
00 s/2 D
1
1/2
G
OK
NOT OK
![Page 56: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/56.jpg)
00 s/2 D
1
1/2
G
![Page 57: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/57.jpg)
SUMMARY
P0 modified maximises
throughput of ONE network even
when demand exceeds capacity
![Page 58: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/58.jpg)
SUMMARY
P0 modified maximises
throughput of ONE network even
when demand exceeds capacity
Further work: Generalise!!!
![Page 59: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/59.jpg)
QUESTIONS?
![Page 60: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/60.jpg)
Other related work
Le, T., Kovacs, P., Walton, N., Vu, H. L.,
Andrew, L. H., Hoogendoorn, S. P. 2015.
Decentralised Signal Control for Urban Road
Networks. Transportation Research Part C,
58, 431-450. (Proportional Control Policy)
Peter Kovacs, Tung Le, Rudesindo Nunez-
Queija, Hai L. Vu, Neil Walton, Proportional
green time scheduling for traffic lights.
![Page 61: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/61.jpg)
YORK RESULTS
These were obtained by Mustapha
Ghali using a dynamic
equilibrium program called
CONTRAM (used to be supported
by the Transport and Road
Research Laboratory in the UK)
![Page 62: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/62.jpg)
![Page 63: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/63.jpg)
![Page 64: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/64.jpg)
![Page 65: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/65.jpg)
![Page 66: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/66.jpg)
![Page 67: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/67.jpg)
![Page 68: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/68.jpg)
![Page 69: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/69.jpg)
![Page 70: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/70.jpg)
Questions?
![Page 71: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/71.jpg)
P0: s1b1 = s2b2
1 BA
C2=C1+Δ
C1
b2
b1
![Page 72: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/72.jpg)
P0: s1b1 = s2b2
P0 with prices: s1p1 = s2p2
1 BA
C2=C1+Δ
C1
p2
p1
![Page 73: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/73.jpg)
P0: s1b1 = s2b2
P0 with prices: s1p1 = s2p2
1 BA
C2
C1
p2
p1
Prices do not
block back
![Page 74: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/74.jpg)
P0: s1b1 = s2b2
P0 with prices: s1p1 = s2p2 FEASIBLE EQM
1 BA
C2
C1
p2
p1
Prices do not
block back
![Page 75: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/75.jpg)
P0: s1b1 = s2b2 NO FEASIBLE EQM
P0 with prices: s1p1 = s2p2 FEASIBLE EQM
1 BA
C2
C1
b2
b1
![Page 76: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/76.jpg)
P0: s1b1 = s2b2 NO FEASIBLE EQM
P0 with prices: s1p1 = s2p2 FEASIBLE EQM
1 BA
C2
C1
b2
b1
UNBOUNDED QUEUES and DELAYS
![Page 77: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/77.jpg)
P0: s1b1 = s2b2 NO FEASIBLE EQM
P0 with prices: s1p1 = s2p2 FEASIBLE EQM
1 BA
C2
C1
b2
b1
UNBOUNDED QUEUES and DELAYS
![Page 78: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/78.jpg)
P0: s1b1 = s2b2
P0 with prices: s1p1 = s2p2
1 BA
C2
C1
p2
p1
![Page 79: MATTS: University of Delft, 2018](https://reader031.vdocuments.site/reader031/viewer/2022020912/62024bfd3f31ee10eb043eb6/html5/thumbnails/79.jpg)
Questions?