Effect of self-deflection on a totally asymmetric simple exclusion process with functions of site assignments

Two-lane totally asymmetric simple exclusion process with extended Langmuir kinetics

Multilane totally asymmetric simple exclusion processes with interactions between the lanes have recently been investigated actively. This paper proposes a two-lane model with extended Langmuir kinetics on a periodic lattice. Both bidirectional and unidirectional flows are investigated. In our model, the hopping, attachment, and detachment rates vary depending on the state of the corresponding site in the other lane. We obtain a theoretical expression for the global density of the system in the steady state from three kinds of mean-field analyses [(1×1)-, (2×1)-, and (2×2)-cluster cases]. We verify that the (2×2)-cluster mean-field analysis reproduces the differences between the two directional flows and approximates well the results of computer simulations for some cases. We observe that (2×1)-cluster mean-field analyses are already good approximations of the simulation results for unidirectional flows; on the other hand, the accuracy of the approximations much improves by (2×2)-cluster one for bidirectional flows. We explain the phenomena in a qualitative manner by a simple analysis of correlations. We expect these findings to give informative suggestions for actual traffic systems.

Dependence of the transportation time on the sequence in which particles with different hopping probabilities enter a lattice

Smooth transportation has drawn the attention of many researchers and practitioners in several fields. In the present study, we propose a modified model of a totally asymmetric simple exclusion process (TASEP), which includes multispecies of particles and takes into account the sequence in which the particles enter a lattice. We investigate the dependence of the transportation time on this "entering sequence" and show that, for a given collection of particles, group sequence in some cases minimizes the transportation time better than a random sequence. We also introduce the "sorting cost" necessary to transform a random sequence into a group sequence and show that when this is included a random sequence can become advantageous in some conditions. We obtain these results not only from numerical simulations but also by theoretical analyses that generalize the simulation results for some special cases.