首页> 外文期刊>Netnomics >Heuristic algorithms for a second-best congestion pricing problem
【24h】

Heuristic algorithms for a second-best congestion pricing problem

机译:次优拥挤定价问题的启发式算法

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

摘要

Designing a congestion pricing scheme involves a number of complex decisions. Focusing on the quantitative parts of a congestion pricing system with link tolls, the problem involves finding the number of toll links, the link toll locations and their corresponding toll level and schedule. In this paper, we develop and evaluate methods for finding the most efficient design for a congestion pricing scheme in a road network model with elastic demand. The design efficiency is measured by the net social surplus, which is computed as the difference between the social surplus and the collection costs (i.e. setup and operational costs) of the congestion pricing system. The problem of finding such a scheme is stated as a combinatorial bi-level optimization problem. At the upper level, we maximize the net social surplus and at the lower level we solve a user equilibrium problem with elastic demand, given the toll locations and toll levels, to simulate the user response. We modify a known heuristic procedure for finding the optimal locations and toll levels given a fixed number of tolls to locate, to find the optimal number of toll facilities as well. A new heuristic procedure, based on repeated solutions of a continuous approximation of the combinatorial problem is also presented. Numerical results for two small test networks are presented. Both methods perform satisfactorily on the two networks. Comparing the two methods, we find that the continuous approximation procedure is the one which shows the best results.
机译:设计拥堵定价方案涉及许多复杂的决策。关注具有链路通行费的拥挤定价系统的定量部分,该问题涉及找到通行费链路的数量,链路通行费位置及其相应的通行费水平和时间表。在本文中,我们开发和评估了在具有弹性需求的路网模型中找到最有效的拥堵定价方案设计方法。设计效率由净社会剩余量来衡量,该净剩余量被计算为社会剩余量与拥挤定价系统的收集成本(即安装和运营成本)之间的差额。找到这种方案的问题被称为组合双层优化问题。在较高的层次上,我们最大化了净社会剩余,在较低的层次上,我们根据给定的通行费位置和通行费水平,解决了具有弹性需求的用户均衡问题,以模拟用户的响应。我们修改了一种已知的启发式程序,以在给定固定数量的通行费的情况下找到最佳位置和通行费水平,以及找到最佳通行费设施。还提出了一种新的启发式方法,该方法基于组合问题连续逼近的重复解。给出了两个小型测试网络的数值结果。两种方法在两个网络上都能令人满意地执行。比较这两种方法,我们发现连续逼近过程是显示最佳结果的过程。

著录项

  • 来源
    《Netnomics》 |2009年第1期|85-102|共18页
  • 作者单位

    Department of Science and Technology, Linkoeping University,SE-601 74 Norrkoeping, Sweden;

    Centre for Traffic Research, Royal Institute of Technology,SE-100 44 Stockholm, Sweden;

    Department of Science and Technology, Linkoeping University,SE-601 74 Norrkoeping, Sweden;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-18 01:19:41

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号