Font Size: a A A

Research On The Search Algorithm Of Service Path Based On Time-tabling And The Development Of Computer System

Posted on:2018-11-18Degree:MasterType:Thesis
Country:ChinaCandidate:H S ZhangFull Text:PDF
GTID:2322330512997543Subject:Transportation engineering
Abstract/Summary:PDF Full Text Request
In recent years,China high-speed railway has developed quickly.The scale of the network is expanding and the structure is becoming more complex,and the number of passenger trains in the road network is increasing.This leads to a rapid increase in the complexity of service path search in the network.How to search out a reasonable service path quickly and efficiently becomes an important problem in the design of passenger transport products and services.Based on the problem of the service path search based on the timetable,this paper studied the problem of the simplification of the service network and the rationality of the service path,and then realized the single OD service path search algorithm and the whole road OD service path search algorithm to meet the demand of railway operation management department and travel passenger and improve the core-competitiveness of high-speed railway.Firstly,the paper analyzed the current research situation of service network construction and path search algorithm at home and abroad,studied the definition and the construction method of service network which is based on train timetable,clarified the relationship between physical network and service network and design,analyzed the characteristics of service network,then proposed simplified method of service network,and proposed computer model of service network.Aiming at the characteristics of large scale and multi service path,this paper further studied the rationality of the service path,defined the definition of reasonable path,put forward the four kinds of irrational paths,and accordingly summarized the various factors affecting passengers' judgment of path rationality and analyzed in depth to give the various threshold parameter.On the basis of the above research,based on the bidirectional A*algorithm and breadth first algorithm,this paper used the K-shortest-paths of physical network,parallel algorithm and the rationality of the path and other various business rules,designed real time dynamic solution algorithm for single OD service path and the whole OD service path one-time full search algorithm respectively,realized the service path fast search in the service network based on the timetable.Finally,based on the algorithm of this paper,service path search and expression system based on train timetable is realized as the travel time is the shortest,the times of transfer is the least and the shortest transfer time is displayed.A case study is given to illustrate the applicability of the system and the feasibility of the algorithm by using OD at different levels,different regions and different distances.
Keywords/Search Tags:Timetable, Service Network, Path Search, Algorithm Design
PDF Full Text Request
Related items