首页> 外文会议>Wase Global Congress on Science Engineering >Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix
【24h】

Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix

机译:基于邻接矩阵的公共交通转移最优路由算法研究

获取原文

摘要

This paper introduces the Adjacency Matrix at the very beginning, the least transfer between two nodes can be obtained by using the Adjacency Matrix, and then Z matrix is introduced to achieve optimal routing algorithm for public transit transfer and to obtain optimal route by using the "two-step-descending-proliferation" algorithm. Through the "two-step" approach, efficiency and feasibility of data processing was increased. The algorithm focus on multi-objective optimization - takes the least transfer, the least cost, the shortest time, and so on.
机译:本文在开始时介绍了邻接矩阵,通过使用邻接矩阵可以获得两个节点之间的最少的传输,然后引入Z矩阵以实现公共交通转移的最佳路由算法,并通过使用“获得最佳路线两步下行增殖“算法。通过“两步”方法,增加数据处理的效率和可行性。该算法专注于多目标优化 - 采取最少的传输,最少的成本,最短的时间等。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号