Computer Science ›› 2020, Vol. 47 ›› Issue (1): 265-269.doi: 10.11896/jsjkx.181202418

• Computer Network • Previous Articles     Next Articles

Study of TASEP Model Based on Road Networks

RUAN Zi-rui,RUAN Zhong-yuan,SHEN Guo-jiang   

  1. (College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China)
  • Received:2018-12-26 Published:2020-01-19
  • About author:RUAN Zi-rui,postgraduate,not member of China Computer Federation (CCF).His main research interests include intelligent transport and complex networks;RUAN Zhong-yuan,lecture,postgraduate supervisor,is not member of China Computer Federation (CCF).His current research interests include complex systems and complex networks.
  • Supported by:
    This work was supported by the Young Scientists Fund of the National Natural Science Foundation of China (11605154).

Abstract: TASEP is a classic model for describing the particle transportation on one-dimension lattices,which considers the vo-lume exclusion effect of real matters.It has been widely applied in the area of biology and public transportation.In this paper,based on the real properties of the traffic network,a modified TASEP model was proposed.The TASEP model is improved as follows,considering the heterogeneity of the hopping rate of particles on each edge,i.e.setting different hopping rates on each edge and conforming to Poisson distribution,and considering that the particles at the intersection are non-random in choosing the next section.Specifically,a real-time path strategy was proposed.Combining the traffic flow and the number of particles on a road,an average moving velocity is obtained for each link.Then a parameter α is introduced to make the movements of the particles at the intersections more rational.The larger the value of α,the more likely the particles are to move to the edge of the larger average velocity.Experimental results show that with the increase of α,the flow of the system will be greatly improved,which alleviates the congestions to a certain extent.By extending the traditional TASEP model,this paper provides a new insight and direction for the study of urban traffic system.

Key words: Totally asymmetric simple exclusion process, Complex network, Path strategy, Traffic flow, Road network structure

CLC Number: 

  • TP393
[1]TANNAI T,NISHINARI K.Theoretical approach to congestion relaxation and saturated congestion in TASEP (totally asymmetric simple exclusion process) network with multi-chain section with flow/density-dependent rules of junctions[J].Physics Letters A,2017,381(43):3688-3695.
[2]MACDONALD C T,GIBBS J H,PIPKIN A C.Kinetics of biopolymerization on nucleic acid templates[J].Biopolymers,1986,6(1):1-25.
[3]LIU M,WANG R,JIANG R,et al.Defect-induced transitions in synchronous asymmetric exclusion processes[J].Physics Letters A,2009,373(2):195-200.
[4]XIAO S,CHEN X,LIANG R,et al.Shortcut with pool under parallel update rule on one-dimensional lattice totally asymme-tric simple exclusion process[J].Physics Letters A,2017,381(47):3940-3944.
[5]CHEN X,ZHANG Y,LIU Y,et al.Theoretical investigation of the synchronous totally asymmetric simple exclusion process with a roundabout[J].Indian Journal of Physics,2016,91(2):1-6.
[6]XIAO S,CAI J J,LIU F.Zone inhomogeneity with the random asymmetric simple exclusion process in a one-lane system[J].Chinese Physics B,2009,18(11):4613-4621.
[7]JIANG R,WANG R,HU M B.Spontaneous symmetry breaking in a two-lane system with parallel update[J].Journal of Physics a Mathematical & Theoretical,2007,40(31):9231-9225.
[8]WANG Y Q,JIA B,JIANG R,et al.Dynamics in multi-lane TASEPs coupled with asymmetric lane-changing rates[J].Nonlinear Dynamics,2017,88(3):2051-2061.
[9]WANG Y Q,JIANG R,KOLOMEISKYK A B,et al.Bulk induced phase transition in driven diffusive systems[J].Scientific Reports,2014(4):5459.
[10]ARITA C,FOULAADVAND M E,SANTEN L.Signal optimization in urban transport:A totally asymmetric simple exclusion process with traffic lights[J].Physical Review E,2017,95(3):032108.
[11]BAEK Y,HA M,JEONG H.Effects of junctional correlations in the totally asymmetric simple exclusion process on random regular networks[J].Physical Review E Statistical Nonlinear & Soft Matter Physics,2014,90(6):062111.
[12]NERI I,KERN N,PARMEGGIANI A.Totally asymmetric simple exclusion process on networks[J].Physical Review Letters,2011,107(6):068702.
[13]BARRAT,ALAIN.Dynamical processes on complex networks[M].Cambridge:Cambridge University Press,2008.
[14]GEORGES A,KOTLIAR G,KRAUTH W,et al.Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensions[J].Reviews of Modern Physics,1996,68(1):13-125.
[15]RAJEWSKY N,SANTEN L,SCHADSCHNEIDER A,et al. The Asymmetric Exclusion Process:Comparison of Update Procedures[J].Journal of Statistical Physics,1998,92(1/2):151-194.
[16]BOLLOBAS B,FULTON W,KATOK A,et al.Cambridge stu- dies in advanced mathematics[M]. New York:Cambridge University Press,2001:73.
[17]EMBLEY B,PARMEGGIANI A,KERN N.HEX-TASEP:dynamics of pinned domains for TASEP transport on a periodic lattice of hexagonal topology[J].Journal of Physics:Condensed Matter,2008,20(29):295213.
[1] YANG Chao, LIU Zhi. Study on Complex Network Cascading Failure Based on Totally Asymmetric Simple Exclusion Process Model [J]. Computer Science, 2020, 47(9): 265-269.
[2] ZHANG Meng-yue, HU Jun, YAN Guan, LI Hui-jia. Analysis of China’s Patent Application Concern Based on Visibility Graph Network [J]. Computer Science, 2020, 47(8): 189-194.
[3] ZHANG Qing-qi, LIU Man-dan. Multi-objective Five-elements Cycle Optimization Algorithm for Complex Network Community Discovery [J]. Computer Science, 2020, 47(8): 284-290.
[4] WANG Hui, LE Zi-chun, GONG Xuan, WU Yu-kun, ZUO Hao. Review of Link Prediction Methods Based on Feature Classification [J]. Computer Science, 2020, 47(8): 302-312.
[5] DONG Ming-gang, GONG Jia-ming and JING Chao. Multi-obJective Evolutionary Algorithm Based on Community Detection Spectral Clustering [J]. Computer Science, 2020, 47(6A): 461-466.
[6] XIONG Ting, QI Yong, ZHANG Wei-bin. Short-term Traffic Flow Prediction Based on DCGRU-RF Model for Road Network [J]. Computer Science, 2020, 47(5): 84-89.
[7] YUAN Rong, SONG Yu-rong, MENG Fan-rong. Link Prediction Method Based on Weighted Network Topology Weight [J]. Computer Science, 2020, 47(5): 265-270.
[8] MA Yang, CHENG Guang-quan, LIANG Xing-xing, LI Yan, YANG Yu-ling, LIU Zhong. Improved SDNE in Weighted Directed Network [J]. Computer Science, 2020, 47(4): 233-237.
[9] ZHANG Hu, ZHOU Jing-jing, GAO Hai-hui, WANG Xin. Network Representation Learning Method on Fusing Node Structure and Content [J]. Computer Science, 2020, 47(12): 119-124.
[10] ZHANG De-gan, YANG Peng, ZHANG Jie, GAO Jin-xin, ZHANG Ting. New Method of Traffic Flow Forecasting of Connected Vehicles Based on Quantum Particle Swarm Optimization Strategy [J]. Computer Science, 2020, 47(11A): 327-333.
[11] ZHAO Lei, ZHOU Jin-he. ICN Energy Efficiency Optimization Strategy Based on Content Field of Complex Networks [J]. Computer Science, 2019, 46(9): 137-142.
[12] KONG Fan-yu, ZHOU Yu-feng, CHEN Gang. Traffic Flow Prediction Method Based on Spatio-Temporal Feature Mining [J]. Computer Science, 2019, 46(7): 322-326.
[13] CHEN Hang-yu, LI Hui-jia. Analysis of Characteristics and Applications of Chinese Aviation Complex Network Structure [J]. Computer Science, 2019, 46(6A): 300-304.
[14] LIU Xiao-dong, WEI Hai-ping, CAO Yu. Modeling and Stability Analysis for SIRS Model with Network Topology Changes [J]. Computer Science, 2019, 46(6A): 375-379.
[15] ZHANG Sen, LIU Wen-qi, ZHAO Ning. Research of Consensus in Multi-agent Systems on Complex Network [J]. Computer Science, 2019, 46(4): 95-99.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .