首页> 外文期刊>Journal of transportation research forum >A Dynamic Programming Optimization Approach for Budget Allocation to Early Right-of-Way Acquisitions
【24h】

A Dynamic Programming Optimization Approach for Budget Allocation to Early Right-of-Way Acquisitions

机译:预算分配给早期通行权的动态规划优化方法

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

摘要

Maximizing potential savings when purchasing right-of-way within a limited budget is a challenge currently faced by state departments of transportation (DOTs) across the nation. Early right-of-way acquisitions promote smoother negotiations and are aimed to save money, time, and human resources. This paper describes an optimization approach based on dynamic programming developed for the Texas Department of Transportation (TxDOT) to identify projects with candidate parcels for early right-of-way acquisition in order to achieve the highest potential savings. Each candidate parcel must be subjected to a preliminary environmental analysis to ensure that each comply with the National Environmental Policy Act (NEPA) standards.
机译:在有限的预算内购买通行权时,最大程度地节省潜在成本是目前美国各州交通部门(DOT)面临的挑战。早期的通行权收购可促进更顺利的谈判,并旨在节省金钱,时间和人力资源。本文介绍了一种基于动态编程的优化方法,该优化方法是为德克萨斯州交通运输部(TxDOT)开发的,用于识别包含候选包裹的项目,以便尽早获得路权,以实现最大的潜在节省。必须对每个候选包裹进行初步的环境分析,以确保每个包裹都符合《国家环境政策法》(NEPA)的标准。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号