Computing network tolls with support constraints
نویسندگان
چکیده
منابع مشابه
Computing network tolls with support constraints
Reducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been implemented in several cities all over the world. Since in practice it is not feasible to impose tolls on every edge of a given traffic network, we study the resulting mathematical problem of computing tolls on a predefined subset of edges of ...
متن کاملComputing Optimal Tolls with Arc Restrictions and Heterogeneous Players
The problem of computing optimal network tolls that induce a Nash equilibrium of minimum total cost has been studied intensively in the literature, but mostly under the assumption that these tolls are unrestricted. Here we consider this problem under the more realistic assumption that the tolls have to respect some given upper bound restrictions on the arcs. The problem of taxing subnetworks op...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملInterfacing Sensor Network to Grid Computing with Database Support
The widespread distribution and availability of small-scale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. Sensor networks that combine physical sensing capabilities such as temperature, light with networking and computation capabilities are becoming ubiquitous. Applications range from environmental control, warehouse inventory, and hea...
متن کاملComputing Tolls and Checking Equilibrium for Traac Flows
We consider the problems of computing tolls and checking for equilibrium of ows in a traac network in which travelers act according to Wardrop's user-equilibrium principle. We provide an algorithm which, given any feasible distribution of traac ows, and the corresponding link traversal times, will either (i) determine that the given ows and travel times satisfy Wardrop's user-equilibrium princi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2015
ISSN: 0028-3045
DOI: 10.1002/net.21604