In this paper, we propose a max-flow-min-cost (MFMC) problem to obtain the upper bound of network capacity and develop an efficient packet routing strategy. The MFMC problem is formulated as two linear programs (LP). The optimal solutions of the two LPs are the upper bound of network capacity...

Empirical mode decomposition (EMD) method can decompose any complicated data into finite ‘intrinsic mode functions’ (IMFs). In this paper, we use EMD method to analyze and discuss the structural properties of complex networks. A random-walk method is used to collect the data series of...

Many algorithms have been presented to solve the traffic assignment problem. Recently, Bar-Gera introduced the concept of “last common node” into an origin-based algorithm to solve the traffic assignment problem. However, how to find the last common nodes has not been investigated in detail....

We present a simple control method to suppress the traffic congestion in the coupled map car-following model under open boundary, based on the pioneer work of Konishi et al. [Coupled map car-following model and its delayed-feedback control, Phys. Rev. E 60 (1999) 4000–4007]. Theoretically, it...

In this paper, we use a two-lane CA traffic model to simulate the multi-way traffic flow. A kind of control signal that can be considered as a perturbation is designated at a given site (i.e., signal point) of the right lane. Under the effect of control signal, the velocity of vehicle passing...

The stability analysis is one of the important problems in the traffic flow theory, since the congestion phenomena can be regarded as the instability and the phase transition of a dynamical system. Theoretically, we analyze the stable conditions of the full velocity and acceleration difference...