Finding K shortest looping paths with waiting time in a time–window network

Yang, Hsu Hao; Chen, Yen-Liang

doi:10.1016/j.apm.2005.05.005

Cited by 19 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…And more constraints 9–11 were considered when finding K shortest paths as well. Time windows 12–15 and time schedule 16–18 are two important constraints which were extensively studied in recent years.…”

Section: Introductionmentioning

confidence: 99%

A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

Guo

Jia

2016

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

Time-schedule network with constraints on arcs (TSNCA) means network with a list of pre-defined departure times for each arc. Compared to past research on finding the K shortest paths in TSNCA, the algorithm in this paper is suitable for networks having parallel arcs with the same direction between two nodes. A node label algorithm for finding the K shortest paths between two nodes is proposed. Temporal-arcs are put into the labels of nodes and arranged by ascending order. The number of temporal-arcs is limited to K in every label of node to improve the effectiveness of the algorithm. The complexity of this algorithm is OðjAj log r þ K 2 jAj þ K 2 jNj logðKjNjÞÞ, where r is the maximum number of departure times from a node, jAj is the number of arcs in network, and jNj is the number of nodes in network. Experiments are carried out on major part of real urban mass transit network in Beijing, China. The result proves that the algorithm is effective and practical.

show abstract

Section: Introductionmentioning

confidence: 99%

A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

Guo

Jia

2016

Journal of Algorithms & Computational Technology

View full text Add to dashboard Cite

show abstract

“…As stated by Xu et al . , the shortest paths problem in this type of networks is similar to the time‐constrained shortest path problem addressed by Chen and Yang and Yang and Chen or the multi‐costs constrained shortest path problem studied by Van der Zijpp and Catalano .…”

Section: Introductionmentioning

confidence: 81%

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Canca

Zarzo

González‐R

et al. 2012

J of Advced Transportation

View full text Add to dashboard Cite

This paper analyzes the problem of intermodal itineraries recommendation in interurban networks where different public transportation modes, several companies, time, and capacity constraints, as well as seat booking, are considered. The inherent network optimization problem is first modeled for a generic user request, and then a solving method that makes use of a network graph transformation is proposed. For each request, this solving method is based on pruning the user-specific time-space graph, followed by the application of a k-shortest path algorithm. Moreover, in order to build on-demand real-time itineraries recommendations, the algorithm has been embedded in a Web client-server to which users ask for trip recommendations by Internet or mobile phone. Finally, as an illustration, the proposed approach has been tested on the Andalusia main transportation network. ATIS and APTS have been analyzed by many authors, from both a theoretical and technical point of view. Yang and Meng [4] studied the price of using and the benefits gained from ATIS services as two key factors in explaining the growth of adoption of ATIS products. Horn [5] proposed a modeling framework to analyze the performance of urban passenger transport systems, with particular attention to demand-responsive transport modes and traveler information technologies. Levinson [6] and Kenyon and Lyons [7] considered the value of ATIS for route choice and its potential contribution to modal change, respectively. Yin et al.[8] studied how Intelligent Transportation Systems technologies can improve traffic congestion levels in urban road networks. They analyzed the impact that ATIS may play in route choice and departure time decisions. Most of these works are focused on the use of information systems in the private vehicle case. Concerning to the public case, several authors have studied different issues of ATIS and APTS focused on different topics such as users assessment (see e.g., [9] or [10]), congestion costs [11], or technology sourcing evaluation [12]. A recent point of interest has been the integration of ATIS into Web applications (see [13][14][15][16]).Roughly speaking, traveler public information systems have two main aims (see e.g., [17] or [18]). First, they should contribute to minimize the inconvenience of using public transport, simplifying the journey-planning and executing processes. Second, their design should be addressed to diminish the sense in which such a journey is disjointed and awkward, in such a way that the intermodal travel experience becomes closer to that of a journey by private car. To succeed in this latter aim, an accurate and efficient way to manage transfers is needed because, as pointed out in [19], transfers are one of the most important inconveniences perceived by users of multimodal transport systems.At this point, it is clear that, besides the appropriate infrastructure properties of the network, good and well-oriented information becomes also necessary in order to guarantee intermodality success [20]. Moreover...

show abstract

“…The traveling Itinerary Problem (TIP) is a variant of the traveling salesman problem [1][2][3]. Many traveling salesman problem variants and generalizations have been studied extensively [4,5]. Particularly relevant to this research is the shortest path problem [6][7][8][9][10] and the timedependent shortest path problem with time windows also studied in [11][12][13][14][15].…”

Section: Related Workmentioning

confidence: 99%

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Ali,

Jiang,

Buzna

2023

PLoS ONE

View full text Add to dashboard Cite

Developing an efficient and economical journey plan in multimodal transportation networks is of significant and fast-growing importance, but it is still an annoying experience for a traveler. This paper aims to find the journey plan at a combined cross-border and inter-regional level when visiting a sequence of cities while utilizing several transport modes to reduce travel costs and planning time. We study a traveling itinerary problem in a scheduled multimodal transportation network with constraints on both arcs and nodes as a new extension of the shortest path problem. We formulate a 0-1 integer linear programming model for the traveling itinerary problem and develop an exact algorithm that finds a combined cross-border and inter-regional low costs journey plan. We present case studies based on real-world transport data to illustrate the usefulness and computational efficiency of the proposed approaches. We compare the results with the previously proposed approach to demonstrate the benefits of multimodal journeys. Finally, we compare the results with the solution obtained by the general-purpose 0-1 integer linear programming solver to evaluate the computational time.

show abstract

Finding K shortest looping paths with waiting time in a time–window network

Cited by 19 publications

References 24 publications

A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs

A methodology for schedule‐based paths recommendation in multimodal public transportation networks

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Contact Info

Product

Resources

About