An algorithm for paths recommendation based on flight schedules

摘要

The paths searching problem based on schedules is to recommend the best K connecting paths for travelers with individual preferences and transport schedules. We first constructed a time-expanded model for flight schedules, and proposed an implementation of depth-first search (DFS) algorithm with dynamically restricted search area to improve the efficiency of the paths searching in view that the covering space of flight networks is very wide. Then, a paths recommendation algorithm (PRDFS_D) based on DFS is proposed. Finally, the efficiency and correctness of PRDFS_D were tested by experiments.