Bi-Objective Inducing Optimal Paths Recommendation Algorithm Based on Time Schedule

Abstract

There is no absolute shortest path by using a bi-objective model to solve the optimal path problem. Based on the flight and train schedules, we establish the transfer time reliability model in the transfer station according to the reliability theory, as well as combine this model with the bi-objective optimal path optimization model. The improved PRDFS D algorithm is used to calculate the path set which meets the conditions. By using the constructed auxiliary function the top K earliest arrival paths are found out through the multiple iterations gradually within the path set. Moreover, the relationship between the auxiliary function and the bi-objective function with regulation factor a and the relationship between the number of iterations when calculating the top K earliest arrival paths and threshold L are verified by experiments. These relationships are consistent with theoretical analysis.