Congested communication network and an electronic simulation method for the location problem

The authors consider a congested communication network in which the cost for travelling an arc is dependent on the number of user on it. Assume each user of the network is aware of the cost along each arc available to him, and he thereby takes his cheapest route between his origin and destination. As shown in Beckman and Winsten (1956), the user optimal flow is given by the optimal solution to the convex programming problem. So they choose a place where the destination is so located that the system cost is minimized. Much attention has been focused on the variational inequality formulation of the generalized communication assignment problem involving user-optimized behavior. But computing the user optimal flow is difficult and solving the location problem on a congested communication network is very difficult. So an electronic simulation method for this model is presented