Techniques in Multimodal Shortest Path in Public Transport Systems

López, David; Lozano, Angélica

doi:10.1016/j.trpro.2014.10.068

Cited by 9 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work shows that building a multimodal transport model is accompanied by the creation of an algorithm for route search especially for the shortest path route [19]. The model that we have created, can be implemented directly to the graph database, therefore we can rely on the searching algorithm to graph the database management system.…”

Section: Discussionmentioning

confidence: 99%

“…[17] use the model graph for multimodal and relational transportation and several operations needed to implement the graph model that has been formed. In particular, Lopez et al reviewed several network model for multimodal transportation network [19]. In his work, Lopez identfy several network models for multimodal shortest path transport network such as time dependent graph and hierarchical structure graph.…”

Section: A Transportationmentioning

confidence: 99%

See 1 more Smart Citation

Graph Database Schema for Multimodal Transportation in Semarang

Wirawan

Riyanto

Nugraheni

et al. 2019

JISEBI

View full text Add to dashboard Cite

Background: Semarang has broad area that cannot be covered entirely by single transportation mode. To reach a specific location, people often use more than one public transportation mode. Apart from Bus Rapid Transit, another exist namely angkot or city transportation. Multimodal traveler information is then required to help passenger searching for a route. Several studies of multimodal traveler information system has been conducted, however the data model for multimodal transportation did not conceived in detail.Objective: Proposes a database of multimodal transportation design using graph data model by taking Semarang as a case study.Method: We create our model in oriented entity-relationship diagram (O-ERD) and map this O-ERD to the graph database schema.Result: We develop our data model in graph database schema and we implement the model using Neo4J graph database for validation purpose. Our model consist of three graph node label namely Shelter, Angkot Stopper, and Closer Place. To validate our model, we execute a search query using the Cypher query to look for location with closer place to it.Conclusion: Our data model was successfully developed and implemented. Searching transportation route in the implementation of our model has been conducted using cypher query. It can successfully display all possible paths and routes. Our query can distinguish between one mode of transportation with another.Keywords: Graph database, Multimodal transportation, Neo4j, Cypher

show abstract

Section: Discussionmentioning

confidence: 99%

Section: A Transportationmentioning

confidence: 99%

Graph Database Schema for Multimodal Transportation in Semarang

Wirawan

Riyanto

Nugraheni

et al. 2019

JISEBI

View full text Add to dashboard Cite

show abstract

“…In [19], the authors modeled the network using a hierarchical structure. Dynamic segmentation and linear reference techniques are applied, and a three-layer transport system consisting of a physical layer (street network), logical layer (roadway networks), and application layer is constructed (bus, metro, BRT, etc), time-dependent graph [20,21] and time expanded network [22]. Besides several algorithms, the Dijkstra algorithm [23] is still the most frequently used approach to compute the shortest path [17,18,24,25].…”

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

“…Specifically, more and more vehicles are connected to the Internet through vehicle-to-anything (V2X) communication technologies, changing the automotive industry and the transportation system [22]. Validation of mobile ad hoc network protocols relies almost exclusively on simulation [2], [3], [19], [21]. The value of the validation is, therefore, highly dependent on how realistic the mobility model (i.e., mobility pattern of vehicles, including speed and direction) used in the simulations are [23].…”

Section: Introductionmentioning

confidence: 99%

T-START: Time, Status and Region Aware Taxi Mobility Model for Metropolis

2018

KSII TIIS

View full text Add to dashboard Cite

The mobility model is one of the most important factors that impacts the evaluation of any transportation vehicular networking protocols via simulations. However, to obtain a realistic mobility model in the dynamic urban environment is a very challenging task. Several studies extract mobility models from large-scale real data sets (mostly taxi GPS data) in recent years, but they do not consider the statuses of taxi, which is an important factor affected taxi's mobility. In this paper, we discover three simple observations related to the taxi statuses via mining of real taxi trajectories: (1) the behavior of taxi will be influenced by the statuses, (2) the macroscopic movement is related with different geographic features in corresponding status, and (3) the taxi load/drop events are varied with time period. Based on these three observations, a novel taxi mobility model (T-START) is proposed with respect to taxi statuses, geographic region and time period. The simulation results illustrate that proposed mobility model has a good approximation with reality in trajectory samples and distribution of nodes in four typical time periods.

show abstract

Techniques in Multimodal Shortest Path in Public Transport Systems

Cited by 9 publications

References 15 publications

Graph Database Schema for Multimodal Transportation in Semarang

Graph Database Schema for Multimodal Transportation in Semarang

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

T-START: Time, Status and Region Aware Taxi Mobility Model for Metropolis

Contact Info

Product

Resources

About