首页> 外文期刊>Journal of Infrastructure Systems >Algorithm for the Planning of Optimum Highway Work Zones
【24h】

Algorithm for the Planning of Optimum Highway Work Zones

机译:公路最佳作业区规划算法

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

摘要

Work zones often cause traffic congestion on high volume roads. As traffic volumes increase so does work zone-related traffic congestion and so does the public demand for road agencies to decrease both their number and duration. Negative impacts on road users can be minimized by bundling interventions on several interconnected road sections instead of treating each road section separately. Negative impacts on road users can be quantified in user costs. The optimum work zone is the one that results in the minimum overall agency and user costs. The minimization of these costs is often the goal of corridor planning. In order to achieve this goal the interventions on each asset type (pavement, bridges, tunnels, hardware, etc.) must be bundled into optimum packages. In this paper a method is presented that enables road agencies to determine optimum work zones and intervention packages. The method allows the consideration of both budget constraints and distance constraints, including maximum permissible work zone length or minimum distance between work zones. The mathematical formulation of this optimization problem is a binary program that can be solved by existing techniques (i.e., the branch-and-bound method). The feasibility of the approach is illustrated with a simple example.
机译:工作区通常会导致高流量道路上的交通拥堵。随着交通量的增加,与工作区相关的交通拥堵也随之增加,公众对道路代理机构的要求也不断减少。通过将干预措施捆绑在多个相互连接的路段上,而不是分别处理每个路段,可以最大程度地减少对道路使用者的负面影响。对道路使用者的负面影响可以用使用者成本来量化。最佳工作区是使总代理和用户成本最小的区域。这些成本的最小化通常是走廊规划的目标。为了实现此目标,必须将对每种资产类型(人行道,桥梁,隧道,硬件等)的干预措施打包成最佳包装。本文提出了一种方法,可使公路部门确定最佳的工作区域和干预方案。该方法允许同时考虑预算约束和距离约束,包括最大允许工作区长度或工作区之间的最小距离。此优化问题的数学公式是可以通过现有技术(即分支定界方法)求解的二进制程序。通过一个简单的例子说明了该方法的可行性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号