Mathematical Programming Model and Algorithm for Time-Varying Transit Network Based on the Environment of Subway
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The optimization of travel for time-varying transit network based on the environment of subway is realized through the establishment of graph theory model. First, bus and subway network graph, bipartite graph and mapping network graph which is based on the network graph are established. The weight between two subway stations is appropriately reduced in order that we can optimize subway. Meanwhile, time variation of bus and subway is considered in this paper. Whether the time we travel is in their operational period is directly related to the optimal path queried. Then, the optimal path selection algorithm based on the purpose of less transfer times and short distance is given. Finally, we use a numerical example to illustrate the solution process of the proposed method.

    Reference
    Related
    Cited by
Get Citation

徐勇,贾欣,王哲,王翠柳.地铁环境下时变公交网络的最优路算法.计算机系统应用,2015,24(1):104-108

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 18,2014
  • Revised:May 16,2014
  • Adopted:
  • Online: January 23,2015
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063