Agent-based Mesoscopic Urban Traffic Simulation based on Multi-lane Cell Transmission Model

Agent-based Mesoscopic Urban Traffic Simulation based on Multi-lane Cell Transmission Model

                   'EB687...
Download PDF
860KB Sizes 0 Downloads 28 Views
Report

               

 



'EB687<4B@CHG8E*6<8A68   Q  Available online at www.sciencedirect.com 'EB687<4B@CHG8E*6<8A68   Q 



ScienceDirect  

 JJJ 8?F8I<8E 6B@ ?B64G8 CEB687<4 JJJ 8?F8I<8E 6B@ ?B64G8 CEB687<4

Procedia Computer Science 151 (2019) 240–247

+;8 G; AG8EA4GF4A7+86;AB?B:<8F%+ +;8 G; AG8EA4GF4A7+86;AB?B:<8F%+ CE
:8AG54F87$8FBF6BC<6,E54A+E499<6*<@H?4G'4E>4J4FBB08B45 088HA"<@45*8BA:='4E>4J4FBB08B45

%35)%(9%2')(267-787)3*

'-)2')%2(!)',2303+; !  %),%/53$86)32++8%).)32)48&0-'3*35)%

&):$35/"2-9)56-7;&8,%&- %%(-;%760%2(&8,%&-"2-7)(5%&1-5%7)6 %35)%(9%2')(267-787)3* '-)2')%2(!)',2303+; !  %),%/53$86)32++8%).)32)48&0-'3*35)% &):$35/"2-9)56-7;&8,%&-

%%(-;%760%2(&8,%&-"2-7)(5%&1-5%7)6

  .8F68AG8EFG4:8J8F68AG8EFG4:8J J J  +;  +;
6E84G
6E84G
 

  BEE8FCBA74E

1%-0%((5)66;J4FBB>4E   O +;8HG;BEF 'H5?
6E84G
6E84G
1877-0509 © 2019 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/) Peer-review under responsibility of the Conference Program Chairs. 10.1016/j.procs.2019.04.035





Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 -1)7%053')(-%31487)5 '-)2')  <

241

  FG;8AH@58EB9I8;<6?8FG;4G;4F?4E:8FC4684A74GE8@8A7BHFAH@58EB9I8;<6?8FG;8@<6EBF6BC<6GE499<6F<@H?4GJ888CFB94??G;8I8;<6?8FF     $8FBF6BC<6@B78? +;8?4A8F64A586BA9<:HE87
Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 87,352%1)53')(-%31487)5 '-)2')  <

242 



+;8F86BA7C4E47<:@B9G;8@8FBF6BC<6@B78?:EBHCFI8;<6?8F8GF &%+)$8G4E8@B78?87GB@BI88DH4??L?4A86;4A:4A7G;8I8;<6?8FC887B9G;8CEBCBF87@B78?4A778G4 4A7 GE499<6 78@4A7 J;<6; 6BAFFBHE68F4A76BAA86G?8A:G;  *BHE684A7G;8F4E8I FBHE68G;4G64A 58G;BH:;GB94F4I F 



link 4

link 8



cc 8



cc 4

<:  %8GJBE>E8?4G87G8E@
cc 6

link 6 link 1

cc 1

cc 7 link 2

cc 2

link 7 link 3

cc 3

cc 9 link 5 link 9 cc 5

<:  K4@C?8B94E84?EB47GBCB?B:L4A7G;85A8GJBE>GBCB?B:L




Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 -1)7%053')(-%31487)5 '-)2')  <

243

6BAA86GGBA8KG?F4A7F;4I8G;8F4A76BAA86GF? 4A7? 4A7G;8 F *B@8@B78?FC8E9BE@E8EBHG
Setup Road Network (Link, Connection cell)

Setup Demand¬ (Individual vehicle route) No

simulation time step < max loop Yes

Simulation Run

simulation time step % update interval == 0

No

Move vehicles from the sources to origin links

Yes

Reset sink

Select vehicles to MLC

Update source with vehicles

Select vehicles to OLC

simulation time step == 0

Move selected vehicles to MLC and OLC



Print output

Select vehicles to CF simulation time step > max loop

No

cc 6 link 1

link 8

Calculate number of vehicles to CF in cell unit considering trafc signal



link 4

Yes

cc 8



cc 4

<:  %8GJBE>E8?4G87G8E@
6 Movelink selected vehicles ¬tolink CF2 cc 1 cc 2

cc 7

link 7 link 3

cc 3

cc 9

Yes

link 5

simulation time step =+ 1

link 9 cc 5

End

<:  ?BJ6;4EGB9$+$ <:  K4@C?8B94E84?EB47GBCB?B:L4A7G;85A8GJBE>GBCB?B:L




Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 87,352%1)53')(-%31487)5 '-)2')  <

244 



<: F;BJFG;89?BJ6;4EGB9$+$ G8I8ELHC74G84A7FG4EGGE
Li ≥ Limin = v ifree ⋅ dt 



















 

J;8E8 4A7 E8CE8F8AG68???8A:G;4A7@  4A7  78ABG8FG;8F<@H?4GF86G  78ABG8FG;8@4K<@H@AH@58EB9I8;<6?8FG;4G64A8K +$4FFH@8FG;4GG;868???8A:G; *BG;8D 
ni,s,l (t + dt) = ni,s,l (t) + yi,s−1,l (t) − yi,s,l (t) 

yi,s,l (t) = min[ni,s,l (t),Qi (t),

wi

vi, free





⋅(N i,s+1,l (t) − ni,s+1,l (t))]⋅

Li,min Li









 











9G8EG;8?BA:GBA8KG -8;<6?8@BI8@8AG58GJ88A?F4?FB9B??BJFG;8F4@89BE@H?4  AG;


Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 -1)7%0 53')(-%31487)5 '-)2')  <

hi,s,l l = max[0,

vi,s,l − vi,s,l

12

2

vi, free

1

⋅ ni,s,l ]  1











245







J;8E8  @84AFG;8FC887B968??    *G;4GGBB@4ALI8;<6?8F@BI8J;8AGJBGLC8FB9?4A8 6;4A:
12

12

















  J;8E8 4A7 E8CE8F8AGG;889986G87 9BE $#  
 !   -180%7-326)784 $+$J 6BAFF6BAA86G87GBG;8F<:A4? 6BAF G;8I8;<6?8FG4EGF7EF466BE7@ ; 66BE7@4A7G;868???8A:G;I4?H8 +;8J4I8 FC8874A7G;8@4K<@H@9?BJ4E8F8G4G >@ ;4A7  I8; ;E ?4A8  AG;F  4A7E8FC86G 4A7G;8F<:A4?FJ;<6;4E8ABGF;BJA
       

 

 

 

       

       

       

 

<:  +8FGA8GJBE>J


Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 87,352%1)53')(-%31487)5 '-)2')  <

 









 













   



 



 

   

246 

  

   





 

 

 



 





 









 

 









   







   

 

 

<:  *C468G<@86BAGBHEC?BGB9EB4778AF 5? 6?4A77?

  -180%7-325)68076 F4E8FH?GB9G;8F<@H?4G E846;G;87BJAFGE84@4A76;4A:8?4A8FF +;8L4E8F;BJA45BI8G;8:E88A?F Q87?4A8F BJ8I8EG;8&#6BA7H6G875LG;8FC8877<998E8A6858GJ88A?4A8F64HF8FFB@8I8;<6?8FGB @BI887?4A8F4FF #4A86;4A:


Yeeun Kim et al. / Procedia Computer Science 151 (2019) 240–247 -1)7%053')(-%31487)5 '-)2')  <

247

BHG5LG;8FC8877<998E8A68B9G;8?4A8F .88KC8E<@8AG$+$F 49G8E:E88A?<:;GJ4FFHCCBEG875L AFG
 2 3 2 3

% RF<@C?<9<8764E9B??BJ
23

$ +E8<58E 8AA86>84A7 8?5454E7BA<4F! B?L4E4A7- ?8K<47
  6727)52%7-32%032*)5)2')3227)00-+)27!5%264357%7-32 ;67)16!  CC   Q   

23 23 23 23 23 23 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3

 +4?85CBHE4A7 * $4;@4FF4A<R A9?H8A68B96BAA86G874A74HGBAB@BHFI8;<6?8FBAGE499<69?BJFG45<998E8AG<4?*C887#<@FS!5%**-'2+327530 IB?  AB    * "<@* +4>4A7 08BR:8AG54F87A8GJBE>GE4AF@$ 4?@8E4A7! )N@8A4CCR:8AG&E<8AG87BHC?EFS!5%264)6%571)5+!)',230IB?  AB CC  Q     4JEBAR*<@H?4GFS-8E?4:A<6;G8E@
" %4:8?4A7$ *6;E86>8A58E:R68??H?4E4HGB@4GBA@B78?9BE9E88J4LGE499<6S,;6IB?  AB  CC 

Q

86