首页> 外文会议>15th International Symposium on Transportation and Traffic Theory Jul 16-18, 2002 Adelaide, Australia >A SENSITIVITY-BASED SOLUTION ALGORITHM FOR THE NETWORK MODEL OF URBAN TAXI SERVICES
【24h】

A SENSITIVITY-BASED SOLUTION ALGORITHM FOR THE NETWORK MODEL OF URBAN TAXI SERVICES

机译:城市出租车服务网络模型的基于灵敏度的求解算法

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

摘要

A sensitivity-based algorithm has been proposed to solve the taxi model with elastic demand in a congested road network. In this algorithm, the Jacobian matrix of the SLNE is expressed explicitly as a function of the solution from the CNEM results, and is renewed at each SLNE iteration to maintain the best quality of likely descent direction. It has been found from an extensive computational experiment that the sensitivity-based algorithm is much more efficient than the quasi-Newtonian algorithm proposed in Wong et al. (2001) in which an initial Jacobian matrix needs to be computed by means of a computationally intensive finite difference method at the first iteration.
机译:提出了一种基于灵敏度的算法来求解拥挤路网中具有弹性需求的出租车模型。在该算法中,SLNE的雅可比矩阵明确表示为CNEM结果的解的函数,并在每次SLNE迭代时更新,以保持可能下降方向的最佳质量。从广泛的计算实验中发现,基于灵敏度的算法比Wong等人提出的准牛顿算法更有效。 (2001),其中需要在第一次迭代时通过计算密集型有限差分方法来计算初始雅可比矩阵。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号