• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Part B: Methodological >Optimizing toll locations and levels using a mixed integer linear approximation approach
【24h】

Optimizing toll locations and levels using a mixed integer linear approximation approach

机译：使用混合整数线性逼近方法优化收费站的位置和水平

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper addresses the toll design problem of finding the toll locations and levels in a congestion pricing scheme, which minimize the total travel time and the toll-point cost (set-up and operational costs of the toll collecting facilities). Road users in the network are assumed to be distributed according to the principle of user equilibrium, with the demand assumed to be fixed and given a priori. The toll design problem is commonly formulated as a non-linear program, which in general is non-convex and non-smooth, and thus difficult to solve for a global optimum. In this paper, the toll design problem is approximated by a mixed integer linear program (M1LP), which can be solved to its globally optimal solution. The MILP also gives a lower bound estimation of the original non-linear problem, and the accuracy of the approximation is improved by iteratively updating the MILP. To demonstrate the approach, we apply the algorithm to two networks: a smaller network with 18 links and 4 OD-pairs to illustrate the properties of the approach, and the Sioux Falls network with 87 links and 30 OD-pairs to demonstrate the applicability of the approach.
机译：本文解决了在拥挤定价方案中查找路费位置和水平的路费设计问题，该问题将总行驶时间和路费点成本（路费收集设施的设置和运营成本）降至最低。假设网络中的道路用户是根据用户均衡的原则进行分配的，需求是固定的，并且具有先验性。通行费设计问题通常被表述为非线性程序，该程序通常是非凸且非平滑的，因此难以求解全局最优。在本文中，通行费设计问题是通过混合整数线性程序（M1LP）近似的，可以将其求解为全局最优解。 MILP还给出了原始非线性问题的下界估计，并且通过迭代更新MILP提高了近似精度。为了演示该方法，我们将该算法应用于两个网络：一个具有18个链接和4个OD对的较小网络，以说明该方法的性能；以及具有87个链接和30个OD对的Sioux Falls网络，以说明该算法的适用性。该方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号