We study the equilibrium quality under user uncertainty in a multi-commodity selfish routing game with many types of users, where each user type experiences a different level of uncertainty. We consider a new model of uncertainty where each user over or under-estimates their congestion costs by a multiplicative constant. We present a variety of theoretical results showing that when users under-...

In this paper we propose a composite Variational Inequality formulation for modeling multimode, multi-class stochastic dynamic user equilibrium problem in recurrent congestion networks with queues. The modes typically refer to different vehicle types such as passenger cars, trucks, and buses sharing the same road space. Each vehicle type has its own characteristics, such as free flow speed, veh...

Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application of Load Shared Sequential Routing (LSSR) in MPLS networks where the load sharing factors are updated using reinforcement learning techniques. We present algorithms based on learning automata techniques for optimizing...

By 1953 Martin Beckmann had formulated and analyzed the static, deterministic userequilibrium (UE) route choice model with variable origin-destination flows (demand) (Beckmann et al, 1956; Boyce, 2004). Twenty years later, Suzanne Evans (1973, 1976) proposed and analyzed an algorithm for solving a version of Beckmann’s model that corresponded to practitioner models with origin-destination (OD) ...

We study a simple network with two parallel batch service queues, where service at a queue commences when the batch is full and each queue is served by infinitely many servers. A stream of general arrivals observe the current state of the system on arrival and choose which queue to join to minimize their own expected transit time. We show that for each set of parameter values there exists a uni...

This paper addresses the toll pricing framework for the first-best pricing with logit-based stochastic user equilibrium (SUE) constraints. The first-best pricing is usually known as marginal-cost toll, which can be obtained by solving a traffic assignment problem based on the marginal cost functions. The marginal-cost toll, however, has rarely been implemented in practice, because it requires e...

For the simulation of pedestrians a method is introduced to find routing alternatives from any origin position to a given destination area in a given geometry composed of walking areas and obstacles. The method includes a parameter which sets a threshold for the approximate minimum size of obstacles to generate routing alternatives. The resulting data structure for navigation is constructed suc...

Article history: Received 19 October 2010 Received in revised form 5 June 2011 Accepted 5 June 2011 Available online xxxx

Disruptions to a network create uncertainty which affects the rationality of a user as well their familiarity of the road network. Accordingly traditional equilibrium concepts are not applicable when disruptions are present on a network, especially when developing models for the purposes of incident mitigation or disaster planning. To address this need, this work presents the disrupted equilibr...

Bounding the inefficiency of selfish routing has become an emerging research subject. A central result obtained in the literature is that the inefficiency of deterministic User Equilibrium (UE) is bounded and the bound is independent of network topology. This paper makes a contribution to the literature by bounding the inefficiency of the logit-based Stochastic User Equilibrium (SUE). In a stoc...