检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Hidenori Ikeshita Atsushi Fukuda
机构地区:[1]Road Policy Group,Japan Institute of Country-ology and Engineering,Tokyo 1050001,Japan [2]Department of Transportation Systems Engineering,College of Science and Technology,Nihon University,Chiba 2748501,Japan
出 处:《Journal of Traffic and Transportation Engineering》2018年第3期121-133,共13页交通与运输工程(英文版)
摘 要:This study discusses the optimal link toll,which maximizes social surplus under a user equilibrium condition,with imperfect substitution assumption for route choice in a transportation network with many nodes and links,as well as taking into account the welfare cost of funds procurement.In contrast to previous studies,this study formulates optimal link tolls,taking into account the marginal cost of public funds(MCF),which is the marginal welfare loss of taxpayers due to a marginal tax raise.The formula for optimal tolls on links is derived from the following conditions.One is MCF classified into two,not taking into account funding(MCF equal to-1)and pricing for funding(MCF does not equal-1).Another is tolls classified into two,pricing on all links(full link pricing),and pricing on a specific link(partial link pricing).Following the above conditions,this study succeeds in deriving the formula for optimal tolls on a full network with many links and nodes.Furthermore,this study indicates two calculation methods:one is to solve analytically or numerically for when the functional form of link flow demand is known.When the functional form is unknown,such as a perfect substitution case,it is necessary to carry out iteration until convergence:with the traffic assignment given the price level and with a change in price level based on the traffic assignment.
关 键 词:OPTIMAL TOLLS congestion MCF procurement of FUNDS
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28