Study On The Algorithm Of Transfer Route Planning Of Middle-and-long-distance Travel

It’s convenient for people to travel with the various types of traffic and routes,but also it’s difficult for long-distance passengers when they have to select transfer stations and lines.Therefore,this thesis focuses on the solution and application of travel route planning for long-distance passengers.On this basis,researching the characteristic of transport network and passengers’travel psychology,this thesis finds out the influence factors and quantifies the demand.Mathematical model of long-distance travel is established,which aims at the optimization of transfer times,transfer waiting time,total time and cost.Then the model is analyzed,and the core of the model is the reachability constraint.The following will address this core issue.The core of the model is discussed based on an example traffic network diagram.First,we design a multi-contiguous table storage structure of traffic network graph and then design the algorithm to solve the reachability.The algorithm is mainly divided into two parts;the first part is direct operation,when it cannot be reached directly,transfer operation.This thesis focuses on the transfer algorithm.This thesis proposes PPLDT-IFlooding algorithm to solve transfer operation.Point out the deficiency of physarum mathematical model at the part of PPLDT algorithm,and then mainly make three improvements.The first one,the thesis introduces the concept of line direction mechanism and delay time in order to adapt to the traffic network map.The second one,thesis extends definition of tube to correspond model.The third one,thesis adds the random disturbance factor to prevent it from falling into the local optimal solution.Finally,we compare and analyze the parameters of PPLDT algorithm,and get the parameter set for this application environment.The part of IFlooding algorithm improves the efficiency of the algorithm mainly from the implosion and the overlap problem.Inhibitors are introduced about suppression of the terminal of a line,determination of the subset of lines,and time constraints to solve the implosion problem.Introduce identifier to solve the overlap problem.In addition,the concept of depth is used to suppression of number of transfer,and use the search method with line priority to optimize the complexity of search.Finally,the feasibility of the PPLDT-IFlooding algorithm is proved,by comparing with the efficiency and accuracy.At the end of this thesis,the thesis applies the model and algorithm of travel route planning for long-distance passengers and introduces the process of data crawler and standardization.The platform displays the detailed results with different results with different models.What’s more,it will provide abundant proof for the value of this study.