• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Promet-traffic & transportation >TWO-STEP META-HEURISTIC APPROACH FOR A VEHICLE ASSIGNMENT PROBLEM - CASE FROM ISTANBUL/TURKEY
【24h】

TWO-STEP META-HEURISTIC APPROACH FOR A VEHICLE ASSIGNMENT PROBLEM - CASE FROM ISTANBUL/TURKEY

机译：用于车辆分配问题的两步元启发式方法 - 来自伊斯坦布尔/土耳其的情况

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

摘要

In this paper, a two-step meta-heuristic approach is proposed for vehicle assignment problem with geometric shape-based clustering and genetic algorithm. First, the geometric shape-based clustering method is used and then the solution of this method is given to the genetic algorithm as initial solution. The solution process is continued by genetic algorithm. There are 282 bus lines in Istanbul European side. Those buses should be assigned to six bus garages. The proposed method is used to determine the minimum distance between the bus lines and garages by assigning buses to garages. According to the computational results, the proposed algorithm has better clustering performance in terms of the distance from each bus-line start point to each bus garage in the cluster. The crossover rate changing method is also applied as a trial in order to improve the algorithm performance. Finally, the outputs that are generated by different crossover rates are compared with the results of the k-Nearest Neighbour algorithm to prove the effectiveness of the study.
机译：本文提出了一种两步的荟萃启发式方法，用于基于几何形状的聚类和遗传算法的车辆分配问题。首先，使用基于几何形状的聚类方法，然后将该方法的解决方法作为初始解决方案给予遗传算法。通过遗传算法继续解决方法。伊斯坦布尔欧洲边有282条巴士线。这些公共汽车应分配到六个巴士车库。所提出的方法用于通过将公共汽车分配给车库来确定总线和车库之间的最小距离。根据计算结果，所提出的算法在每个总线启动点到群集中的每个总线车库的距离方面具有更好的聚类性能。交叉速率改变方法也被应用为试验，以便提高算法性能。最后，将通过不同的交叉速率产生的输出与K-最近邻算法的结果进行比较，以证明研究的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号