首页> 外文期刊>Transportation research >Personalized Pareto-improving pricing-and-routing schemes for near-optimum freight routing: An alternative approach to congestion pricing
【24h】

Personalized Pareto-improving pricing-and-routing schemes for near-optimum freight routing: An alternative approach to congestion pricing

机译:用于近最佳货运路线的个性化帕累托改善定价和路由方案:拥堵定价的替代方法

获取原文
获取原文并翻译 | 示例
       

摘要

Traffic congestion constitutes a major problem in urban areas. Trucks contribute to congestion and have a negative impact on the environment due to their size, slower dynamics and higher fuel consumption. The individual routing decisions made by truck drivers do not lead to system optimum operations and contribute to traffic imbalances especially in places where the volume of trucks is relatively high. In this paper, we design a coordination mechanism for truck drivers that uses pricing-and-routing schemes that can help alleviate traffic congestion in a general transportation network. We consider the user heterogeneity in Value-Of-Time (VOT) by adopting a multi-class model with stochastic Origin?Destination (OD) demands for the truck drivers. The main characteristic of the mechanism is that the coordinator asks the truck drivers to declare their desired OD pair and pick their individual VOT from a set of N available options, and guarantees that the resulting pricing-and-routing scheme is Pareto-improving, i.e. every truck driver will be better-off compared to the User Equilibrium (UE) and that every truck driver will have an incentive to truthfully declare his/her VOT, while leading to a revenue-neutral (budget balanced) on average mechanism. This approach enables us to design personalized (VOT-based) pricingand-routing schemes. We show that the Optimum Pricing Scheme (OPS) can be calculated by solving a nonconvex optimization problem. To improve computational efficiency, we propose an Approximately Optimum Pricing Scheme (AOPS) and prove that it satisfies the aforementioned properties. Both pricing-and-routing schemes are compared to the Congestion Pricing with Uniform Revenue Refunding (CPURR) scheme through extensive simulation experiments where it is shown that OPS and AOPS achieve a much lower expected total travel time and expected total monetary cost for the users compared to the CPURR scheme, without negatively affecting the rest of the network. These results demonstrate the efficiency of personalized (VOT-based) pricing-and
机译:交通拥堵构成城市地区的主要问题。由于尺寸,较慢的动态和更高的燃料消耗,卡车贡献挤塞,对环境产生负面影响。卡车司机制造的个人路线决策不会导致系统最佳操作,并促进交通不平衡,特别是在卡车数量相对较高的地方。在本文中,我们设计了用于卡车驱动程序的协调机制,该机制使用定价和路由方案,这些方案可以帮助缓解通用运输网络中的交通拥堵。我们通过采用随机起源的多级模型来考虑时间值(VOT)的用户异质性?卡车司机的目的地(OD)需求。该机制的主要特征是,协调器询问卡车司机声明他们所需的OD对并从一组N可用选项中挑选他们的个人票据,并保证所产生的定价和路由方案是普通改进的,即与用户均衡(UE)相比,每辆卡车司机将会更好,并且每辆卡车司机都会有动力宣布他/她的投票,同时导致平均机制上的收入中立(预算平衡)。这种方法使我们能够设计个性化(基于VOT)的价格标准和路由方案。我们表明,可以通过解决非渗透优化问题来计算最佳定价方案(OPS)。为了提高计算效率,我们提出了大约最佳定价方案(AOP)并证明它满足上述性质。定价和路由方案都与具有统一收入退款(CPURR)方案的拥塞定价通过广泛的模拟实验进行了比较,其中显示OPS和AOPS实现了更低的预期总旅行时间和预期用户的总货币成本比较到CPURR方案,而不会对其其余的网络产生负面影响。这些结果表明了个性化(基于选票)定价的效率 - 和

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号