this study is devoted to the formulation of the network design problem of one-way streets and the application of simulated annealing (sa) algorithm to solve this problem for a large real network. it discusses some points of views on one-way street networks, the objective function used for design, the way in which design constraints may be considered, and the traffic problems concerning one-way ...

Growing concerns regarding urban congestion, and the recent explosion of mobile devices able to provide real-time information to traffic users have motivated increasing reliance on real-time route guidance for the online management of traffic networks. However, while the theory of traffic equilibria is very well-known, fewer results exist on the stability of such equilibria, especially in the c...

The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m parallel links, each having a finite capacity, and there are n selfish (noncooperative) agents wishing to route their traffic through one of these links: thus the problem sets naturally in the context of noncooperative gam...

The stability of a user equilibrium determines whether it could be realized or sustained in a transportation network, when subject to perturbations in traffic conditions and drivers’ route choice behaviors. In this paper, with a simple deterministic dynamical system model of the traffic assignment problem, we first develop a systematic approach to analyzing asymptotic stability and instability ...

We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that computes a pure Nash equilibrium with respect to traffic congestion in a network. In this algorithm each user plays only once and allocates her traffic to a path selected via a shortest path computation. We then show that th...

Traffic network equilibrium problems with capacity constraints of arcs are studied. A weak vector equilibrium principle with vector-valued cost functions, which are different from the ones in the work of Lin 2010 , and three kinds of parametric equilibrium flows are introduced. Some necessary and sufficient conditions for a weak vector equilibrium flow to be a parametric equilibrium flow are de...

Among different stochastic user equilibrium (SUE) traffic assignment models, the Logit-based stochastic user equilibrium (SUE) is extensively investigated by researchers. It is constantly formulated as the low-level problem to describe the drivers' route choice behavior in bi-level problems such as network design, toll optimization et al. The Probit-based SUE model receives far less attention c...

This paper discusses a problem in which  decentralized supply chains enter the market simultaneously with no existing rival chains, shape the supply chains’ networks, and set wholesale and retail prices in a noncooperative manner. All the chains produce either identical or highly substitutable products. Customer demand is elastic and price-dependent. A three-step algorithm is proposed to solve ...