Piecewise linear concave dynamical systems appearing in the microscopic traffic modeling

نویسندگان

  • Nadir Farhi
  • Maurice Goursat
  • Jean-Pierre Quadrat
چکیده

Motivated by microscopic traffic modeling, we analyze dynamical systems which have a piecewise linear concave dynamics not necessarily monotonic. We introduce a deterministic Petri net extension where edges may have negative weights. The dynamics of these Petri nets are uniquely defined and may be described by a generalized matrix with a submatrix in the standard algebra with possibly negative entries, and another submatrix in the minplus algebra. When the dynamics is additively homogeneous, a generalized additive eigenvalue is introduced, and the ergodic theory is used to define a growth rate. In the traffic example of two roads with one junction, we compute explicitly the eigenvalue and we show, by numerical simulations, that these two quantities (the additive eigenvalue and the average growth rate) are not equal, but are close to each other. With this result, we are able to extend the well-studied notion of fundamental traffic diagram (the average flow as a function of the car density on a road) to the case of roads with a junction and give a very simple analytic approximation of this diagram where four phases appear with clear traffic interpretations. Simulations show that the fundamental diagram shape obtained is also valid for systems with many junctions. AMS subject: 90B06, 93C65, 37F10, 68Q80, 82B26.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Front Tracking Algorithm for the Lighthill-whitham- Richards Traffic Flow Model with a Piecewise Quadratic, Continuous, Non-smooth, and Non-concave Fundamental Diagram

We use a front tracking algorithm to explicitly construct entropy solutions for the LighthillWhitham-Richards traffic flow model with a flow-density relationship that is piecewise quadratic, continuous, non-smooth, and non-concave. The solution is exact if the initial condition is piecewise linear and the boundary conditions are piecewise constant. The algorithm serves as a fast and accurate so...

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Piecewise linear models of chemical reaction networks

We show that certain non-linear dynamical systems with non-linearities in the form of Hill functions, can be approximated by piecewise linear dynamical systems. The resulting piecewise systems have closed form solutions that can be used to understand the behavior of the fully nonlinear system. We justify the reduction using geometric singular perturbation theory, and illustrate the results in n...

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Developing a Model of Heterogeneity in Driver’s Behavior

Intelligent Driver Model (IDM) is a well-known microscopic model of traffic flow within the traffic engineering societies. While it is a powerful technique for modeling traffic flows, the Intelligent Driver Model lacks the potential of accommodating the notion of drivers’ heterogeneous behavior whenever they are on roads. Concerning the above mentioned, this paper takes the lane to recognize th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013