18
HAL Id: hal-00935351 https://hal.inria.fr/hal-00935351 Preprint submitted on 23 Jan 2014 HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Gradient-based Instantaneous Traffc Flow Optimization on a Roundabout Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa. Gradient-based Instantaneous Traffc Flow Optimization on a Roundabout. 2014. hal-00935351

Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

  • Upload
    others

  • View
    0

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

HAL Id: hal-00935351https://hal.inria.fr/hal-00935351

Preprint submitted on 23 Jan 2014

HAL is a multi-disciplinary open accessarchive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come fromteaching and research institutions in France orabroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, estdestinée au dépôt et à la diffusion de documentsscientifiques de niveau recherche, publiés ou non,émanant des établissements d’enseignement et derecherche français ou étrangers, des laboratoirespublics ou privés.

Gradient-based Instantaneous Traffic Flow Optimizationon a Roundabout

Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa

To cite this version:Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa. Gradient-based Instantaneous Traffic FlowOptimization on a Roundabout. 2014. hal-00935351

Page 2: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

r♥ts ♥st♥t♥♦s r ♦ ♣t♠③t♦♥

♦♥ ♦♥♦t

ss s∗ P♦ ♦t♥† ♥ ♠ ss‡

♣rt♠♥t ♦ t♠ts s ❯♥rst② t♦♣♥r ♦♣♥t♣♦s étrr♥é P P ♦♣ ♥t♣♦s r♥

♣rt♠♥t ♦ t♠ts s ❯♥rst② t♦♣

♥r②

strt

♥ ts rt ♦s ♦♥ ♥st♥t♥♦s tr ♦ ♦♣t♠③t♦♥ ♦♥ r♦♥♦t s♥ ♠r♦s♦♣ ♣♣r♦ r♦♥♦t s ♠♦ s ♦♥t♥t♦♥ ♦ 2× 2 ♥t♦♥st ♦♥ ♠♥ ♥ ♥ s♦♥r② ♥♦♠♥ ♥ ♦t♦♥ r♦s ❲ ♦♥sr ♦st ♥t♦♥ tt ♠srs t t♦t tr t♠ s♣♥t ② rrs ♦♥ t r♦♥♦t ♥ ♦♠♣tts r♥t t rs♣t t♦ t ♣r♦rt② ♣r♠trs t ♥t♦♥s ♥ tr♦ ♥♠rs♠t♦♥s t tr ♦r s st ♦♥ t ♦ r♦♥♦t ♥♠r ♣♣r♦①♠t♦♥s ♦♠♣r t ♣r♦r♠♥ ♦ r♦♥♦t ♦r ♥st♥t♥♦s ♦♣t♠③t♦♥ ♦t ♣r♦rt② ♣r♠trs ♥ ① ♦♥st♥t ♣r♠trs

②♦rs r ♦ r♦♥♦t sr ♦♥srt♦♥ s r♥ts ♦♣t♠③t♦♥

st sst♦♥

♥tr♦t♦♥

♦r♥s ♦ ♠r♦s♦♣ tr ♦ ♠♦s t t♦ s ♥ t s♠♥ ♦rs ♦t ♥ ❲t♠ ❬❪ ♥ rs ❬❪ ♣r♦♣♦s ②♥♠ ♠♦ ♦r r tr♦ ♦♥ ♥ ♥♥t s♥ r♦ ♦♠♠♦♥② ♥♦t s ❲ s ♠♦ s ♥ ①t♥ t♦r♦ ♥t♦rs ② sr t♦rs ♥ ♠♦st r♥t ②rs s ❬ ❪ ♥ rr♥s tr♥ ♥t ♥t♦r stt♥ ♦♥♠♥s♦♥ ②♣r♦ s②st♠s ♦ ♦♥srt♦♥ s r s♦ ♥ ♥tr♠♦r ♦r ♠♦♥ s ♣♣♥ ♦ ❬❪ t ♥t♦rs ❬❪ ♥ s♣♣② ♥s ❬❪ s

∗ ♦rrs♣♦♥♥ t♦r① ♠ ♦♠♦♠

† ① ♠ ♣♦♦t♥♥rr

‡ ① ♠ s♠♠tt

Page 3: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

♠♦s s♦ ♥ t③ ♦r t ♦♣t♠③t♦♥ ♦ r tr ♦ ♦♥ r♦ ♥t♦rstr♦ r♦s ♣♣r♦s s ♦r ①♠♣ ❬ ❪ ♣t♠ ♦♥tr♦ ♦ tr ♦ ♦♥♥t♦rs ♥ ♥stt ② r♥t t♦rs s♥ r♥t ♦♣t♠③t♦♥ t♥qst ♣rs♥tt♦♥ ♥ ♥②ss ♥ ♦♥ ♦r ①♠♣ ♥ ❬❪ ♥ rr♥ tr♥

②♣r♦ ♦♥srt♦♥ s ♠② ♥♦♥♥r ♥ t♦ ♥♦♥♦♥① ♦r ♥♦♥♥r ♦r♠t♦♥s ♦ t ♦rrs♣♦♥♥ ♦♣t♠③t♦♥ ♣r♦♠ ♥ s ss r ♦♣t♠③t♦♥ t♥qs①st ♦r t srt③ rs♦♥ ♦ t ♣r♦♠s t♥ ♦r ♦♥① ♣r♦♠s ♥ ♣♣r♦ s t♦♣♣r♦①♠t t s②st♠ t r① rs♦♥ ♥ ♦rr t♦ s ♥t ♥r ♣r♦r♠♠♥ t♥qs ♥r③t♦♥ ♣♣r♦ s s ♥ ❬❪ ♦r ♦♣t♠ r♠♣ ♠tr♥ s♥ ♦♥♦srt③t♦♥ s♠

♦r ♥♦♥♥r ♦♣t♠③t♦♥ t♥qs s s r♥t s♥t ♠t♦ ♥ ♣♣ t♦t srt③ s②st♠ t♦t ♥② ♠♦t♦♥ t♦ t ♥r②♥ ②♥♠s r♥t s♥ts rst♦rr ♦♣t♠③t♦♥ ♦rt♠ s ♥♦ r♥t ♦r ♥♥ ♥q ♦♠♥♠♠ ♥ ♥r

♦ ♥st♥t♥♦s ♦♥tr♦ s ♥ sss ♥ ❬❪ ♦r t ♦♣t♠③t♦♥ ♦ tr ♦♣r♦♠s ♦♥ r♦ ♥t♦rs ♣r♣♦s s t♦ ♠♥♠③ r st♦r rqr♠♥ts rs♥ r♦♠t ♥t♦r strtr ♥ t str♦♥ ♦♣♥ ♦ ♦♥ts ♥ stt qt♦♥s ② ♥rt♥ sq♥ ♦ ♦♣t♠ ♦♥tr♦ ♣r♦♠s ♦ r ♠♥s♦♥ ♥ ts rt rtr t♥ ♥rt♥ sq♥ ♦ s♦♣t♠ ♦♥tr♦ ♣r♦♠s ♦♠♣t t r♥t ♦ t ♦st ♥t♦♥ t t♠ st♣ tn t♦ ♦t♥ t ♦♣t♠ ♣r♦rt② ♣r♠trs ❲ ♣♣② t ♣r♦r t♦ ♠♥♠③ tt♦t tr t♠ r♦ss r♦♥♦t ♦r♥ r♦♥♦ts r ♥♦ ♦♥sr s ♥ tr♥ttr ♦♥tr♦ tt ♥ ♠♣r♦ st② ♥ ♦♣rt♦♥ ♥② t ♥trst♦♥s ♥♦♠♣r t♦ ♦tr ♦♥♥t♦♥ ♥trst♦♥ ♦♥tr♦s s② ♦r tr ♦ ♠♥♠♥t ♦r t♦♠♣r♦ st② ❬❪ ♦♥♦ts ♥ s♥ s ♣rtr r♦ ♥t♦rs ♥ ♥ ♠♦s ♣r♦ ♦♥t♥t♦♥ ♦ ♥t♦♥s ❲ ♦♥sr r♦♥♦t t rtrr② m ♥♦♠♥♥ m ♦t♦♥ r♦s m ∈ N r sr s ♦♥t♥t♦♥ ♦ m 2 × 2 ♥t♦♥st t♦ ♥♦♠♥ ♥ t♦ ♦t♦♥ r♦s ♥ ♣rtr ♥t♦♥ s ♦♥ ♥♦♠♥ ♠♥♥ ♦♥ ♦t♦♥ ♠♥ ♥ ♥ tr ♥ t ♥♦♠♥ ♥ ♦t♦♥ ①s trr♦ s ♠♦ ② r ♦ ♥♥t ♣t② ♦r t ♥tr♥ ① ♥ t ♥ ♥♥t s♥♦r t ①t♥ ♦♥ ♠♥ ♥ ♦t♦♥ s sr ② sr ②♣r♦ ♦♥srt♦♥ rs t r ②♥♠s s sr ② ♥ ♦r♥r② r♥t qt♦♥ ♣♥s ♦♥ t r♥ t♥ t ♥♦♠♥ ♥ ♦t♦♥ ①s ♦♥ t ♥

rt s strtr s ♦♦s ♥ t♦♥ sr t ♠t♠t ♠♦ ♦rt r♦♥♦t ♥ t ♦r♥♥ qt♦♥s ♥ t♦♥ ♣rs♥t t s♦t♦♥ ♦ t ♠♥♥ ♣r♦♠ t ♥t♦♥s t♦♥ ts ♥♠r ♣♣r♦①♠t♦♥s ♥ stts t ♣t♣r♦r ♥ t♦♥ sr t ♦♣t♠③t♦♥ ♣r♦♠ ♦ P ♦♥str♥ s②st♠♥ t ♦r♠t♦♥ ♦ t ♥st♥t♥♦s ♦ ♦♣t♠③t♦♥ t♦♥ s ♦t t♦ ♥♠rs♠t♦♥s ♥② ♦♥s♦♥s ♥ t♦♥

t♠t ♦ ♦r t ♦♥♦t

♥ ts ♦r ♦♥sr r♦♥♦t ♦♥♥ m r♦s m ∈ N m ≥ 2 s strt ♥ r

Page 4: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

J1 Jm−2

Jm

J2J3

Jm−1

r t ♦ t r♦♥♦t ♦♥sr ♥ t rt

r♦♥♦t ♥ s♥ s ♥ ♦r♥t r♣ ♥ r♦s r r♣rs♥t ② rs ♥♥t♦♥s ② rt①s ♥ ♦r♠♥ t r♦♥♦t s ♠♦ ② ♥trs Ii = [xi−1, xi]⊂ R xi−1 < xi i = 1, 2, . . . ,m ♥t♦♥ Ji s ♦t t x = xi ♦r i = 1, 2, . . . ,m

JiIi Ii+1

ri ri+1

r t ♦ r♦♥♦t ♥t♦♥

♦ r♦r t ♦r ♦ t r♦♥♦t ♣r♦ ♦♥r② ♦♥t♦♥s r ♥tr♦ ♦♥t ♠♥ ♥ s tt xm = x0 ♥t♦♥ s ♦♠♣♦s ♦ ♠♥ ♥ ♥ ② t♦ ♥sr♣rs♥t♥ ♥ t ♥♦♠♥ ① (ri) ♥ ♥ t ♦t♦♥ ① (ri+1) s r ♦t♦♥ ♦ t tr ♦ ♦♥ t ♠♥ ♥ s♠♥ts s ♥ ② t sr ②♣r♦♦♥srt♦♥

∂tρi + ∂xf(ρi) = 0, (t, x) ∈ R+ × Ii, i = 1, 2 . . . ,m,

r ρi = ρi(t, x) ∈ [0, ρmax] s t ♠♥ tr ♥st② ρmax t ♠①♠ ♥st② ♦ ♦♥t r♦ ① ♥t♦♥ f : [0, ρmax] → R

+ s ♥ ② ♦♦♥ ①♥st② rt♦♥

f(ρ) =

ρvf 0 ≤ ρ ≤ ρc,fmax

ρmax − ρc(ρmax − ρ) ρc ≤ ρ ≤ ρmax,

t vf t ♠①♠ tr s♣ ρc =fmax

vft rt ♥st② ♥ fmax = f(ρc) t ♠①♠

① ❲ ♥ t ♦♥st ♦ s♣ s wf =fmax

ρmax − ρc♦r ρc ≤ ρ ≤ ρmax r♦

♦t t ♣♣r ♦r s♠♣t② ss♠ ρmax = 1 ♥ vf = 1 r s♦s ♥ ①♠♣♦ ① ♥t♦♥ sts②♥ t ②♣♦tss ♦r t t♦r② ♦ sr ②♣r♦ ♦♥srt♦♥ s rr t♦ ❬❪

Page 5: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

ρρc ρmax

fmax

f(ρ)

vf fmax

ρmax−ρc

r ① ♥t♦♥ ♦♥sr

♥♦♠♥ ♥s ♦ t s♦♥r② r♦s ♥tr♥ t ♥t♦♥s r ♠♦ ② rs ♦♥♥t s③ ♥ ♣t② ♦t♦♥ ♦ t q ♥t ♦ r s sr ② t♦♦♥

d

dtli = F in

i − γri , t ∈ R+, i = 1, 2 . . .m,

r li(t) ∈ [0,+∞[ s t q ♥t F ini t ① ♥tr♥ t ♥ ♥ γri t ① ①t♥

t ♥ ♦t♦♥ ♥ s ♦♥sr s s♥ tt ♣ts t ① ♦♠♥ r♦♠ tr♦♥♦t ♦ ① r♦♠ t ♥♦♠♥ ♥ s ♦ t♦ tr♥ ♦♥ t ♦t♦♥ strt ♦t s♠ r♦ ② ♣r♦♠ t♦ s♦ s t♥

∂tρi + ∂xf(ρi) = 0, (t, x) ∈ R+ × Ii,

d

dtli(t) = F in

i − γri , t ∈ R+,

ρi(0, x) = ρ0i x ∈ Ii,

li(0) = li,0

♦r i = 1, 2 . . . ,m r ρi,0(x) r t ♥t ♥sts ♦♥ Ii ♥ li,0 t ♥t ♥ts ♦t rs s ♦♣ t ♥ ♦♣t♠③t♦♥ ♣r♦♠ t t ♥t♦♥s tt s tstrt♦♥ ♦ tr ♠♦♥ t r♦s❲ ♥ t ♠♥ d(F in

i , li) ♦ t ♥♦♠♥ ♥ ♦r t s♦♥r② r♦ t ♠♥ ♥t♦♥δ(ρi) ♦♥ t ♥♦♠♥ r♦♥♦t s♠♥t t ♥t♦♥ ♥ t s♣♣② ♥t♦♥ σ(ρi) ♦♥t ♦t♦♥ ♠♥ ♥ s♠♥t t ♥t♦♥ s ♦♦s

d(F ini , li) =

γmaxri li(t) > 0,

min (F ini , γmax

ri ) li(t) = 0,

δ(ρi) =

f(ρi) 0 ≤ ρi < ρc,fmax ρc ≤ ρi ≤ 1,

σ(ρi) =

fmax 0 ≤ ρi ≤ ρc,f(ρi) ρc < ρi ≤ 1,

♦r i = 1, 2, . . . ,m r γmaxri s t ♠①♠ ♦ ♦♥ t ♥♦♠♥ ♥ ri i = 1, 2, . . . ,m

♦r♦r ♥tr♦ βi ∈ ]0, 1[ t s♣t rt♦ ♦ t ♦t♦♥ ♥ ri+1 ♥ ts ① γri+1(t) =

βf(ρi(t, 0−)), i = 1, 2 . . . ,m

Page 6: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

♥t♦♥ ♦♥sr r♦♥♦t s ♥ r 2mt♣

(ρi, li)i=1,...,m ∈

m∏

i=1

C0(R

+;L1 ∩ ❱(R))×

m∏

i=1

W1,∞(R+;R+)

s ♥ ♠ss s♦t♦♥ t♦

ρi stss t r♦ ♥tr♦♣② ♦♥t♦♥ ❬❪ ♦♥ (R+ × Ii), tt s ♦r r② k ∈ R ♥♦r ϕ ∈ C1

c (R× Ii), t > 0,

∫R+

∫Ii(|ρi − k|∂tϕ+ sgn (ρi − k)(f(ρi)− f(k))∂xϕ)dxdt

+∫Ii|ρi,0 − k|ϕ(0, x)dx ≥ 0; i = 1, 2, . . . ,m.

f(ρi(t, xi−)) + γri(t) = f(ρi+1(t, xi+)) + γri+1(t) i = 1, 2, . . . ,m

♦t♦♥ ① f(ρi+1(t, xi+)) s ♠①♠♠ st t♦

f(ρi+1(t, xi+)) = min((1− βi)δ(ρi(t, xi−)) + d(F in

i (t), li(t)), σ(ρi+1(t, xi+))),

♥ 2

li s♦s ♦r ♠♦st r② t ∈ R+.

♠r ♣r♠tr qi ∈]0, 1[ s ♥tr♦ t♦ ♥sr ♥q♥ss ♦ t s♦t♦♥ tt s qis ♣r♦rt② ♣r♠tr tt ♥s t ♠♦♥t ♦ ① tt ♥trs t ♦t♦♥ ♠♥♥ r♦♠ ♥♦♠♥ r♦ ♥ ♣rtr ♥ t ♣r♦rt② ♣♣s qif(ρi+1(t, xi+1/2−)) s t ①♦ r♦♠ t ♥♦♠♥ ♠♥♥ ♥t♦ t ♦t♦♥ ♠♥♥ ♥ (1− qi)f(ρi+1(t, xi+1/2−))t ① r♦♠ t ♦♥r♠♣

♠♥♥ Pr♦♠ t ♥t♦♥

♥ ts st♦♥ r r② t ♦♥strt♦♥ ♦ t ♠♥♥ s♦r t ♥t♦♥ ♦♦♥ ❬❪t ♠♦t♦♥ ♦♥ Γi ♥ ♦rr t♦ ♠t ♣r♦rt② ♦♥t♦♥s ♦♥ t r♦♥♦t ❲ ♥ t♠♥♥ ♦r t ♥t♦♥ ② ♠♥s ♦ ♠♥♥ ♦r RS l : [0, 1]

2 → [0, 1]2 ♣♥s♦♥ t ♥st♥t♥♦s ♦ ♦ t r l ♦r l t ♠♥♥ ♦r RS l(ρi, ρi+1) =(ρi, ρi+1) s ♦♥strt ♥ t ♦♦♥ ② ♦r i = 1, . . . ,m ① qi ∈ [0, 1] ♥♣r♦

♥ Γi = f(ρi(t, xi−)) Γi+1 = f(ρi+1(t, xi+)) Γri = γri(t)

♦♥sr t s♣ Γi Γri ♥ t sts Oi = [0, δ(ρi)] Ori = [0, d(F ini , l)]

r t ♥s (1− βi)Γi + Γri = Γi+1 ♥ Γi =qi

(1− qi)(1− βi)Γri

♦♥sr t r♦♥

Ωi =(Γi,Γri) ∈ Oi ×Ori : (1− βi)Γi + Γri ∈ [0,Γi+1]

.

r♥t stt♦♥s ♥ ♦r ♣♥♥ ♦♥ t ♦ Γi+1

Page 7: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

• ♠♥♠t s Γi+1(1− βi)δ(ρi) + d(F ini , l)

❲ st Γi = δ(ρi) Γri = d(F ini , l) ♥ Γi+1 = (1 − βi)δ(ρi) + d(F in

i , l), s strt ♥r

• ♣♣②♠t s Γi+1 = σ(ρi+1)

❲ st Q t♦ t ♥trst♦♥ ♣♦♥t ♦ (1−βi)Γi+Γri = Γi+1 ♥ Γi =qi

(1− qi)(1− βi)Γri

Q ∈ Ωi st (Γi, Γri) = Q ♥ Γi+1 = Γi+1 s r Q /∈ Ωi stΓiΓriS ♥ Γi+1 = Γi+1 r S s t ♣♦♥t ♦ t s♠♥t Ωi∩(Γi,Γri) : (1− βi)Γi + Γri = Γi+1

♦sst t♦ t ♥ Γi =qi

(1− qi)(1− βi)Γri s r

Γrid(F ini , l)

Γi

δ(ρi)

Γi+1 = (1− βi)Γi + Γri

Q

♠♥♠t s

Γrid(F ini , l)

Γi

δ(ρi)

Γi+1 = (1− βi)Γi + Γri

Γi =qi

(1−qi)(1−βi)Γri

Q

♣♣②♠t s ♥trst♦♥ ♥s Ωi

Γrid(F ini , l)

Γi

δ(ρi)

Γi+1 = (1− βi)Γi + Γri

Γi =qi

(1−qi)(1−βi)Γri

Q

S

Γrid(F ini , l)

Γi

δ(ρi)

Γi+1 = (1− βi)Γi + Γri

Γi =qi

(1−qi)(1−βi)Γri

Q

S

♣♣②♠t s ♥trst♦♥ ♦ts Ωi

r ♦t♦♥s ♦ t ♠♥♥ ♦r t t ♥t♦♥

❲ ♥ t ♥t♦♥ τ s ♦♦s ♦r ts s ❬❪

♥t♦♥ t τ : [0, 1] → [0, 1] t ♠♣ s tt

Page 8: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

• f(τ(ρ)) = f(ρ) ♦r r② ρ ∈ [0, 1]

• τ(ρ) 6= ρ ♦r r② ρ ∈ [0, 1] \ ρc.

♦r♠ ♦♥sr ♥t♦♥ Ji ♥ ① ♣r♦rt② ♣r♠tr qi ∈]0, 1[ ♦r r② ρ0i , ρ0i+1 ∈

[0, 1] ♥ l0i ∈ [0,+∞[ tr ①sts ♥q ♠♠ss s♦t♦♥ (ρi(t, x), ρi+1(t, x), li(t)) sts②♥ t ♣r♦rt② ♣♦ss② ♥ ♥ ♣♣r♦①♠t ② ♦r♦r tr ①sts ♥q ♦♣(ρi, ρi+1) ∈ [0, 1]2 s tt

ρi ∈

ρ0i ∪]τ(ρ

0i ), 1] 0 ≤ ρ0i ≤ ρc,

[ρc, 1] ρc ≤ ρ0i ≤ 1,f(ρi) = Γi,

ρi+1 ∈

[0, ρc] 0 ≤ ρ0i+1 ≤ ρc,ρ0i+1 ∪ [0, τ(ρ0i+1)[ ρc ≤ ρ0i+1 ≤ 1,

f(ρi+1) = Γi+1.

♦r t ♥♦♠♥ r♦ t s♦t♦♥ s ♥ ② t (ρ0i , ρi) ♦r t ♦t♦♥ r♦ ts♦t♦♥ s ♥ ② t (ρi+1, ρ

0i+1) rtr♠♦r ♦r ♠♦st r② t > 0 t ♦s

(ρi(t, xi−), ρi+1(t, xi+)) = RSli(t)(ρi(t, xi−), ρi+1(t, xi+)).

♦r t ♣r♦♦ rr t rr t♦ ❬❪

♠r ♣♣r♦①♠t♦♥

♦ ♦♠♣t ♣♣r♦①♠t s♦t♦♥s ♣t t ss ♦♥♦ s♠ t♦ ♦r ♣r♦♠ ts♦♠ st♠♥t t♦ t ♣rs♥ ♦ t r s t ♥ t♦♥ ❲ s t ♦♦♥♥♦tt♦♥ t♦ ♥ ♥♠r r ♥ (0, T )× [x0, xm]

• xi i = 0, . . . ,m r t ♥trs

• Li = xi−xi−1 r♣rs♥ts t ♥t ♦ s♠♥t ♦ t r♦♥♦t ♥ ∆t s t t♠st♣ t♦ ♥ ♦r♥ t stt② ♦♥t♦♥ ♦

• tn = tn−1 +∆t n ∈ N r t t♠ r ♣♦♥ts

♦♥♦ ♠ t ♥t♦♥s

♥ ts ♦r ♦♥sr t st♥ t♥ t♦ ♥t ♥t♦♥s ♦ r♦♥♦t s t ①s♣ r s③ ♦ t ♦♥♦ srt③t♦♥ ♥ ♥t♦♥s s ♥trs s s s ♥ ♦ t r♦♥♦t s rs♦♥② s♦rt t♦ t t s♠ srt③t♦♥ ♥ ts stt♥♦♥ t ♠♥ r♦ ♦ t r♦♥♦t st

ρn+1i = ρni −

∆t

Li

(Fn,−i − Fn,+

i−1

), i = 1, 2, . . . ,m,

rFn,−i = Fn,−

i

(ρni , ρ

ni+1, qi, li, F

ini

)

Fn,+i−1 = Fn,+

i−1

(ρni−1, ρ

ni , qi−1, li−1, F

ini−1

),

i = 1, 2, . . . ,m.

①s Fn,+i−1 ♥ Fn,−

i st♥ rs♣t② ♦r ♥♦ Γi ♥ ♦t♦ Γi+1 t ♥t♦♥s Ji−1

♥ Ji ♦♥ t ♠♥ r♦ ♦ t r♦♥♦t

Page 9: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

❯♥r t ♦r♥trrs② ♦♥t♦♥ ❬❪

∆t ≤mini Li

λmax

r λmax = maxvf , wf s ♦♥t♦♥ ♥srs tt s ♦r♥t♦♥ t ♥ ♥tr ♦ ♥♦tr♦ss ♦tr ♥trs ♦r ∆t

♦♠♣t♥ r ♥t r♦♠

❲ ♦♥sr t r ♦t♦♥ sr ② t♦ ♦♠♣t t q ♥t ♦♥ t s♦♥r②r♦ ♦ r♦♥♦t t t♠ st♣ tn = tn−1 +∆t ♣t t ♥ ♦ t q♥t s ♦♦s

F ini ≥ γri t r ♥t s ♥rs♥ ♥ st

ln+1i = lni +

(F ini − γri

)∆t, i = 1, 2, . . . ,m.

F ini < γri t r ♥t s rs♥ ♥ st

ti =lni

γri − F ini

+ tn

t t♠ t t r ♠♣ts

tn+1 < ti

ln+1i = lni +

(F ini − γri

)∆t, i = 1, 2, . . . ,m;

ti < tn+1 ∆t = t− tn ♥ ln+1i = 0

♣t ♦♥♦ ♠

❲ t r t s♠ s ♦r ♥♠r ♦♠♣tt♦♥s ❲ ♣t t s ♦ ♦♣t♠♣r♦rt② ♣r♠tr ♣♥♥ ♦♥ t stt♦♥ t ♥t♦♥ ♦ r♦♥♦t s t ♥ t♦♥ ♥ t stt rs s ♦♦s

♦rt♠ tt r ♣t ♣r♦r

♥♣t stts t t♠ tn (ρni , lni )i=1,...,m

t♣t stts t t♠ tn+1 (ρn+1i , ln+1

i )i=1,...,m

ti > tn+1 ♦r ti ≤ tn ∀i st tn+1 = tn +∆t ♥ ♣t t ♥st② ♦♥ r♦♥♦tt ♦♥♦ ①s t ♥t♦♥s

ρn+1i = ρni −

∆t

Li

(Fn,−i − Fn,+

i−1

), i = 1, 2, . . . ,m,

♥ t r ♥ts t ♥t♦♥ Ji ♦ t r♦♥♦t t

ln+1i = lni +∆t

(F ini − γri

), i = 1, 2, . . . ,m.

Page 10: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

tn < ti < tn+1 ∃i ∈ 1, 2, . . . ,m st tn+1 = ti ♥ ∆t = tn+1 − tn ♣t t♥st② ♦♥ t r♦♥♦t t ♦♥♦ ①s t ♥t♦♥s

ρn+1i = ρni −

∆t

Li

(Fn,−i − Fn,+

i−1

), i = 1, 2, . . . ,m,

♥ t r ♥ts

ln+1i = lni +

(F ini − γri

)∆t, i = 1, 2, . . . ,m.

s ♦rt♠ ts s ♥♣ts t stts ρni , ♥ lni t t♠st♣ n ♦r r♦♥♦t ♥s♥ ♦♥ t ♥♦♠♥ s♦♥r② r♦s ♥ rtr♥s t stts ♥ ② ♦♥ t♠ st♣

♦ ①♣t Fn,±i ♥ γri s ♦♥ r♥t ss ♦ ♠♥♥ ♦rs t ♥t♦♥

stt♦♥ t ♥t♦♥s ♥ ♠♥♠t ♦r s♣♣②♠t ♦t ss r t

♠♥♠t s t ♥t♦♥ Ji (1− βi)δ(ρni ) + d(F in

i , lni ) ≤ σ(ρni+1)

♥ ts s st Γi = δ(ρi−1) ♥ γri = d(F ini , li) r♦♠ ts t s ♥t tt t♦s ♦

♠♥ t♦ ♥tr t ♥t♦♥ ♥ ssss t t♦t rstrt♦♥ ♥

Fn,+i = (1− β)δ(ρni ) + d(F in

i , lni )

♥ t t ♥st♥t t♠ tn t ① t t t s ♦ t ♥t♦♥ rs s

Fn,−i = δ(ρni ).

ss t ②♥♠s ♦ r ♥t t t ♥tr♥ ♦ t r♦♥♦t s ♦r♥ ②

d

dtlni (t) = F in

i − d(F ini , lni ),

sln+1i = lni +

(F ini − d(F in

i , lni ))∆t.

♣♣②♠t s t ♥t♦♥ Ji (1− βi)δ(ρni ) + d(F in

i , lni ) > σ(ρni+1)

❲ t t ① t t rt ♥ s ♦ t ♥t♦♥ s

Fn,+i = σ(ρni+1),

♦♥ t t s t ♦♠s

Fn,−

i+ 12

=

δ(ρni ) 1 ≥ qi > min1, Qi2,

qi1− βi

σ(ρni+1) max0, Qi1 ≤ qi ≤ min1, Qi

2,

σ(ρni+1)− d(F ini , lni )

1− βi 0 ≤ qi < max0, Qi

1,

r

Qi1 =

σ(ρni+1)− d(F ini , lni

)

σ(ρni+1)and Qi

2 =(1− βi)δ(ρ

ni )

σ(ρni+1).

Page 11: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

s ♥ t ♣r♦s s t ②♥♠s ♦ t r ♥t s ♦r♥ ②

d

dtlni =

F ini − (σ(ρni )− (1− βi)δ(ρ

ni )) 1 ≥ qi > min1, Qi

2,

F ini − (1− qi)σ(ρ

ni+1) max0, Qi

1 ≤ qi ≤ min1, Qi2,

F ini − d(F in

i , lni ) 0 ≤ qi < max0, Qi1,

♥trt♥ ②s

ln+1i =

lni +(F ini −

(σ(ρni+1)− (1− βi)δ(ρ

ni )))

∆t 1 ≥ qi > min1, Qi2,

lni +(F ini − (1− qi)σ(ρ

ni+1)

)∆t max0, Qi

1 ≤ qi ≤ min1, Qi2,

lni +(F ini − d(F in

i , lni ))∆t 0 ≤ qi < max0, Qi

1.

♥st♥t♥♦s ♣t♠③t♦♥ ♦ P ♦♥str♥ ②s

t♠

❲ r ♥trst ♥ tr♠♥♥ srt ♥st♥t♥♦s ♦♣t♠ ♣r♦rt② ♣r♠trs qni = qi(tn)

t♦ ♠♥♠③ t♦t tr t♠ ♦♥ t r♦♥♦t ♦♥ ① t♠ ♥tr [0, T ] ①♣rss ② t♦st ♥t♦♥

J(~q) =m∑

i=1

∫ T

0

Ii

ρ(t, x) dxdt+m∑

i=1

∫ T

0

li(t) dt.

♦ ~q : [0,T] → [0, 1]m s t t♠ ♣♥♥t t♦r ♦ ♦♥tr♦ rs ❲ st ♥st♥t♥♦s ♦♣t♠ ♦♥tr♦ ♣♣r♦ t♦ ♠♥♠③ t t♦t tr t♠ ♦♥ t ♥t♦rs ♦ tr♦♥♦t ♥r ♦♥srt♦♥ ♥ t♠ st♣ ∆t t♦ r♣ t ∆t ♥ ♥♦♠♣t t t ♦♥t♦♥ ♥tr♦ t ♥st♥t♥♦s ♦st ♥t♦♥ Jn tt♠ tn ♥ s

Jn(~q) = ∆tm∑

i=1

Liρn+1i +∆t

m∑

i=1

ln+1i

= ∆t

m∑

i=1

[Liρ

ni −∆t

(Fn,−i − Fn,+

i−1

)]

+∆t

m∑

i=1

[lni +∆t

(F ini − γri

)],

r t ♣♥♥s ♦ Fn,±i ♥ γri ♦♥ qi r ①♣rss ② ♥ t ♠♥♠t

s ♥ ② ♥ t s♣♣②♠t stt♦♥ ❲t♥ ts r♠♦r trt ♦t♠♥ ♥ s♣♣②♠t ss t ♥t♦♥s ♥ t ♦♠♣tt♦♥ ♦ t r♥t ♦♥sr ss s ♦♥ t stt♦♥ t t ♦rrs♣♦♥♥ ♥t♦♥ ♦ t r♦♥♦t ♦♣t♠③t♦♥ ♣r♦♠ ts rts

min~q∈[0,1]m

Jn(~q).

♦t tt ♥ ♦r s t ♦st ♥t♦♥ Jn s ♣s ♥r t rs♣t t♦ qi i = 1, . . . , ntrt ♦rr ♦♠♣tt♦♥s

∂qniJn(~q) =

βi

βi − 1σ(ρni+1)∆t2 ≤ 0 if qi ∈ [max0, Qi

1,min1, Qi2]

0 otherwise,

Page 12: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

r Qi1 Q

i2 r ♥ ② Jn s rs♥ ♦♥ t ♥tr [Qi

1, Qi2] ♥ ♦♥sq♥t② t

s ♦ ♦♣t♠ ♣r♦rt② ♣r♠tr tt♥ t Qi2 r♦r ♥② ♦ ♦ qi ≥ min1, Qi

2i = 1, . . . ,m s♦s rst♥ ♥ t s♠ ♦ ②♥♠s r♦ ♦ t ♣r♦rt② ♣r♠trss t♦ ♦r t ♣r♦rt② t♦ ♥tr ♠♣♦s ♥s♥t ♦s ♥♦r s♥ ①ss s t♥ trr②♥ ♣t② ♦ t ♠♥ ♥ ♦ t r♦♥♦t ♦♣t♠ ♣r♠tr s r st♦ ♣t t ♣r♦rt② rs qni st ♦r trt♦♥ n t♦ ♣r♦ ♦ ♦♣t♠s♦t♦♥ tt stss t ♥ trt

♠r sts

♥ ts st♦♥ t t rsts ♦t♥ tr♦ ♥♠r s♠t♦♥s ♦r r♦♥♦t♠♦ s ♦♥t♥t♦♥ ♦ ♦r 2 × 2 ♥t♦♥s t t♦ ♥♦♠♥ ♥ t♦ ♦t♥ r♦s s♣t ♥ r

J1 J3

J2

J4

r ♦♥♦t ♦♥sr ♦r ♥♠r s♠t♦♥s

❲ r♣rs♥t t r♦♥♦t ♥r ♦♥srt♦♥ s

• r♦s ♦r♠♥ t r♦♥♦t I1, I2, I3, I4, I5 t I1 ♥ I5 ♥ t ♣r♦ ♦♥r② ♦♥t♦♥s

• r♦s ♦♥♥t♥ t r♦♥♦t t t rst ♦ t r♦ ♥t♦r ♥♦♠♥ ♥ ♦t♦♥ ♥s

❲ ♥②③ t ♦st ♥t♦♥ ♥tr♦ ♥ t♦♥ ♥ ♣rtr ♥t t♦ ♦♠♣rt t♥ss ♦ ♥st♥t♥♦s ♦♣t♠ ♦s ♦ t ♣r♦rt② ♣r♠trs ♥ ② qi = Qi

2i = 1, . . . ,m t rs♣t t♦ ① ♦♥st♥t ♣r♠trs ♦r ts ♦♠♣t t ♦rrs♣♦♥♥ ♦ t srt③ ♥t♦♥

J(~q) = ∆t

nT∑

n=0

m∑

i=1

Liρn+1i +∆t

nT∑

n=0

m∑

i=1

ln+1i ,

t ~q : [0, T ] → [0, 1]m s ♣s ♦♥st♥t ♦♥ [tn, tn+1[ n = 0, . . . , nT r st t0 = 0♥ tnT+1 = T

Page 13: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

♠t♦♥ rtrsts

♦ ♣rs♥t t ♦ ♦ s♠t♦♥ ♣r♠trs ♥♠r ♣♣r♦①♠t♦♥ ♦ t②♣r♦ ♦♥srt♦♥ s tt sr t ♦t♦♥ ♦ ♥sts ♦r r♦ ♦ t r♦♥♦t s ♠ s♥ t ♣t ♦♥♦ s♠ sr ♥ t♦♥ t♠ st♣ str♠♥ ② t stt② ♦♥t♦♥ t ♦♥t q t♦ Pr♦ ♦♥r②♦♥t♦♥s r ♠♣♦s ♦♥ t t ♥ ♦♥ t rt ♦ t ♦♠♣tt♦♥ ♦♠♥ ssrt③ s♥ ♥ ①♣t r rst ♦rr ♥trt♦♥ ♠t♦ r♦♥♦t tr ♦t♦♥ s s♠t ♦♥ t♠ ♥tr [0, T ] t T = 30 ♦♥ ♥♦ t♦ tt♥ st③stt♦♥

t ♥t t♠ t = 0 ss♠ tt t ♥s ♥ t rs r ♠♣t② ♥ ♠♣♦sFi

in 6= 0 t ♥t♦♥s ♦r t s♠t♦♥s ♦♥sr ρmax = vf = 1 fmax = ρc = 0.66Li = 1 ♥ γmax

ri = 0.65 ♦r i = 1, . . . , 4 ♥② ♦r ♦ t ① ♦♥tr♦ ♣r♠trs

st② 6 × 6 s♠t♦♥ ss s ♦♥ r♥t s ♦ t ① Fiin ♥ βi ♦r ♦

t♠ ♣r♦r♠ t♦ s♠t♦♥s

♥st♥t♥♦s ♦♣t♠ ♣r♦rt② ♣r♠trs ❲ s qi = Qi2 i = 1, . . . , 4 ♥ ♦

rt♠ t♦ ♦♠♣t t ♦rrs♣♦♥♥ ♦

① ♦♣t♠ ♣r♦rt② ♣r♠trs ♥ ts s t ♣r♦rt② ♣r♠trs qi r ♣t① t t s♠ ♦♥st♥t s ♦r ♥t♦♥s ♥ s♠t♦♥ ss ♥ s ♥s ♣♣② ♦rt♠ t♦ ♦♠♣t t stt rs ♦♥ ♥s ♦ t r♦♥♦t♥ t r ♥ts ♥ t ♦rrs♣♦♥♥ t♦t tr t♠ ♦♥ t r♦♥♦t

♠t♦♥ sts

❲ r♥ s♠t♦♥s ♦r t s ♦ Fiin ♥ βi s ♥ ♥ s ♥ ♦♠♣t t

r♥ t♥ t♦t tr t♠ ♦t♥ t r♥t ① qi ♥ t ♦♣t♠ qni t s

TTTD =TTTF− TTTO

TTTF

r st♥s ♦r t ♦ ♦rrs♣♦♥♥ t♦ ① qi r♣rs♥ts t♦t trt♠ t ♦♣t♠ qni ♥ ♦r tr r♥ s r♣♦rt t ♥ ♣r♥t ♥t♦t tr t♠s t♦ ♦♠♣r t t♥ss ♦ ♦r ♣♣r♦

βiFi

in

♠♣r♦♠♥t ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣r t♦① ♦♥st♥t ♣r♠tr qi = 0.2, i = 1, . . . , 4.

Page 14: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

βiFi

in

Pr♥t ♥ ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣rt♦ ① ♦♥st♥t ♣r♠tr qi = 0.3, i = 1, . . . , 4.

βiFi

in

Pr♥t ♥ ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣rt♦ ① ♦♥st♥t ♣r♠tr qi = 0.4, i = 1, 2, . . . , 4.

βiFi

in

Pr♥t ♥ ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣rt♦ ① ♦♥st♥t ♣r♠tr qi = 0.5, i = 1, 2, . . . , 4.

Page 15: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

βiFi

in

Pr♥t ♥ ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣rt♦ ① ♣r♠tr qi = 0.6, i = 1, 2, . . . , 4.

βiFi

in

Pr♥t ♥ ♥ t♦t tr t♠ s♥ ♥st♥t♥♦s ♦♣t♠ ♣r♠trs ♦♠♣rt♦ ① ♦♥st♥t ♣r♠trs qi = 0.7, i = 1, 2, . . . , 4.

s ♥t ♥ s t ♣r♥t ♥ ♥ t♦t tr t♠ s ♥ ♥ t s ♦♠♥♠t ♥ ♦t ♣♣r♦s t s♠ ♦r s t tr ♥♦ ♥rss♦♥ t ♥♦♠♥ s♦♥r② r♦ t t ♥tr♥ ♦ t r♦♥♦t s♥s ♣r♥t ♥s ♦sr ♦r r♥t ① ♦♥st♥t qi ♥ ♦♣t♠ qi s strt ♥ t ♦ tss stt♦♥ ♦rrs♣♦♥s t♦ s♣♣②♠t ss ♦♥ t ♠♥ ♥ ♦ t r♦♥♦t ss♦s tt ♥ r ♣♦♣t♦♥ ♦ s r♠♥s ♦♥ t ♠♥ r♦ ♦ t r♦♥♦t t♥st♥t♥♦s ♦♣t♠ ♦ ♦ ♣r♦rt② ♣r♠tr ♥rss t ♣r♦r♠♥ ♦ t r♦♥♦t♦♠♣r t♦ r♥t ① s ♦ qi

♦r t ① ♣r♦rt② ♣r♠trs rtr t♥ Qi2 t ♥t♦♥ ♦t ♣♣r♦s t t

s♠ s s s t♦ t t strt ② r ♥ t♦♥ t s t ♥t♦♥s♦t♦♥ s ♣♣r♦①♠t ② t ♣♦♥t ♦♥ t s st rtr♠♦r s t s ♦ t ①♣r♠trs qi rss t ♥st♥t♥♦s ♦ ♦ ♦♣t♠ ♣r♠tr s♦s ttr ♣r♦r♠♥♥ ♥rs♥ tr tr♦♣t ♦♠♣r t♦ s♠ ① ♣r♦rt② ♣r♠trs rr ① sr ttr ♥ ♦♣t♠③♥ tr ① ♦♥ t ♥t♦r ♣♦rt♦♥

Page 16: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

r ♦♠♣rs♦♥ t♥ t t♦t tr t♠s ♦t♥ t ♦♣t♠ ♦ ♦ qi ♥ ①qi = 0.4 ♦r r♥t s ♦ ♥♦♠♥ ① ♥ s♣tt♥ rt♦

♥ r ♣♦t t s ♦ t♦t tr t♠ ♦t♥ ② ♦t ♣♣r♦s s ♥t♦♥♦ t ♥♦♠♥ ① Fi

in ♦r r♥t s ♦ s♣tt♥ rt♦ βi ♦r t ♦ r♦♥♦t ♥ ♥ts r♥t s♠t♦♥ ss

r ♥st② t T = 30 t r ♥ts ♠ ♥ ♦♣t♠ ♣r♦rt② ♣r♠tr rt♦t♦♥ ♦♥ t t♠ ♥tr [0, 30]

r strts s♠♣ ♥st② r ♥t ♥ ♦♣t♠ ♣r♦rt② ♣r♦s ♦r r♥t♥♦s r♦♠ t s♦♥r② ♥♦♠♥ r♦ ♦ r♦♥♦t t ♥t♦♥s r♥ t s♠t♦♥t♠ ♥tr [0, 30]

♦♥s♦♥

♥ ts ♣♣r ♣rs♥t ♥ ♥st♥t♥♦s tr ♦ ♦♣t♠③t♦♥ ♣♣r♦ ♦♥ r♦♥♦ts♥ sr ♦♥srt♦♥ s ❲ rst srt③ t ②♣r♦ P t ♦♥♦ s♠♥ t s♥ ♥ ①♣t r rst ♦rr ♥trt♦♥ ♠t♦ ❲ ♦♠♣t t r♥t♦ t ♦st ♥t♦♥ tt ♠srs t ♥st♥t♥♦s t♦t tr t♠ t t♠ st♣ tn

♥ ♥ t ♦♣t♠ ♣r♦rt② ♣r♠trs ♠r tsts r ♦♥t ♦r r♦♥♦t

Page 17: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

t ♦r ♥♦♠♥ ♥ ♦r ♦t♦♥ r♦s s♠t♦♥ rsts s♦ tt r♥t s♥st♥t♥♦s ♦♣t♠ ♦ ♦ t ♣r♦rt② ♣r♠trs ♣r♦s ♥ rsts ♥ ♠♣r♦♥t ♣r♦r♠♥ ♦ t r♦♥♦t ♦♠♣r t♦ t ① ♦ ♦ ♣r♦rt② ♣r♠trs ♥ ts ♦ ① ♣r♦rt② ♣r♠trs rr ① s r ttr ♥ ♦♣t♠③♥ tr ① ♦♥ t♠♥ ♥ ♦ t r♦♥♦t rt t♦ s♠r s

♥♦♠♥ts

s rsr s ♣rt② s♣♣♦rt ② t r♦♣♥ sr ♦♥ ♥r t r♦♣♥❯♥♦♥s ♥t r♠♦r Pr♦r♠ P r♥t r♠♥t ♥ ♥② ♥tr♥t♦♥ ♥ Pr♦r♠ ♥ P ♥ r♠♥ ♠ ①♥ r rst t♦r t♥s ♥r ♦♣ ♥t♣♦s étrr♥é ♦r ts ♦s♣tt②

Page 18: Gradient-based Instantaneous Traffic Flow Optimization on a ... · Legesse Lemecha Obsu, Paola Goatin, Semu Mitiku Kassa To cite this version: Legesse Lemecha Obsu, Paola Goatin,

r♥s

❬❪ ♥ rt② ♥ r s ♦ ♥ ♣♣♥ ♥t♦rs t tr♦ tr♦♥

❬❪ rss♥ ②♣r♦ s②st♠s ♦ ♦♥srt♦♥ s ♦♥ ♠♥t♦♥ ② Pr♦♠

①♦r tr rs ♥ t♠ts ♥ ts ♣♣t♦♥

❬❪ s♦♥ ♣ P♦ ♥ rtá ♣t♠③t♦♥ ♦ tr ♦♥ r♦ ♥t♦rst♠t ♦s ♥ t♦s ♥ ♣♣ ♥s

❬❪ t♦r ❨♥ ♥ ♥tt♦ P♦ r rs ♥ t♠♥ ♦ tr ts ♦r rs

♦ srt ♥ ♦♥t♥♦s ②♥♠ ②st♠s rs

❬❪ ♦t r♦ ♥ P♦ r ♦ ♦♥ r♦ ♥t♦r t♥

❬❪ ♦♦♠♦ P ♦t♥ ♥ P♦ ♦ ♥t♦r t ♣s tr♥st♦♥ ♦r♥ ♦②♣r♦ r♥t qt♦♥s

❬❪ ♣ ♥③♦ ♥ P♦ Pt ♦ ♦♥ t♦♠♠♥t♦♥ ♥t♦rs t ♥

❬❪ ♦♥ ② ♠r♥② ❲ r♥ P ♦t♥ ♥

②♥ P ♠♦ ♦r ♥t♦♥ t r♠♣ r ♣♣ t t♦ ♣♣r

❬❪ ♥ ❨ ❨ P ♦ ♥ s♥ tr♦♥♦s r ♦ ♦ ♦r ♦ ♥

♦♥♦ts ♥ ♦♥tr♦ ♥trst♦♥ ♥tr♥t♦♥ ♦r♥ ♦ ♦r♥ P②ss

❬❪ r♦ ♥ P♦ r ♦ ♦♥ t♦rs ♦♥srt♦♥ s ♦ ♠r♥♥sttt ♦ t♠t ♥s

❬❪ r♦ r♦ ♥ P♦ ♦t♥ ② ♣r♦♠ t ♥♦ t r srt♦♥t♥ ②♥ ②st

❬❪ ♦♠s ♥ ♦r♦t③ ♣t♠ r② r♠♣ ♠tr♥ s♥ t s②♠♠tr tr♥s

♠ss♦♥ ♠♦ r♥s♣♦rtt♦♥ sr Prt ♠r♥ ♥♦♦s

❬❪ ött rt② ♥ r ♦♥ ♥ ♦♣t♠③t♦♥ ♦ s♣♣② ♥s ♦♥ ♦♠♣①

♥t♦rs ♦♠♠♥ t

❬❪ t rt♥ rt② ① r ♥ ü♥tr r♥ ♣t♠ ♦♥tr♦ ♦r

tr ♦ ♥t♦rs ♦r♥ ♦ ♦♣t♠③t♦♥ t♦r② ♥ ♣♣t♦♥s

❬❪ rt② r♥r ♥ r ♥st♥t♥♦s ♦♥tr♦ ♦r tr ♦ t t ♣♣

❬❪ rt② ♥ r ♦♥ s♠t♦♥ ♥ ♦♣t♠③t♦♥ ♦ tr ♦ ♥t♦rs ♦r♥ ♦♥ ♥t ♦♠♣t♥

❬❪ r♦ rst ♦rr qs♥r qt♦♥s t sr ♥♣♥♥t rs t

❬❪ q ♠r ♠t♦s ♦r ♦♥srt♦♥ s trs ♥ t♠ts ❩ür

räsr ❱r♥

❬❪ t ♥ ❲t♠ ♥ ♥♠t ❲s ♦r② ♦ r ♦ ♦♥

♦♥ r♦ ♦s Pr♦♥s ♦ t ♦② ♦t② ♦ ♦♥♦♥ rs t♠t ♥P②s ♥s

❬❪ ② ❲ r♥ ♦♥ ♠r♥② P ♦t♥ ♥

②♥ ♦♥ts ♦♣t♠③t♦♥ ♦♥ ♥t♦r ♦ srt③ sr ♦♥srt♦♥ Ps t

♣♣t♦♥ t♦ ♦♦r♥t r♠♣ ♠tr♥ Pr♣r♥t t♦r

❬❪ rs P ♦ s ♦♥ t ② ♣rt♦♥s rsr