With the development of global aviation industry,a huge international airline network has been formed.In order to solve the problem that the connecting path search method takes long time in global airline network,the objective of this paper is to find out all the target connecting flights paths fast between an OD pair.According to the features of the connecting path search in the schedule-based network,the solving method is divided into three stages.In the first stage,we build a time-space graph.In the next stage,three-step cutting is used to reduce the scale of graph.After that,we apply an algorithm which is combined with depth-first and breadth-first search algorithm to enumerate the paths.It can be seen that our algorithm is suitable for multi-constraints,big data and searching all paths.
展开▼
