论文标题
选择和安排道路网络升级的最佳子集
Selecting and scheduling an optimal subset of road network upgrades
论文作者
论文摘要
我们考虑了选择拟议的道路网络升级子集以在固定预算内实施的问题，以优化行驶的车时（VHT）的收益，并展示如何通过减少必须解决的交通交易问题的数量来使该问题的解决方案更具处理方式。该技术将扩展到开发一种启发式算法，以在计划期间找到一定的道路升级时间表，以最大程度地提高所得VHT降低的BET现代价值。
We consider the problem of choosing a subset of proposed road network upgrades to implement within a fixed budget in order to optimize the benefit in terms of vehicle hours travelled (VHT), and show how to render the solution of this problem more tractable by reducing the number of traffic assignment problems that must be solved. This technique is extended to develop a heuristic algorithm for finding a schedule of road upgrades over a planning period that maximizes the bet present value of the resulting VHT reductions.
