首页> 外文期刊>Journal of Advanced Transportation >Design of a tabu search algorithm for assigning optimal bus sizes and frequencies in urban transport services
【24h】

Design of a tabu search algorithm for assigning optimal bus sizes and frequencies in urban transport services

机译:禁忌搜索算法的设计,用于分配城市交通服务中的最佳公交车尺寸和频率

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

摘要

This article presents a bi-level optimization model to assign optimal bus sizes and frequencies to public transport routes. The upper level problem of the proposed model minimizes a cost function representing the costs of the users and operators, and the lower level solves a public transport assignment model subject to a capacity constraint. The article discusses the benefits of using either Hooke-Jeeves or tabu search algorithms for solving the bi-level model. Following the real-case application to the city of Santander (Spain), it is concluded that both algorithms lead to very similar solutions. It has also been shown that when both algorithms start from the same homogenous solution, the convergence speed of tabu search is almost 50% quicker than that of Hooke-Jeeves, making tabu search more attractive if there is a need to solve a problem many times and for large networks. Copyright © 2012 John Wiley & Sons, Ltd.
机译:本文提出了一种双层优化模型,以为公交路线分配最佳公交车尺寸和频率。所提出模型的上层问题最小化了代表用户和运营商成本的成本函数,而下层问题则解决了受容量约束的公共交通分配模型。本文讨论了使用Hooke-Jeeves或禁忌搜索算法来求解双层模型的好处。在将实际案例应用于西班牙桑坦德市之后,得出的结论是,两种算法均导致非常相似的解决方案。还显示出,当两种算法都从相同的同质解开始时,禁忌搜索的收敛速度比Hooke-Jeeves的收敛速度快近50%,如果需要多次解决问题,禁忌搜索将更具吸引力。和大型网络。版权所有©2012 John Wiley&Sons,Ltd.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号