We study the problem of selfishly routing splittable traffic with respect to maximum congestion through a shared network. Our model naturally combines features of the two best studied models in the context of selfish routing: The KP-model [11] and the Wardrop-model [20]. We are given a network with source nodes si, sink nodes ti, 1 ≤ i ≤ k, m edges, and a latency function for each edge. Traffic...

We consider a network game where the nodes of the network wish to form a graph to route traffic between themselves. We present a model where costs are incurred for routing traffic, as well as for a lack of network connectivity. We focus on directed links and the link stability equilibrium concept, and characterize connected link stable equilibria. The structure of connected link stable networks...

Fast growing population, excessive expansion of cities, and dominance of automobile in urban life have troubled cities with complicated traffic problems. In many parts of the world, transport network development has always been considered as a solution for this problem. Apparently, one-dimensional ‘traffic solutions’ would never thoroughly bring best results as the city and its problems are com...

The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model ...

In this paper we present a version of the (static) traac equilibrium problem in which the cost incurred on each path is not simply the sum of the costs on the arcs that constitute that path. We motivate this nonadditive version of the problem by describing several situations in which the classic additivity assumption fails. We describe existence and uniqueness conditions for this problem and we...

This paper proposed an optimization problem that determines the deployment pattern of dedicated lanes to connected autonomous vehicles (CAVs) considering stochastic traffic demand and capacity. The difference between CAVs regular human-piloted (RHVs) is driving behavior. behavior expected be more standardized than RHVs. Therefore, we assume when penetration ratio increases in lane flow, mean ca...

In the present paper, we introduce and study a fuzzy vector equilibrium problem and prove some existence results with and without convexity assumptions by using some particular forms of results of textit{Kim} and textit{Lee} [W.K. Kim and K.H. Lee, Generalized fuzzy games and fuzzy equilibria, Fuzzy Sets and Systems, 122 (2001), 293-301] and textit{Tarafdar} [E. Tarafdar, Fixed point theorems i...

In this lecture we consider the problem of routing traffic to optimize the performance of a congested and unregulated network. We are given a network, a rate of traffic between each pair of nodes and a latency function specifying the time needed to traverse each edge given its congestion. The goal is to route traffic while minimizing the total latency. In many situations, network traffic cannot...