首页> 外文期刊>TRANSPORTATION SCIENCE >An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
【24h】

An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands

机译:具有弹性需求的交通分配问题的有效计算方法

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

摘要

The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose to use a variant of the analytic center cutting plane method to solve this problem. We test the method on TAP instances with the Bureau of Public Roads congestion function and different demand functions (constant elasticity and linear). The results of the numerical experiments show that it is possible to solve large instances with high accuracy.
机译:可以将具有弹性需求的交通分配问题(TAP)公式化为优化问题,其目标是拥塞函数和无效函数的总和。我们建议使用解析中心剖切面方法的一种变体来解决此问题。我们使用公共道路局的拥塞功能和不同的需求功能(恒定弹性和线性)在TAP实例上测试该方法。数值实验的结果表明,可以高精度地求解大型实例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号