...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Expert Systems with Application >A differential evolution for simultaneous transit network design and frequency setting problem
【24h】

A differential evolution for simultaneous transit network design and frequency setting problem

机译：同时公交网络设计和频率设置问题的差分发展

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The urban transit network design problem (UTNDP) is concerned with the development of a set of transit routes and corresponding schedules on an existing road network with known demand points and travel time. It is an NP-hard combinatorial optimization problem characterized by high computational intractability, leading to utilization of a wide variety of heuristics and metaheuristics in an attempt to find near-optimal solutions. This paper proposes a differential evolution approach to address the UTNDP by simultaneously determining the set of transit routes and their associated service frequency with the objective to minimize the passenger cost, as well as the unmet demand. In addition, a combined repair mechanism is employed to deal with the infeasible route sets generated from the route construction heuristic and the operators of the differential evolution. The proposed algorithm is evaluated on a well-known Mandl's Swiss network reported in the literature. Computational experiments show that the proposed algorithm is competitive according to the performance metrics with other approaches in the literature. (C) 2018 The Author(s). Published by Elsevier Ltd.
机译：城市公交网络设计问题（UTNDP）与在已知需求点和行驶时间的现有道路网络上开发一组公交路线和相应的时间表有关。这是一个NP-hard组合优化问题，其特征在于计算的难处理性高，导致尝试探索近乎最优的解决方案时会使用各种启发式方法和元启发式方法。本文提出了一种差分进化方法，通过同时确定公交路线的集合及其相关的服务频率来解决UTNDP，目的是最大程度地降低乘客成本以及需求缺口。另外，采用组合修复机制来处理由路线构造试探法和差分进化算子产生的不可行路线集。在文献中报道的著名的Mandl's Swiss网络上对提出的算法进行了评估。计算实验表明，该算法在性能指标上与文献中的其他方法相比具有竞争优势。 （C）2018作者。由Elsevier Ltd.发布

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号