Assess reliability of a tourism transport network considering limited-budget and late arrivals

Abstract

Tourism transport is becoming a crucial part of the tourism industry. Determining the reliability of tourism transport networks is required by travel agencies and other practitioners. However, much of recent reliability assessments cannot utilize directly for tourism transport networks. Moreover, there exists a lack of passengers-oriented reliability evaluation that involves the impacts of latency. Therefore, this study assesses reliability regarding carrying the required number of passengers to their destination under budget and time constraints when considering late arrivals. For reliability assessment, an algorithm, which combines the concept of the minimal path adding a searching procedure with the Recursive Sum of Disjoint Products method, is proposed. An illustrative example is adopted to provide travel agencies with an intuitive visualization of the proposed algorithm. Reliability analysis suggests improving the performance of tourism transport networks.

Using a Node–Child Matrix to Address the Quickest Path Problem in Multistate Flow Networks under Transmission Cost Constraints

“…In this problem, each network arc is characterized by two key attributes: a lead time value and a capacity value. The significance of this optimization problem is well recognized by researchers due to its applicability across a broad spectrum of flow network scenarios [1][2][3][4][5][6][7][8][9][10][11][12][13]. This problem initially emerged when discovering the fastest route for convoy-type traffic within flow-rate-constrained networks [1].…”