{'fraction_non_alphanumeric': 0.018473895582329317, 'fraction_numerical': 0.0, 'mean_word_length': 5.38974358974359, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A novel reliable path planning approach for multimodal networks based on a two-factor bound convergence algorithm

Due to the influence of diverse factors, travel time is highly uncertain. Travelers are eager to find the most reliable path in multimodal networks to reduce the penalty caused by late arrival. However, the research considering the traveler preferences in multimodal transportation networks to solve the reliable path problem with given budgets is limited. Thus, we propose two multimodal reliable path models to find personalized and reliable paths. First, we build a multimodal network based on smart card data to incorporate the multimodal transfers between public and private transportation and solve corresponding parking issues effectively. Next, we build a multimodal time-reliable path model to find time-reliable paths. Further, considering traveler preferences, we design a multimodal utility-reliable path model to find personalized and reliable paths. A novel two-factor reliability bound convergence algorithm is developed to solve the proposed models and proved for its theoretical feasibility. Finally, a real-world case study is used to verify the effectiveness and efficiency of the proposed models and algorithm.